MCC'2023- Execution of r457-smll-167912649300452

About the Execution of LTSMin+red for StigmergyCommit-PT-05b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1189.972	341462.00	428439.00	1740.10	F?FFFF?FFFFFFFFF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r457-smll-167912649300452.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 StigmergyCommit-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649300452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 10:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 10:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 10:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 10:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 10:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 10:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 10:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 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 1.4M 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 StigmergyCommit-PT-05b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679444265771

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=StigmergyCommit-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 00:17:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 00:17:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:17:48] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2023-03-22 00:17:48] [INFO ] Transformed 1837 places.
[2023-03-22 00:17:48] [INFO ] Transformed 3460 transitions.
[2023-03-22 00:17:48] [INFO ] Found NUPN structural information;
[2023-03-22 00:17:48] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 516 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-05b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 1837 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Discarding 145 places :
Symmetric choice reduction at 0 with 145 rule applications. Total rules 145 place count 1692 transition count 3315
Iterating global reduction 0 with 145 rules applied. Total rules applied 290 place count 1692 transition count 3315
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 380 place count 1602 transition count 3225
Iterating global reduction 0 with 90 rules applied. Total rules applied 470 place count 1602 transition count 3225
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 522 place count 1550 transition count 3173
Iterating global reduction 0 with 52 rules applied. Total rules applied 574 place count 1550 transition count 3173
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 620 place count 1504 transition count 3127
Iterating global reduction 0 with 46 rules applied. Total rules applied 666 place count 1504 transition count 3127
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 706 place count 1464 transition count 3087
Iterating global reduction 0 with 40 rules applied. Total rules applied 746 place count 1464 transition count 3087
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 785 place count 1425 transition count 3048
Iterating global reduction 0 with 39 rules applied. Total rules applied 824 place count 1425 transition count 3048
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 860 place count 1389 transition count 3012
Iterating global reduction 0 with 36 rules applied. Total rules applied 896 place count 1389 transition count 3012
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 932 place count 1353 transition count 2976
Iterating global reduction 0 with 36 rules applied. Total rules applied 968 place count 1353 transition count 2976
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 998 place count 1323 transition count 2946
Iterating global reduction 0 with 30 rules applied. Total rules applied 1028 place count 1323 transition count 2946
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 1052 place count 1299 transition count 2922
Iterating global reduction 0 with 24 rules applied. Total rules applied 1076 place count 1299 transition count 2922
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 1081 place count 1299 transition count 2917
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1091 place count 1289 transition count 2907
Iterating global reduction 1 with 10 rules applied. Total rules applied 1101 place count 1289 transition count 2907
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1111 place count 1279 transition count 2897
Iterating global reduction 1 with 10 rules applied. Total rules applied 1121 place count 1279 transition count 2897
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1126 place count 1274 transition count 2892
Iterating global reduction 1 with 5 rules applied. Total rules applied 1131 place count 1274 transition count 2892
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1136 place count 1269 transition count 2887
Iterating global reduction 1 with 5 rules applied. Total rules applied 1141 place count 1269 transition count 2887
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1146 place count 1264 transition count 2882
Iterating global reduction 1 with 5 rules applied. Total rules applied 1151 place count 1264 transition count 2882
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1155 place count 1260 transition count 2878
Iterating global reduction 1 with 4 rules applied. Total rules applied 1159 place count 1260 transition count 2878
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1163 place count 1256 transition count 2874
Iterating global reduction 1 with 4 rules applied. Total rules applied 1167 place count 1256 transition count 2874
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1171 place count 1252 transition count 2870
Iterating global reduction 1 with 4 rules applied. Total rules applied 1175 place count 1252 transition count 2870
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1179 place count 1248 transition count 2866
Iterating global reduction 1 with 4 rules applied. Total rules applied 1183 place count 1248 transition count 2866
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1187 place count 1244 transition count 2862
Iterating global reduction 1 with 4 rules applied. Total rules applied 1191 place count 1244 transition count 2862
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1195 place count 1240 transition count 2858
Iterating global reduction 1 with 4 rules applied. Total rules applied 1199 place count 1240 transition count 2858
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1203 place count 1236 transition count 2854
Iterating global reduction 1 with 4 rules applied. Total rules applied 1207 place count 1236 transition count 2854
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1211 place count 1236 transition count 2850
Applied a total of 1211 rules in 2683 ms. Remains 1236 /1837 variables (removed 601) and now considering 2850/3460 (removed 610) transitions.
// Phase 1: matrix 2850 rows 1236 cols
[2023-03-22 00:17:52] [INFO ] Computed 7 place invariants in 85 ms
[2023-03-22 00:17:52] [INFO ] Implicit Places using invariants in 953 ms returned []
[2023-03-22 00:17:53] [INFO ] Invariant cache hit.
[2023-03-22 00:17:54] [INFO ] Implicit Places using invariants and state equation in 1852 ms returned []
Implicit Place search using SMT with State Equation took 2852 ms to find 0 implicit places.
[2023-03-22 00:17:54] [INFO ] Invariant cache hit.
[2023-03-22 00:17:57] [INFO ] Dead Transitions using invariants and state equation in 2202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1236/1837 places, 2850/3460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7741 ms. Remains : 1236/1837 places, 2850/3460 transitions.
Support contains 60 out of 1236 places after structural reductions.
[2023-03-22 00:17:57] [INFO ] Flatten gal took : 407 ms
[2023-03-22 00:17:58] [INFO ] Flatten gal took : 216 ms
[2023-03-22 00:17:58] [INFO ] Input system was already deterministic with 2850 transitions.
Support contains 54 out of 1236 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 661 ms. (steps per millisecond=15 ) properties (out of 33) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :0
Interrupted probabilistic random walk after 154933 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{19=1, 23=1}
Probabilistic random walk after 154933 steps, saw 35158 distinct states, run finished after 3005 ms. (steps per millisecond=51 ) properties seen :2
Running SMT prover for 29 properties.
[2023-03-22 00:18:02] [INFO ] Invariant cache hit.
[2023-03-22 00:18:04] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2023-03-22 00:18:05] [INFO ] After 1538ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:26
[2023-03-22 00:18:07] [INFO ] Deduced a trap composed of 313 places in 1133 ms of which 20 ms to minimize.
[2023-03-22 00:18:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1408 ms
[2023-03-22 00:18:07] [INFO ] After 3467ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:27
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-22 00:18:07] [INFO ] After 4822ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:27
[2023-03-22 00:18:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 15 ms returned sat
[2023-03-22 00:18:19] [INFO ] After 10511ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :27
[2023-03-22 00:18:21] [INFO ] Deduced a trap composed of 313 places in 892 ms of which 2 ms to minimize.
[2023-03-22 00:18:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1127 ms
[2023-03-22 00:18:33] [INFO ] Deduced a trap composed of 313 places in 1031 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 00:18:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:18:33] [INFO ] After 25234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2 real:27
Fused 29 Parikh solutions to 26 different solutions.
Parikh walk visited 21 properties in 321 ms.
Support contains 7 out of 1236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Graph (trivial) has 1219 edges and 1236 vertex of which 102 / 1236 are part of one of the 18 SCC in 10 ms
Free SCC test removed 84 places
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 2096 edges and 1152 vertex of which 1146 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.31 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 856 transitions
Trivial Post-agglo rules discarded 856 transitions
Performed 856 trivial Post agglomeration. Transition count delta: 856
Iterating post reduction 0 with 862 rules applied. Total rules applied 864 place count 1146 transition count 1874
Reduce places removed 856 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 875 rules applied. Total rules applied 1739 place count 290 transition count 1855
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 1750 place count 282 transition count 1852
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1753 place count 279 transition count 1852
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 70 Pre rules applied. Total rules applied 1753 place count 279 transition count 1782
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 1893 place count 209 transition count 1782
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1895 place count 207 transition count 1780
Iterating global reduction 4 with 2 rules applied. Total rules applied 1897 place count 207 transition count 1780
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1899 place count 205 transition count 1778
Iterating global reduction 4 with 2 rules applied. Total rules applied 1901 place count 205 transition count 1778
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1987 place count 162 transition count 1735
Drop transitions removed 1 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 2000 place count 162 transition count 1722
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 2034 place count 128 transition count 359
Iterating global reduction 5 with 34 rules applied. Total rules applied 2068 place count 128 transition count 359
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 2086 place count 128 transition count 341
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2103 place count 111 transition count 324
Iterating global reduction 6 with 17 rules applied. Total rules applied 2120 place count 111 transition count 324
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2132 place count 99 transition count 312
Iterating global reduction 6 with 12 rules applied. Total rules applied 2144 place count 99 transition count 312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2150 place count 99 transition count 306
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2164 place count 92 transition count 299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2170 place count 89 transition count 307
Free-agglomeration rule applied 35 times.
Iterating global reduction 7 with 35 rules applied. Total rules applied 2205 place count 89 transition count 272
Reduce places removed 35 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 68 rules applied. Total rules applied 2273 place count 54 transition count 239
Drop transitions removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 8 with 63 rules applied. Total rules applied 2336 place count 54 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2338 place count 53 transition count 175
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2342 place count 51 transition count 193
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 2349 place count 51 transition count 193
Applied a total of 2349 rules in 501 ms. Remains 51 /1236 variables (removed 1185) and now considering 193/2850 (removed 2657) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 501 ms. Remains : 51/1236 places, 193/2850 transitions.
Finished random walk after 7649 steps, including 521 resets, run visited all 6 properties in 39 ms. (steps per millisecond=196 )
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA StigmergyCommit-PT-05b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 254 stabilizing places and 266 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F((p1&&F(p2))))))'
Support contains 14 out of 1236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1228 transition count 2842
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1228 transition count 2842
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 1221 transition count 2835
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 1221 transition count 2835
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 1215 transition count 2829
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 1215 transition count 2829
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 1210 transition count 2824
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 1210 transition count 2824
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1206 transition count 2820
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1206 transition count 2820
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1202 transition count 2816
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1202 transition count 2816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1200 transition count 2814
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1200 transition count 2814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 1198 transition count 2812
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 1198 transition count 2812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 1196 transition count 2810
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 1196 transition count 2810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 1194 transition count 2808
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 1194 transition count 2808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 1194 transition count 2807
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1193 transition count 2806
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1193 transition count 2806
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 1192 transition count 2805
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 1192 transition count 2805
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 1191 transition count 2804
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 1191 transition count 2804
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 1190 transition count 2803
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 1190 transition count 2803
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 1189 transition count 2802
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 1189 transition count 2802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 1188 transition count 2801
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 1188 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 1187 transition count 2800
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 1187 transition count 2800
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 1187 transition count 2799
Applied a total of 100 rules in 1277 ms. Remains 1187 /1236 variables (removed 49) and now considering 2799/2850 (removed 51) transitions.
// Phase 1: matrix 2799 rows 1187 cols
[2023-03-22 00:18:35] [INFO ] Computed 7 place invariants in 37 ms
[2023-03-22 00:18:36] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-22 00:18:36] [INFO ] Invariant cache hit.
[2023-03-22 00:18:38] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 2537 ms to find 0 implicit places.
[2023-03-22 00:18:38] [INFO ] Invariant cache hit.
[2023-03-22 00:18:41] [INFO ] Dead Transitions using invariants and state equation in 3113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1187/1236 places, 2799/2850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6930 ms. Remains : 1187/1236 places, 2799/2850 transitions.
Stuttering acceptance computed with spot in 516 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (AND (EQ s100 1) (EQ s272 1) (EQ s465 1) (EQ s679 1) (EQ s855 1) (EQ s1048 1)) (AND (EQ s44 1) (EQ s237 1) (EQ s430 1) (EQ s602 1) (EQ s820 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-00 finished in 7552 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 6 out of 1236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1227 transition count 2841
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1227 transition count 2841
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 1219 transition count 2833
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 1219 transition count 2833
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 1211 transition count 2825
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 1211 transition count 2825
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 1204 transition count 2818
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 1204 transition count 2818
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 1199 transition count 2813
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 1199 transition count 2813
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 1194 transition count 2808
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 1194 transition count 2808
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 1191 transition count 2805
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 1191 transition count 2805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 1191 transition count 2804
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 1189 transition count 2802
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 1189 transition count 2802
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 1187 transition count 2800
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 1187 transition count 2800
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 1185 transition count 2798
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 1185 transition count 2798
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 1185 transition count 2797
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 1184 transition count 2796
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 1184 transition count 2796
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 1183 transition count 2795
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 1182 transition count 2794
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 1181 transition count 2793
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 1180 transition count 2792
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 1179 transition count 2791
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 1178 transition count 2790
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 1178 transition count 2790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 1178 transition count 2789
Applied a total of 119 rules in 1277 ms. Remains 1178 /1236 variables (removed 58) and now considering 2789/2850 (removed 61) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2023-03-22 00:18:43] [INFO ] Computed 7 place invariants in 37 ms
[2023-03-22 00:18:43] [INFO ] Implicit Places using invariants in 624 ms returned []
[2023-03-22 00:18:43] [INFO ] Invariant cache hit.
[2023-03-22 00:18:45] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2653 ms to find 0 implicit places.
[2023-03-22 00:18:45] [INFO ] Invariant cache hit.
[2023-03-22 00:18:48] [INFO ] Dead Transitions using invariants and state equation in 3037 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1178/1236 places, 2789/2850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6982 ms. Remains : 1178/1236 places, 2789/2850 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s44 0) (EQ s216 0) (EQ s451 0) (EQ s644 0) (EQ s795 0) (EQ s1009 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 893 reset in 523 ms.
Product exploration explored 100000 steps with 884 reset in 358 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 90 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 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 239677 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239677 steps, saw 51231 distinct states, run finished after 3006 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:18:53] [INFO ] Invariant cache hit.
[2023-03-22 00:18:53] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:18:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-22 00:18:55] [INFO ] After 1567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:18:55] [INFO ] After 2099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 438 ms.
[2023-03-22 00:18:56] [INFO ] After 2761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 158 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0)]
Support contains 6 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Applied a total of 0 rules in 64 ms. Remains 1178 /1178 variables (removed 0) and now considering 2789/2789 (removed 0) transitions.
[2023-03-22 00:18:56] [INFO ] Invariant cache hit.
[2023-03-22 00:18:57] [INFO ] Implicit Places using invariants in 630 ms returned []
[2023-03-22 00:18:57] [INFO ] Invariant cache hit.
[2023-03-22 00:18:59] [INFO ] Implicit Places using invariants and state equation in 2007 ms returned []
Implicit Place search using SMT with State Equation took 2639 ms to find 0 implicit places.
[2023-03-22 00:18:59] [INFO ] Invariant cache hit.
[2023-03-22 00:19:02] [INFO ] Dead Transitions using invariants and state equation in 2952 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5657 ms. Remains : 1178/1178 places, 2789/2789 transitions.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 238585 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238585 steps, saw 51034 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:19:05] [INFO ] Invariant cache hit.
[2023-03-22 00:19:06] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:19:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-22 00:19:07] [INFO ] After 1569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:19:08] [INFO ] After 2086ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 444 ms.
[2023-03-22 00:19:08] [INFO ] After 2762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 158 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 891 reset in 239 ms.
Product exploration explored 100000 steps with 884 reset in 249 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 6 out of 1178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Graph (trivial) has 1171 edges and 1178 vertex of which 102 / 1178 are part of one of the 18 SCC in 3 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 807 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 807 rules applied. Total rules applied 808 place count 1094 transition count 2693
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 820 place count 1094 transition count 2681
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 820 place count 1094 transition count 2687
Deduced a syphon composed of 855 places in 2 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 868 place count 1094 transition count 2687
Discarding 726 places :
Symmetric choice reduction at 2 with 726 rule applications. Total rules 1594 place count 368 transition count 1961
Deduced a syphon composed of 134 places in 1 ms
Iterating global reduction 2 with 726 rules applied. Total rules applied 2320 place count 368 transition count 1961
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 201 places in 0 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 2387 place count 368 transition count 1979
Discarding 106 places :
Symmetric choice reduction at 2 with 106 rule applications. Total rules 2493 place count 262 transition count 794
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 2 with 106 rules applied. Total rules applied 2599 place count 262 transition count 794
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 2620 place count 262 transition count 773
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 2665 place count 217 transition count 722
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 3 with 45 rules applied. Total rules applied 2710 place count 217 transition count 722
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2728 place count 199 transition count 704
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 3 with 18 rules applied. Total rules applied 2746 place count 199 transition count 704
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 2752 place count 199 transition count 698
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 2764 place count 187 transition count 686
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 2776 place count 187 transition count 686
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 98 places in 1 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 2785 place count 187 transition count 731
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 2800 place count 172 transition count 701
Deduced a syphon composed of 83 places in 1 ms
Iterating global reduction 4 with 15 rules applied. Total rules applied 2815 place count 172 transition count 701
Deduced a syphon composed of 83 places in 0 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 2827 place count 172 transition count 689
Deduced a syphon composed of 83 places in 0 ms
Applied a total of 2827 rules in 564 ms. Remains 172 /1178 variables (removed 1006) and now considering 689/2789 (removed 2100) transitions.
[2023-03-22 00:19:10] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-22 00:19:10] [INFO ] Flow matrix only has 682 transitions (discarded 7 similar events)
// Phase 1: matrix 682 rows 172 cols
[2023-03-22 00:19:10] [INFO ] Computed 2 place invariants in 28 ms
[2023-03-22 00:19:11] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/1178 places, 689/2789 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1125 ms. Remains : 172/1178 places, 689/2789 transitions.
Support contains 6 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Applied a total of 0 rules in 67 ms. Remains 1178 /1178 variables (removed 0) and now considering 2789/2789 (removed 0) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2023-03-22 00:19:11] [INFO ] Computed 7 place invariants in 43 ms
[2023-03-22 00:19:12] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-22 00:19:12] [INFO ] Invariant cache hit.
[2023-03-22 00:19:14] [INFO ] Implicit Places using invariants and state equation in 2012 ms returned []
Implicit Place search using SMT with State Equation took 2674 ms to find 0 implicit places.
[2023-03-22 00:19:14] [INFO ] Invariant cache hit.
[2023-03-22 00:19:17] [INFO ] Dead Transitions using invariants and state equation in 2955 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5705 ms. Remains : 1178/1178 places, 2789/2789 transitions.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-01 finished in 35595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(p1)))))'
Support contains 11 out of 1236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Graph (trivial) has 1222 edges and 1236 vertex of which 102 / 1236 are part of one of the 18 SCC in 2 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 847 transitions
Trivial Post-agglo rules discarded 847 transitions
Performed 847 trivial Post agglomeration. Transition count delta: 847
Iterating post reduction 0 with 847 rules applied. Total rules applied 848 place count 1151 transition count 1906
Reduce places removed 847 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 866 rules applied. Total rules applied 1714 place count 304 transition count 1887
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1722 place count 296 transition count 1887
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1722 place count 296 transition count 1822
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1852 place count 231 transition count 1822
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1862 place count 221 transition count 1812
Iterating global reduction 3 with 10 rules applied. Total rules applied 1872 place count 221 transition count 1812
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1873 place count 221 transition count 1811
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1877 place count 217 transition count 1807
Iterating global reduction 4 with 4 rules applied. Total rules applied 1881 place count 217 transition count 1807
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1882 place count 217 transition count 1806
Performed 45 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1972 place count 172 transition count 1759
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 2001 place count 143 transition count 823
Iterating global reduction 5 with 29 rules applied. Total rules applied 2030 place count 143 transition count 823
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 2042 place count 143 transition count 811
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 2061 place count 124 transition count 786
Iterating global reduction 6 with 19 rules applied. Total rules applied 2080 place count 124 transition count 786
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 2099 place count 105 transition count 761
Iterating global reduction 6 with 19 rules applied. Total rules applied 2118 place count 105 transition count 761
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2125 place count 105 transition count 754
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2145 place count 95 transition count 761
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2146 place count 94 transition count 749
Iterating global reduction 7 with 1 rules applied. Total rules applied 2147 place count 94 transition count 749
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2148 place count 94 transition count 748
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2154 place count 94 transition count 742
Applied a total of 2154 rules in 266 ms. Remains 94 /1236 variables (removed 1142) and now considering 742/2850 (removed 2108) transitions.
[2023-03-22 00:19:17] [INFO ] Flow matrix only has 735 transitions (discarded 7 similar events)
// Phase 1: matrix 735 rows 94 cols
[2023-03-22 00:19:17] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-22 00:19:18] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-22 00:19:18] [INFO ] Flow matrix only has 735 transitions (discarded 7 similar events)
[2023-03-22 00:19:18] [INFO ] Invariant cache hit.
[2023-03-22 00:19:18] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:19:18] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2023-03-22 00:19:18] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-22 00:19:18] [INFO ] Flow matrix only has 735 transitions (discarded 7 similar events)
[2023-03-22 00:19:18] [INFO ] Invariant cache hit.
[2023-03-22 00:19:19] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/1236 places, 742/2850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1541 ms. Remains : 94/1236 places, 742/2850 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s22 1) (EQ s36 1) (EQ s52 1) (EQ s69 1) (EQ s84 1)), p1:(AND (EQ s6 1) (EQ s22 1) (EQ s38 1) (EQ s49 1) (EQ s67 1) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-02 finished in 1647 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 (p1 U p2))||F((F(p2)&&p3))))'
Support contains 13 out of 1236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Graph (trivial) has 1219 edges and 1236 vertex of which 102 / 1236 are part of one of the 18 SCC in 2 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 844 transitions
Trivial Post-agglo rules discarded 844 transitions
Performed 844 trivial Post agglomeration. Transition count delta: 844
Iterating post reduction 0 with 844 rules applied. Total rules applied 845 place count 1151 transition count 1909
Reduce places removed 844 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 863 rules applied. Total rules applied 1708 place count 307 transition count 1890
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1716 place count 299 transition count 1890
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1716 place count 299 transition count 1825
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1846 place count 234 transition count 1825
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1856 place count 224 transition count 1815
Iterating global reduction 3 with 10 rules applied. Total rules applied 1866 place count 224 transition count 1815
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1867 place count 224 transition count 1814
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1871 place count 220 transition count 1810
Iterating global reduction 4 with 4 rules applied. Total rules applied 1875 place count 220 transition count 1810
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1876 place count 220 transition count 1809
Performed 45 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1966 place count 175 transition count 1763
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 1988 place count 153 transition count 1735
Iterating global reduction 5 with 22 rules applied. Total rules applied 2010 place count 153 transition count 1735
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2015 place count 153 transition count 1730
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 2034 place count 134 transition count 1705
Iterating global reduction 6 with 19 rules applied. Total rules applied 2053 place count 134 transition count 1705
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 2072 place count 115 transition count 1680
Iterating global reduction 6 with 19 rules applied. Total rules applied 2091 place count 115 transition count 1680
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2098 place count 115 transition count 1673
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2118 place count 105 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2119 place count 104 transition count 1668
Iterating global reduction 7 with 1 rules applied. Total rules applied 2120 place count 104 transition count 1668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2121 place count 104 transition count 1667
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2127 place count 104 transition count 1661
Applied a total of 2127 rules in 392 ms. Remains 104 /1236 variables (removed 1132) and now considering 1661/2850 (removed 1189) transitions.
[2023-03-22 00:19:19] [INFO ] Flow matrix only has 1654 transitions (discarded 7 similar events)
// Phase 1: matrix 1654 rows 104 cols
[2023-03-22 00:19:19] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-22 00:19:19] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-22 00:19:19] [INFO ] Flow matrix only has 1654 transitions (discarded 7 similar events)
[2023-03-22 00:19:19] [INFO ] Invariant cache hit.
[2023-03-22 00:19:20] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:19:21] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
[2023-03-22 00:19:21] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-22 00:19:21] [INFO ] Flow matrix only has 1654 transitions (discarded 7 similar events)
[2023-03-22 00:19:21] [INFO ] Invariant cache hit.
[2023-03-22 00:19:22] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/1236 places, 1661/2850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2786 ms. Remains : 104/1236 places, 1661/2850 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p3:(AND (EQ s6 1) (EQ s22 1) (EQ s38 1) (EQ s53 1) (EQ s74 1) (EQ s90 1)), p2:(AND (EQ s6 1) (EQ s22 1) (EQ s38 1) (EQ s53 1) (EQ s74 1) (EQ s90 1)), p1:(...], 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, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-03 finished in 3004 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(p0)&&F((X(p2)||p1)))))'
Support contains 11 out of 1236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1228 transition count 2842
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1228 transition count 2842
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 1221 transition count 2835
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 1221 transition count 2835
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 1214 transition count 2828
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 1214 transition count 2828
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 1208 transition count 2822
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 1208 transition count 2822
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1204 transition count 2818
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1204 transition count 2818
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 1200 transition count 2814
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 1200 transition count 2814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 1198 transition count 2812
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 1198 transition count 2812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 1196 transition count 2810
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 1196 transition count 2810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 1194 transition count 2808
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 1194 transition count 2808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 1192 transition count 2806
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 1192 transition count 2806
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 1192 transition count 2805
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 1191 transition count 2804
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 1191 transition count 2804
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 1190 transition count 2803
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 1190 transition count 2803
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 1189 transition count 2802
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 1189 transition count 2802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 1188 transition count 2801
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 1188 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 1187 transition count 2800
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 1187 transition count 2800
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 1186 transition count 2799
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 1186 transition count 2799
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 1185 transition count 2798
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 1185 transition count 2798
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 1185 transition count 2797
Applied a total of 104 rules in 1139 ms. Remains 1185 /1236 variables (removed 51) and now considering 2797/2850 (removed 53) transitions.
// Phase 1: matrix 2797 rows 1185 cols
[2023-03-22 00:19:23] [INFO ] Computed 7 place invariants in 35 ms
[2023-03-22 00:19:23] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-22 00:19:23] [INFO ] Invariant cache hit.
[2023-03-22 00:19:26] [INFO ] Implicit Places using invariants and state equation in 2055 ms returned []
Implicit Place search using SMT with State Equation took 2631 ms to find 0 implicit places.
[2023-03-22 00:19:26] [INFO ] Invariant cache hit.
[2023-03-22 00:19:28] [INFO ] Dead Transitions using invariants and state equation in 2854 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1185/1236 places, 2797/2850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6627 ms. Remains : 1185/1236 places, 2797/2850 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s1114 0) (EQ s1184 0)), p0:(AND (EQ s65 1) (EQ s258 1) (EQ s430 1) (EQ s623 1) (EQ s837 1) (EQ s1030 1)), p2:(AND (EQ s65 1) (EQ s216 1) (EQ s4...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-04 finished in 6861 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 (F(p1) U p2))))'
Support contains 15 out of 1236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1227 transition count 2841
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1227 transition count 2841
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 1219 transition count 2833
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 1219 transition count 2833
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 1211 transition count 2825
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 1211 transition count 2825
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 1204 transition count 2818
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 1204 transition count 2818
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 1199 transition count 2813
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 1199 transition count 2813
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 1194 transition count 2808
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 1194 transition count 2808
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 1191 transition count 2805
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 1191 transition count 2805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 1191 transition count 2804
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 1189 transition count 2802
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 1189 transition count 2802
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 1187 transition count 2800
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 1187 transition count 2800
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 1185 transition count 2798
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 1185 transition count 2798
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 1185 transition count 2797
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 1184 transition count 2796
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 1184 transition count 2796
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 1183 transition count 2795
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 1182 transition count 2794
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 1181 transition count 2793
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 1180 transition count 2792
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 1179 transition count 2791
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 1178 transition count 2790
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 1178 transition count 2790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 1178 transition count 2789
Applied a total of 119 rules in 1085 ms. Remains 1178 /1236 variables (removed 58) and now considering 2789/2850 (removed 61) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2023-03-22 00:19:30] [INFO ] Computed 7 place invariants in 31 ms
[2023-03-22 00:19:30] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-03-22 00:19:30] [INFO ] Invariant cache hit.
[2023-03-22 00:19:32] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2512 ms to find 0 implicit places.
[2023-03-22 00:19:32] [INFO ] Invariant cache hit.
[2023-03-22 00:19:35] [INFO ] Dead Transitions using invariants and state equation in 3108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1178/1236 places, 2789/2850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6710 ms. Remains : 1178/1236 places, 2789/2850 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s65 1) (EQ s216 1) (EQ s430 1) (EQ s623 1) (EQ s837 1) (EQ s988 1)), p0:(AND (EQ s65 1) (EQ s216 1) (EQ s409 1) (EQ s644 1) (EQ s816 1) (EQ s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 883 reset in 329 ms.
Product exploration explored 100000 steps with 890 reset in 486 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 729 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 117834 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117834 steps, saw 28089 distinct states, run finished after 3005 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-22 00:19:41] [INFO ] Invariant cache hit.
[2023-03-22 00:19:42] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-22 00:19:44] [INFO ] After 2313ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:6
[2023-03-22 00:19:45] [INFO ] After 3850ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:6
Attempting to minimize the solution found.
Minimization took 1234 ms.
[2023-03-22 00:19:47] [INFO ] After 5574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:6
[2023-03-22 00:19:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-22 00:19:50] [INFO ] After 2768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 00:19:52] [INFO ] After 5127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1628 ms.
[2023-03-22 00:19:54] [INFO ] After 7324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 3 different solutions.
Finished Parikh walk after 188 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=94 )
Parikh walk visited 9 properties in 17 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 14 factoid took 880 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) p0)]
[2023-03-22 00:19:55] [INFO ] Invariant cache hit.
[2023-03-22 00:19:58] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-22 00:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:20:00] [INFO ] [Real]Absence check using state equation in 1835 ms returned sat
[2023-03-22 00:20:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:20:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned sat
[2023-03-22 00:20:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:20:04] [INFO ] [Nat]Absence check using state equation in 1853 ms returned sat
[2023-03-22 00:20:04] [INFO ] Computed and/alt/rep : 2738/10504/2738 causal constraints (skipped 50 transitions) in 316 ms.
[2023-03-22 00:20:09] [INFO ] Added : 148 causal constraints over 30 iterations in 4931 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 15 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Applied a total of 0 rules in 58 ms. Remains 1178 /1178 variables (removed 0) and now considering 2789/2789 (removed 0) transitions.
[2023-03-22 00:20:09] [INFO ] Invariant cache hit.
[2023-03-22 00:20:09] [INFO ] Implicit Places using invariants in 526 ms returned []
[2023-03-22 00:20:09] [INFO ] Invariant cache hit.
[2023-03-22 00:20:11] [INFO ] Implicit Places using invariants and state equation in 1890 ms returned []
Implicit Place search using SMT with State Equation took 2421 ms to find 0 implicit places.
[2023-03-22 00:20:11] [INFO ] Invariant cache hit.
[2023-03-22 00:20:14] [INFO ] Dead Transitions using invariants and state equation in 3105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5587 ms. Remains : 1178/1178 places, 2789/2789 transitions.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 845 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 121819 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121819 steps, saw 28851 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-22 00:20:19] [INFO ] Invariant cache hit.
[2023-03-22 00:20:20] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-22 00:20:23] [INFO ] After 2551ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:5
[2023-03-22 00:20:24] [INFO ] After 4193ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:5
Attempting to minimize the solution found.
Minimization took 1164 ms.
[2023-03-22 00:20:25] [INFO ] After 5862ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:5
[2023-03-22 00:20:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-22 00:20:29] [INFO ] After 2918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 00:20:31] [INFO ] After 5365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1694 ms.
[2023-03-22 00:20:33] [INFO ] After 7635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 3 different solutions.
Finished Parikh walk after 162 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=81 )
Parikh walk visited 9 properties in 25 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 16 factoid took 957 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) p0)]
[2023-03-22 00:20:34] [INFO ] Invariant cache hit.
[2023-03-22 00:20:37] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-22 00:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:20:39] [INFO ] [Real]Absence check using state equation in 1921 ms returned sat
[2023-03-22 00:20:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:20:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned sat
[2023-03-22 00:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:20:43] [INFO ] [Nat]Absence check using state equation in 1796 ms returned sat
[2023-03-22 00:20:44] [INFO ] Computed and/alt/rep : 2738/10504/2738 causal constraints (skipped 50 transitions) in 611 ms.
[2023-03-22 00:20:48] [INFO ] Added : 148 causal constraints over 30 iterations in 5059 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 887 reset in 259 ms.
Product exploration explored 100000 steps with 884 reset in 270 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) p0)]
Support contains 15 out of 1178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Graph (trivial) has 1162 edges and 1178 vertex of which 102 / 1178 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 798 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 798 rules applied. Total rules applied 799 place count 1094 transition count 2693
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 811 place count 1094 transition count 2681
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 811 place count 1094 transition count 2687
Deduced a syphon composed of 846 places in 2 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 859 place count 1094 transition count 2687
Discarding 717 places :
Symmetric choice reduction at 2 with 717 rule applications. Total rules 1576 place count 377 transition count 1970
Deduced a syphon composed of 134 places in 1 ms
Iterating global reduction 2 with 717 rules applied. Total rules applied 2293 place count 377 transition count 1970
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 201 places in 0 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 2360 place count 377 transition count 1988
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2461 place count 276 transition count 1225
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2562 place count 276 transition count 1225
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 2578 place count 276 transition count 1209
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 2618 place count 236 transition count 1163
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 3 with 40 rules applied. Total rules applied 2658 place count 236 transition count 1163
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2676 place count 218 transition count 1145
Deduced a syphon composed of 106 places in 1 ms
Iterating global reduction 3 with 18 rules applied. Total rules applied 2694 place count 218 transition count 1145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 2700 place count 218 transition count 1139
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 2712 place count 206 transition count 1127
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 2724 place count 206 transition count 1127
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 2733 place count 206 transition count 1172
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 2748 place count 191 transition count 1142
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 4 with 15 rules applied. Total rules applied 2763 place count 191 transition count 1142
Deduced a syphon composed of 88 places in 1 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 2775 place count 191 transition count 1130
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 2775 rules in 489 ms. Remains 191 /1178 variables (removed 987) and now considering 1130/2789 (removed 1659) transitions.
[2023-03-22 00:20:50] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-22 00:20:50] [INFO ] Flow matrix only has 1123 transitions (discarded 7 similar events)
// Phase 1: matrix 1123 rows 191 cols
[2023-03-22 00:20:50] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-22 00:20:50] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 191/1178 places, 1130/2789 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1263 ms. Remains : 191/1178 places, 1130/2789 transitions.
Support contains 15 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Applied a total of 0 rules in 55 ms. Remains 1178 /1178 variables (removed 0) and now considering 2789/2789 (removed 0) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2023-03-22 00:20:51] [INFO ] Computed 7 place invariants in 29 ms
[2023-03-22 00:20:51] [INFO ] Implicit Places using invariants in 540 ms returned []
[2023-03-22 00:20:51] [INFO ] Invariant cache hit.
[2023-03-22 00:20:53] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 2428 ms to find 0 implicit places.
[2023-03-22 00:20:53] [INFO ] Invariant cache hit.
[2023-03-22 00:20:56] [INFO ] Dead Transitions using invariants and state equation in 3367 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5852 ms. Remains : 1178/1178 places, 2789/2789 transitions.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-06 finished in 87933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)))'
Support contains 7 out of 1236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Graph (trivial) has 1224 edges and 1236 vertex of which 102 / 1236 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 851 transitions
Trivial Post-agglo rules discarded 851 transitions
Performed 851 trivial Post agglomeration. Transition count delta: 851
Iterating post reduction 0 with 851 rules applied. Total rules applied 852 place count 1151 transition count 1902
Reduce places removed 851 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 870 rules applied. Total rules applied 1722 place count 300 transition count 1883
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1730 place count 292 transition count 1883
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1730 place count 292 transition count 1818
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1860 place count 227 transition count 1818
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1870 place count 217 transition count 1808
Iterating global reduction 3 with 10 rules applied. Total rules applied 1880 place count 217 transition count 1808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1881 place count 217 transition count 1807
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1885 place count 213 transition count 1803
Iterating global reduction 4 with 4 rules applied. Total rules applied 1889 place count 213 transition count 1803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1890 place count 213 transition count 1802
Performed 45 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1980 place count 168 transition count 1755
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 2009 place count 139 transition count 819
Iterating global reduction 5 with 29 rules applied. Total rules applied 2038 place count 139 transition count 819
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 2050 place count 139 transition count 807
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 2068 place count 121 transition count 784
Iterating global reduction 6 with 18 rules applied. Total rules applied 2086 place count 121 transition count 784
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 2104 place count 103 transition count 761
Iterating global reduction 6 with 18 rules applied. Total rules applied 2122 place count 103 transition count 761
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2129 place count 103 transition count 754
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2149 place count 93 transition count 761
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2150 place count 92 transition count 748
Iterating global reduction 7 with 1 rules applied. Total rules applied 2151 place count 92 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2152 place count 92 transition count 747
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 2159 place count 92 transition count 740
Applied a total of 2159 rules in 232 ms. Remains 92 /1236 variables (removed 1144) and now considering 740/2850 (removed 2110) transitions.
[2023-03-22 00:20:57] [INFO ] Flow matrix only has 733 transitions (discarded 7 similar events)
// Phase 1: matrix 733 rows 92 cols
[2023-03-22 00:20:57] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-22 00:20:57] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-22 00:20:57] [INFO ] Flow matrix only has 733 transitions (discarded 7 similar events)
[2023-03-22 00:20:57] [INFO ] Invariant cache hit.
[2023-03-22 00:20:57] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:20:57] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2023-03-22 00:20:58] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-22 00:20:58] [INFO ] Flow matrix only has 733 transitions (discarded 7 similar events)
[2023-03-22 00:20:58] [INFO ] Invariant cache hit.
[2023-03-22 00:20:58] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/1236 places, 740/2850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1334 ms. Remains : 92/1236 places, 740/2850 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s31 1), p0:(OR (NEQ s8 1) (NEQ s21 1) (NEQ s39 1) (NEQ s52 1) (NEQ s68 1) (NEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-07 finished in 1463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 7 out of 1236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1227 transition count 2841
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1227 transition count 2841
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 1219 transition count 2833
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 1219 transition count 2833
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 1211 transition count 2825
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 1211 transition count 2825
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 1204 transition count 2818
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 1204 transition count 2818
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 1199 transition count 2813
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 1199 transition count 2813
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 1194 transition count 2808
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 1194 transition count 2808
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 1191 transition count 2805
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 1191 transition count 2805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 1191 transition count 2804
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 1189 transition count 2802
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 1189 transition count 2802
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 1187 transition count 2800
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 1187 transition count 2800
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 1185 transition count 2798
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 1185 transition count 2798
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 1185 transition count 2797
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 1184 transition count 2796
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 1184 transition count 2796
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 1183 transition count 2795
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 1182 transition count 2794
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 1181 transition count 2793
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 1180 transition count 2792
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 1179 transition count 2791
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 1178 transition count 2790
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 1178 transition count 2790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 1178 transition count 2789
Applied a total of 119 rules in 1130 ms. Remains 1178 /1236 variables (removed 58) and now considering 2789/2850 (removed 61) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2023-03-22 00:20:59] [INFO ] Computed 7 place invariants in 30 ms
[2023-03-22 00:21:00] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-22 00:21:00] [INFO ] Invariant cache hit.
[2023-03-22 00:21:02] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 2669 ms to find 0 implicit places.
[2023-03-22 00:21:02] [INFO ] Invariant cache hit.
[2023-03-22 00:21:04] [INFO ] Dead Transitions using invariants and state equation in 2110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1178/1236 places, 2789/2850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5911 ms. Remains : 1178/1236 places, 2789/2850 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s187 0) (OR (EQ s44 0) (EQ s237 0) (EQ s430 0) (EQ s623 0) (EQ s837 0) (EQ s1030 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 205 steps with 1 reset in 1 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-08 finished in 6059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Graph (trivial) has 1227 edges and 1236 vertex of which 102 / 1236 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 852 transitions
Trivial Post-agglo rules discarded 852 transitions
Performed 852 trivial Post agglomeration. Transition count delta: 852
Iterating post reduction 0 with 852 rules applied. Total rules applied 853 place count 1151 transition count 1901
Reduce places removed 852 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 871 rules applied. Total rules applied 1724 place count 299 transition count 1882
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 1735 place count 291 transition count 1879
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1738 place count 288 transition count 1879
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 64 Pre rules applied. Total rules applied 1738 place count 288 transition count 1815
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 1866 place count 224 transition count 1815
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1876 place count 214 transition count 1805
Iterating global reduction 4 with 10 rules applied. Total rules applied 1886 place count 214 transition count 1805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1887 place count 214 transition count 1804
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1891 place count 210 transition count 1800
Iterating global reduction 5 with 4 rules applied. Total rules applied 1895 place count 210 transition count 1800
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1896 place count 210 transition count 1799
Performed 45 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 1986 place count 165 transition count 1752
Discarding 34 places :
Symmetric choice reduction at 6 with 34 rule applications. Total rules 2020 place count 131 transition count 394
Iterating global reduction 6 with 34 rules applied. Total rules applied 2054 place count 131 transition count 394
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 2071 place count 131 transition count 377
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2089 place count 113 transition count 353
Iterating global reduction 7 with 18 rules applied. Total rules applied 2107 place count 113 transition count 353
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2125 place count 95 transition count 329
Iterating global reduction 7 with 18 rules applied. Total rules applied 2143 place count 95 transition count 329
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2149 place count 95 transition count 323
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 2169 place count 85 transition count 337
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2170 place count 84 transition count 325
Iterating global reduction 8 with 1 rules applied. Total rules applied 2171 place count 84 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2172 place count 84 transition count 324
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 2178 place count 84 transition count 318
Applied a total of 2178 rules in 192 ms. Remains 84 /1236 variables (removed 1152) and now considering 318/2850 (removed 2532) transitions.
[2023-03-22 00:21:04] [INFO ] Flow matrix only has 311 transitions (discarded 7 similar events)
// Phase 1: matrix 311 rows 84 cols
[2023-03-22 00:21:04] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 00:21:04] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-22 00:21:04] [INFO ] Flow matrix only has 311 transitions (discarded 7 similar events)
[2023-03-22 00:21:04] [INFO ] Invariant cache hit.
[2023-03-22 00:21:05] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:21:05] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2023-03-22 00:21:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:21:05] [INFO ] Flow matrix only has 311 transitions (discarded 7 similar events)
[2023-03-22 00:21:05] [INFO ] Invariant cache hit.
[2023-03-22 00:21:05] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/1236 places, 318/2850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 802 ms. Remains : 84/1236 places, 318/2850 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s23 1) (OR (EQ s14 0) (EQ s83 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 20400 steps with 1361 reset in 73 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-09 finished in 925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 7 out of 1236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Graph (trivial) has 1225 edges and 1236 vertex of which 102 / 1236 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 850 transitions
Trivial Post-agglo rules discarded 850 transitions
Performed 850 trivial Post agglomeration. Transition count delta: 850
Iterating post reduction 0 with 850 rules applied. Total rules applied 851 place count 1151 transition count 1903
Reduce places removed 850 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 869 rules applied. Total rules applied 1720 place count 301 transition count 1884
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1728 place count 293 transition count 1884
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1728 place count 293 transition count 1819
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1858 place count 228 transition count 1819
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1867 place count 219 transition count 1810
Iterating global reduction 3 with 9 rules applied. Total rules applied 1876 place count 219 transition count 1810
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1877 place count 219 transition count 1809
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1880 place count 216 transition count 1806
Iterating global reduction 4 with 3 rules applied. Total rules applied 1883 place count 216 transition count 1806
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1884 place count 216 transition count 1805
Performed 46 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 1976 place count 170 transition count 1757
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 2008 place count 138 transition count 479
Iterating global reduction 5 with 32 rules applied. Total rules applied 2040 place count 138 transition count 479
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 2055 place count 138 transition count 464
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 2073 place count 120 transition count 440
Iterating global reduction 6 with 18 rules applied. Total rules applied 2091 place count 120 transition count 440
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 2109 place count 102 transition count 416
Iterating global reduction 6 with 18 rules applied. Total rules applied 2127 place count 102 transition count 416
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2133 place count 102 transition count 410
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2153 place count 92 transition count 417
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2154 place count 91 transition count 405
Iterating global reduction 7 with 1 rules applied. Total rules applied 2155 place count 91 transition count 405
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2156 place count 91 transition count 404
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2162 place count 91 transition count 398
Applied a total of 2162 rules in 188 ms. Remains 91 /1236 variables (removed 1145) and now considering 398/2850 (removed 2452) transitions.
[2023-03-22 00:21:05] [INFO ] Flow matrix only has 391 transitions (discarded 7 similar events)
// Phase 1: matrix 391 rows 91 cols
[2023-03-22 00:21:05] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-22 00:21:05] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-22 00:21:05] [INFO ] Flow matrix only has 391 transitions (discarded 7 similar events)
[2023-03-22 00:21:05] [INFO ] Invariant cache hit.
[2023-03-22 00:21:05] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:21:06] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2023-03-22 00:21:06] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 00:21:06] [INFO ] Flow matrix only has 391 transitions (discarded 7 similar events)
[2023-03-22 00:21:06] [INFO ] Invariant cache hit.
[2023-03-22 00:21:06] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/1236 places, 398/2850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 901 ms. Remains : 91/1236 places, 398/2850 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s23 1) (EQ s36 1) (EQ s50 1) (EQ s64 1) (EQ s79 1)), p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-10 finished in 1036 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))))'
Support contains 7 out of 1236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Graph (trivial) has 1225 edges and 1236 vertex of which 102 / 1236 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 851 transitions
Trivial Post-agglo rules discarded 851 transitions
Performed 851 trivial Post agglomeration. Transition count delta: 851
Iterating post reduction 0 with 851 rules applied. Total rules applied 852 place count 1151 transition count 1902
Reduce places removed 851 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 868 rules applied. Total rules applied 1720 place count 300 transition count 1885
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1727 place count 293 transition count 1885
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1727 place count 293 transition count 1820
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1857 place count 228 transition count 1820
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1867 place count 218 transition count 1810
Iterating global reduction 3 with 10 rules applied. Total rules applied 1877 place count 218 transition count 1810
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1878 place count 218 transition count 1809
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1882 place count 214 transition count 1805
Iterating global reduction 4 with 4 rules applied. Total rules applied 1886 place count 214 transition count 1805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1887 place count 214 transition count 1804
Performed 45 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1977 place count 169 transition count 1757
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 2008 place count 138 transition count 551
Iterating global reduction 5 with 31 rules applied. Total rules applied 2039 place count 138 transition count 551
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2053 place count 138 transition count 537
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 2072 place count 119 transition count 512
Iterating global reduction 6 with 19 rules applied. Total rules applied 2091 place count 119 transition count 512
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 2109 place count 101 transition count 489
Iterating global reduction 6 with 18 rules applied. Total rules applied 2127 place count 101 transition count 489
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2134 place count 101 transition count 482
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2154 place count 91 transition count 491
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2155 place count 90 transition count 478
Iterating global reduction 7 with 1 rules applied. Total rules applied 2156 place count 90 transition count 478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2157 place count 90 transition count 477
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 2165 place count 90 transition count 469
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2166 place count 90 transition count 469
Applied a total of 2166 rules in 207 ms. Remains 90 /1236 variables (removed 1146) and now considering 469/2850 (removed 2381) transitions.
[2023-03-22 00:21:06] [INFO ] Flow matrix only has 462 transitions (discarded 7 similar events)
// Phase 1: matrix 462 rows 90 cols
[2023-03-22 00:21:06] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-22 00:21:06] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-22 00:21:06] [INFO ] Flow matrix only has 462 transitions (discarded 7 similar events)
[2023-03-22 00:21:06] [INFO ] Invariant cache hit.
[2023-03-22 00:21:07] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:21:07] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-03-22 00:21:07] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 00:21:07] [INFO ] Flow matrix only has 462 transitions (discarded 7 similar events)
[2023-03-22 00:21:07] [INFO ] Invariant cache hit.
[2023-03-22 00:21:07] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/1236 places, 469/2850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 962 ms. Remains : 90/1236 places, 469/2850 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s26 1) (EQ s39 1) (EQ s51 1) (EQ s66 1) (EQ s80 1)), p1:(EQ s16 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-11 finished in 1091 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 1 out of 1236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Graph (trivial) has 1231 edges and 1236 vertex of which 102 / 1236 are part of one of the 18 SCC in 0 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 856 transitions
Trivial Post-agglo rules discarded 856 transitions
Performed 856 trivial Post agglomeration. Transition count delta: 856
Iterating post reduction 0 with 856 rules applied. Total rules applied 857 place count 1151 transition count 1897
Reduce places removed 856 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 875 rules applied. Total rules applied 1732 place count 295 transition count 1878
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1740 place count 287 transition count 1878
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1740 place count 287 transition count 1813
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1870 place count 222 transition count 1813
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1879 place count 213 transition count 1804
Iterating global reduction 3 with 9 rules applied. Total rules applied 1888 place count 213 transition count 1804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1889 place count 213 transition count 1803
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1892 place count 210 transition count 1800
Iterating global reduction 4 with 3 rules applied. Total rules applied 1895 place count 210 transition count 1800
Performed 46 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1987 place count 164 transition count 1752
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 2021 place count 130 transition count 394
Iterating global reduction 4 with 34 rules applied. Total rules applied 2055 place count 130 transition count 394
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 2072 place count 130 transition count 377
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 2091 place count 111 transition count 352
Iterating global reduction 5 with 19 rules applied. Total rules applied 2110 place count 111 transition count 352
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 2129 place count 92 transition count 327
Iterating global reduction 5 with 19 rules applied. Total rules applied 2148 place count 92 transition count 327
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2155 place count 92 transition count 320
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 2175 place count 82 transition count 327
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2176 place count 81 transition count 315
Iterating global reduction 6 with 1 rules applied. Total rules applied 2177 place count 81 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2178 place count 81 transition count 314
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 2184 place count 81 transition count 308
Applied a total of 2184 rules in 179 ms. Remains 81 /1236 variables (removed 1155) and now considering 308/2850 (removed 2542) transitions.
[2023-03-22 00:21:07] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
// Phase 1: matrix 301 rows 81 cols
[2023-03-22 00:21:07] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 00:21:07] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-22 00:21:07] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
[2023-03-22 00:21:07] [INFO ] Invariant cache hit.
[2023-03-22 00:21:08] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:21:08] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-22 00:21:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:21:08] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
[2023-03-22 00:21:08] [INFO ] Invariant cache hit.
[2023-03-22 00:21:08] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/1236 places, 308/2850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 755 ms. Remains : 81/1236 places, 308/2850 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s45 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 5 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-12 finished in 805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Graph (trivial) has 1231 edges and 1236 vertex of which 102 / 1236 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 858 transitions
Trivial Post-agglo rules discarded 858 transitions
Performed 858 trivial Post agglomeration. Transition count delta: 858
Iterating post reduction 0 with 858 rules applied. Total rules applied 859 place count 1151 transition count 1895
Reduce places removed 858 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 877 rules applied. Total rules applied 1736 place count 293 transition count 1876
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1744 place count 285 transition count 1876
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1744 place count 285 transition count 1811
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1874 place count 220 transition count 1811
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1884 place count 210 transition count 1801
Iterating global reduction 3 with 10 rules applied. Total rules applied 1894 place count 210 transition count 1801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1895 place count 210 transition count 1800
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1899 place count 206 transition count 1796
Iterating global reduction 4 with 4 rules applied. Total rules applied 1903 place count 206 transition count 1796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1904 place count 206 transition count 1795
Performed 45 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1994 place count 161 transition count 1748
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 2028 place count 127 transition count 390
Iterating global reduction 5 with 34 rules applied. Total rules applied 2062 place count 127 transition count 390
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 2079 place count 127 transition count 373
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 2098 place count 108 transition count 348
Iterating global reduction 6 with 19 rules applied. Total rules applied 2117 place count 108 transition count 348
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 2136 place count 89 transition count 323
Iterating global reduction 6 with 19 rules applied. Total rules applied 2155 place count 89 transition count 323
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2162 place count 89 transition count 316
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2182 place count 79 transition count 323
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2183 place count 78 transition count 311
Iterating global reduction 7 with 1 rules applied. Total rules applied 2184 place count 78 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2185 place count 78 transition count 310
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2191 place count 78 transition count 304
Applied a total of 2191 rules in 172 ms. Remains 78 /1236 variables (removed 1158) and now considering 304/2850 (removed 2546) transitions.
[2023-03-22 00:21:08] [INFO ] Flow matrix only has 297 transitions (discarded 7 similar events)
// Phase 1: matrix 297 rows 78 cols
[2023-03-22 00:21:08] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 00:21:08] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-22 00:21:08] [INFO ] Flow matrix only has 297 transitions (discarded 7 similar events)
[2023-03-22 00:21:08] [INFO ] Invariant cache hit.
[2023-03-22 00:21:08] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:21:08] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-22 00:21:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:21:08] [INFO ] Flow matrix only has 297 transitions (discarded 7 similar events)
[2023-03-22 00:21:08] [INFO ] Invariant cache hit.
[2023-03-22 00:21:09] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/1236 places, 304/2850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 809 ms. Remains : 78/1236 places, 304/2850 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-14 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U G(((p1 U p2)||X(p3)))))'
Support contains 14 out of 1236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1229 transition count 2843
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1229 transition count 2843
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 1223 transition count 2837
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 1223 transition count 2837
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 1217 transition count 2831
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 1217 transition count 2831
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 1211 transition count 2825
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 1211 transition count 2825
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 1206 transition count 2820
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 1206 transition count 2820
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 1201 transition count 2815
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 1201 transition count 2815
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 1198 transition count 2812
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 1198 transition count 2812
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 1198 transition count 2811
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 1196 transition count 2809
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 1196 transition count 2809
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 1194 transition count 2807
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 1194 transition count 2807
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 1192 transition count 2805
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 1192 transition count 2805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 1192 transition count 2804
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 1191 transition count 2803
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 1191 transition count 2803
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 1190 transition count 2802
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 1190 transition count 2802
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 1189 transition count 2801
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 1189 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 1188 transition count 2800
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 1188 transition count 2800
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 1187 transition count 2799
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 1187 transition count 2799
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1186 transition count 2798
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1186 transition count 2798
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1185 transition count 2797
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1185 transition count 2797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 1185 transition count 2796
Applied a total of 105 rules in 1099 ms. Remains 1185 /1236 variables (removed 51) and now considering 2796/2850 (removed 54) transitions.
// Phase 1: matrix 2796 rows 1185 cols
[2023-03-22 00:21:10] [INFO ] Computed 7 place invariants in 32 ms
[2023-03-22 00:21:10] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-22 00:21:10] [INFO ] Invariant cache hit.
[2023-03-22 00:21:12] [INFO ] Implicit Places using invariants and state equation in 1975 ms returned []
Implicit Place search using SMT with State Equation took 2561 ms to find 0 implicit places.
[2023-03-22 00:21:12] [INFO ] Invariant cache hit.
[2023-03-22 00:21:16] [INFO ] Dead Transitions using invariants and state equation in 3331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1185/1236 places, 2796/2850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6993 ms. Remains : 1185/1236 places, 2796/2850 transitions.
Stuttering acceptance computed with spot in 516 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, p0, (NOT p2), (AND p0 (NOT p2) p3)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={0} source=9 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0) p3), acceptance={0} source=9 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) p1 (NOT p0) p3), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (EQ s79 1) (EQ s293 1) (EQ s486 1) (EQ s660 1) (EQ s854 1) (EQ s1089 1)), p2:(EQ s647 1), p1:(EQ s1144 1), p3:(OR (AND (EQ s44 1) (EQ s237 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 892 reset in 300 ms.
Product exploration explored 100000 steps with 884 reset in 321 ms.
Computed a total of 250 stabilizing places and 262 stable transitions
Computed a total of 250 stabilizing places and 262 stable transitions
Detected a total of 250/1185 stabilizing places and 262/2796 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) p1 p0 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p3)), (X (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), true, (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) p3)))), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) p1 p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 2470 ms. Reduced automaton from 10 states, 36 edges and 4 AP (stutter sensitive) to 10 states, 36 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, p0, (NOT p2), (AND p0 (NOT p2) p3)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 88824 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88824 steps, saw 21764 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 20 properties.
[2023-03-22 00:21:23] [INFO ] Invariant cache hit.
[2023-03-22 00:21:24] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-22 00:21:27] [INFO ] After 2495ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:18
[2023-03-22 00:21:28] [INFO ] After 3413ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-22 00:21:28] [INFO ] After 4183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-22 00:21:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-22 00:21:34] [INFO ] After 4831ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :15
[2023-03-22 00:21:36] [INFO ] Deduced a trap composed of 320 places in 1102 ms of which 2 ms to minimize.
[2023-03-22 00:21:37] [INFO ] Deduced a trap composed of 292 places in 1031 ms of which 1 ms to minimize.
[2023-03-22 00:21:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2536 ms
[2023-03-22 00:21:39] [INFO ] Deduced a trap composed of 299 places in 1014 ms of which 1 ms to minimize.
[2023-03-22 00:21:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1286 ms
[2023-03-22 00:21:41] [INFO ] After 12659ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :15
Attempting to minimize the solution found.
Minimization took 3993 ms.
[2023-03-22 00:21:45] [INFO ] After 17619ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :15
Fused 20 Parikh solutions to 10 different solutions.
Finished Parikh walk after 186 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=46 )
Parikh walk visited 15 properties in 39 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) p1 p0 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p3)), (X (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), true, (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) p3)))), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) p1 p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (G (NOT (AND p0 p1 (NOT p2) p3))), (G (NOT (AND p0 (NOT p1) (NOT p2) p3))), (G (NOT (AND (NOT p0) p1 (NOT p2) p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3)))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (AND p1 (NOT p2) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F p3), (F p0), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (AND p0 (NOT p3))), (F (AND (NOT p0) p1 (NOT p2) (NOT p3)))]
Knowledge based reduction with 44 factoid took 3185 ms. Reduced automaton from 10 states, 36 edges and 4 AP (stutter sensitive) to 10 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 468 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3) p2), (OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), false]
Stuttering acceptance computed with spot in 462 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3) p2), (OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), false]
[2023-03-22 00:21:50] [INFO ] Invariant cache hit.
[2023-03-22 00:21:52] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-22 00:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:56] [INFO ] [Real]Absence check using state equation in 3489 ms returned sat
[2023-03-22 00:21:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:21:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-22 00:21:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:22:00] [INFO ] [Nat]Absence check using state equation in 1757 ms returned sat
[2023-03-22 00:22:00] [INFO ] Computed and/alt/rep : 2745/10510/2745 causal constraints (skipped 50 transitions) in 229 ms.
[2023-03-22 00:22:05] [INFO ] Added : 147 causal constraints over 30 iterations in 4694 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 14 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 2796/2796 transitions.
Applied a total of 0 rules in 56 ms. Remains 1185 /1185 variables (removed 0) and now considering 2796/2796 (removed 0) transitions.
[2023-03-22 00:22:05] [INFO ] Invariant cache hit.
[2023-03-22 00:22:05] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-22 00:22:05] [INFO ] Invariant cache hit.
[2023-03-22 00:22:07] [INFO ] Implicit Places using invariants and state equation in 2025 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
[2023-03-22 00:22:07] [INFO ] Invariant cache hit.
[2023-03-22 00:22:10] [INFO ] Dead Transitions using invariants and state equation in 2941 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5561 ms. Remains : 1185/1185 places, 2796/2796 transitions.
Computed a total of 250 stabilizing places and 262 stable transitions
Computed a total of 250 stabilizing places and 262 stable transitions
Detected a total of 250/1185 stabilizing places and 262/2796 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (OR (AND (NOT p1) (NOT p2) p3) (AND p1 (NOT p2) (NOT p3)) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (OR (NOT p1) p2 (NOT p3))), (X (AND (NOT p0) (NOT p3))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3))))), (X (NOT p3)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p2) p3) (AND p1 (NOT p2) (NOT p3)) (NOT p0)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (OR (NOT p1) p2 (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2) p3) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 2427 ms. Reduced automaton from 10 states, 30 edges and 4 AP (stutter sensitive) to 10 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 464 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3) p2), (OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), false]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) 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 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 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 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 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 130060 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130060 steps, saw 30374 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-22 00:22:16] [INFO ] Invariant cache hit.
[2023-03-22 00:22:17] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-22 00:22:19] [INFO ] After 1450ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:12
[2023-03-22 00:22:19] [INFO ] After 1998ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:12
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-22 00:22:20] [INFO ] After 2912ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:12
[2023-03-22 00:22:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-22 00:22:24] [INFO ] After 3784ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2023-03-22 00:22:27] [INFO ] Deduced a trap composed of 299 places in 1040 ms of which 1 ms to minimize.
[2023-03-22 00:22:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1257 ms
[2023-03-22 00:22:30] [INFO ] Deduced a trap composed of 293 places in 1219 ms of which 1 ms to minimize.
[2023-03-22 00:22:31] [INFO ] Deduced a trap composed of 299 places in 1097 ms of which 1 ms to minimize.
[2023-03-22 00:22:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2635 ms
[2023-03-22 00:22:33] [INFO ] After 12386ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 3509 ms.
[2023-03-22 00:22:36] [INFO ] After 16698ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 10 different solutions.
Finished Parikh walk after 138 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=27 )
Parikh walk visited 14 properties in 105 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (OR (AND (NOT p1) (NOT p2) p3) (AND p1 (NOT p2) (NOT p3)) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (OR (NOT p1) p2 (NOT p3))), (X (AND (NOT p0) (NOT p3))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3))))), (X (NOT p3)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p2) p3) (AND p1 (NOT p2) (NOT p3)) (NOT p0)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (OR (NOT p1) p2 (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2) p3) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p1) p2 (NOT p3)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND p1 (NOT p2) (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p1) (NOT p2) p3)), (F (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2) p3)))), (F (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2) p3) (AND p1 (NOT p2) (NOT p3))))), (F (OR (AND p0 p2) (AND p0 (NOT p3)))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND p0 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 30 factoid took 2772 ms. Reduced automaton from 10 states, 30 edges and 4 AP (stutter sensitive) to 10 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), (NOT p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), true, (OR (AND p0 (NOT p3)) (AND p0 p2)), (NOT p2), (AND p1 (NOT p2) p3)]
Stuttering acceptance computed with spot in 423 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), (NOT p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), true, (OR (AND p0 (NOT p3)) (AND p0 p2)), (NOT p2), (AND p1 (NOT p2) p3)]
[2023-03-22 00:22:40] [INFO ] Invariant cache hit.
[2023-03-22 00:22:42] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2023-03-22 00:22:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:22:46] [INFO ] [Real]Absence check using state equation in 3556 ms returned sat
[2023-03-22 00:22:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:22:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-22 00:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:22:50] [INFO ] [Nat]Absence check using state equation in 1659 ms returned sat
[2023-03-22 00:22:50] [INFO ] Computed and/alt/rep : 2745/10510/2745 causal constraints (skipped 50 transitions) in 227 ms.
[2023-03-22 00:22:55] [INFO ] Added : 147 causal constraints over 30 iterations in 4524 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 417 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), (NOT p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), true, (OR (AND p0 (NOT p3)) (AND p0 p2)), (NOT p2), (AND p1 (NOT p2) p3)]
Product exploration explored 100000 steps with 892 reset in 277 ms.
Product exploration explored 100000 steps with 890 reset in 291 ms.
Applying partial POR strategy [false, true, false, false, false, false, true, true, true, false]
Stuttering acceptance computed with spot in 423 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), (NOT p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), true, (OR (AND p0 (NOT p3)) (AND p0 p2)), (NOT p2), (AND p1 (NOT p2) p3)]
Support contains 14 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1185/1185 places, 2796/2796 transitions.
Graph (trivial) has 1168 edges and 1185 vertex of which 102 / 1185 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 803 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 803 rules applied. Total rules applied 804 place count 1101 transition count 2700
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 816 place count 1101 transition count 2688
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 816 place count 1101 transition count 2694
Deduced a syphon composed of 852 places in 2 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 865 place count 1101 transition count 2694
Discarding 720 places :
Symmetric choice reduction at 2 with 720 rule applications. Total rules 1585 place count 381 transition count 1974
Deduced a syphon composed of 137 places in 1 ms
Iterating global reduction 2 with 720 rules applied. Total rules applied 2305 place count 381 transition count 1974
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 204 places in 1 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 2372 place count 381 transition count 1992
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 2472 place count 281 transition count 1124
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 2 with 100 rules applied. Total rules applied 2572 place count 281 transition count 1124
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 2589 place count 281 transition count 1107
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 2627 place count 243 transition count 1064
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 3 with 38 rules applied. Total rules applied 2665 place count 243 transition count 1064
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 2681 place count 227 transition count 1048
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 2697 place count 227 transition count 1048
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2702 place count 227 transition count 1043
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2713 place count 216 transition count 1032
Deduced a syphon composed of 98 places in 1 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 2724 place count 216 transition count 1032
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 2725 place count 216 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2726 place count 215 transition count 1031
Deduced a syphon composed of 98 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 2727 place count 215 transition count 1031
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 107 places in 1 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 2736 place count 215 transition count 1076
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 2750 place count 201 transition count 1048
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 4 with 14 rules applied. Total rules applied 2764 place count 201 transition count 1048
Deduced a syphon composed of 93 places in 0 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 2776 place count 201 transition count 1036
Deduced a syphon composed of 93 places in 1 ms
Applied a total of 2776 rules in 387 ms. Remains 201 /1185 variables (removed 984) and now considering 1036/2796 (removed 1760) transitions.
[2023-03-22 00:22:57] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-22 00:22:57] [INFO ] Flow matrix only has 1028 transitions (discarded 8 similar events)
// Phase 1: matrix 1028 rows 201 cols
[2023-03-22 00:22:57] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-22 00:22:58] [INFO ] Dead Transitions using invariants and state equation in 957 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/1185 places, 1036/2796 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1372 ms. Remains : 201/1185 places, 1036/2796 transitions.
Support contains 14 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 2796/2796 transitions.
Applied a total of 0 rules in 56 ms. Remains 1185 /1185 variables (removed 0) and now considering 2796/2796 (removed 0) transitions.
// Phase 1: matrix 2796 rows 1185 cols
[2023-03-22 00:22:58] [INFO ] Computed 7 place invariants in 47 ms
[2023-03-22 00:22:58] [INFO ] Implicit Places using invariants in 724 ms returned []
[2023-03-22 00:22:58] [INFO ] Invariant cache hit.
[2023-03-22 00:23:00] [INFO ] Implicit Places using invariants and state equation in 1968 ms returned []
Implicit Place search using SMT with State Equation took 2694 ms to find 0 implicit places.
[2023-03-22 00:23:00] [INFO ] Invariant cache hit.
[2023-03-22 00:23:03] [INFO ] Dead Transitions using invariants and state equation in 2757 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5511 ms. Remains : 1185/1185 places, 2796/2796 transitions.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-15 finished in 114579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : StigmergyCommit-PT-05b-LTLFireability-01
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 6 out of 1236 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Graph (trivial) has 1227 edges and 1236 vertex of which 102 / 1236 are part of one of the 18 SCC in 0 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 852 transitions
Trivial Post-agglo rules discarded 852 transitions
Performed 852 trivial Post agglomeration. Transition count delta: 852
Iterating post reduction 0 with 852 rules applied. Total rules applied 853 place count 1151 transition count 1901
Reduce places removed 852 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 871 rules applied. Total rules applied 1724 place count 299 transition count 1882
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1732 place count 291 transition count 1882
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1732 place count 291 transition count 1817
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1862 place count 226 transition count 1817
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1872 place count 216 transition count 1807
Iterating global reduction 3 with 10 rules applied. Total rules applied 1882 place count 216 transition count 1807
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1883 place count 216 transition count 1806
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1887 place count 212 transition count 1802
Iterating global reduction 4 with 4 rules applied. Total rules applied 1891 place count 212 transition count 1802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1892 place count 212 transition count 1801
Performed 45 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1982 place count 167 transition count 1754
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 2012 place count 137 transition count 656
Iterating global reduction 5 with 30 rules applied. Total rules applied 2042 place count 137 transition count 656
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2055 place count 137 transition count 643
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 2074 place count 118 transition count 618
Iterating global reduction 6 with 19 rules applied. Total rules applied 2093 place count 118 transition count 618
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 2112 place count 99 transition count 593
Iterating global reduction 6 with 19 rules applied. Total rules applied 2131 place count 99 transition count 593
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2138 place count 99 transition count 586
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2158 place count 89 transition count 593
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2159 place count 88 transition count 581
Iterating global reduction 7 with 1 rules applied. Total rules applied 2160 place count 88 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2161 place count 88 transition count 580
Applied a total of 2161 rules in 196 ms. Remains 88 /1236 variables (removed 1148) and now considering 580/2850 (removed 2270) transitions.
[2023-03-22 00:23:04] [INFO ] Flow matrix only has 573 transitions (discarded 7 similar events)
// Phase 1: matrix 573 rows 88 cols
[2023-03-22 00:23:04] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-22 00:23:04] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-22 00:23:04] [INFO ] Flow matrix only has 573 transitions (discarded 7 similar events)
[2023-03-22 00:23:04] [INFO ] Invariant cache hit.
[2023-03-22 00:23:04] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:23:04] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2023-03-22 00:23:04] [INFO ] Flow matrix only has 573 transitions (discarded 7 similar events)
[2023-03-22 00:23:04] [INFO ] Invariant cache hit.
[2023-03-22 00:23:05] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 88/1236 places, 580/2850 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1282 ms. Remains : 88/1236 places, 580/2850 transitions.
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s5 0) (EQ s19 0) (EQ s34 0) (EQ s47 0) (EQ s61 0) (EQ s76 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8994 reset in 315 ms.
Product exploration explored 100000 steps with 9010 reset in 519 ms.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 903 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1062418 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :{}
Probabilistic random walk after 1062418 steps, saw 195629 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:23:09] [INFO ] Flow matrix only has 573 transitions (discarded 7 similar events)
[2023-03-22 00:23:09] [INFO ] Invariant cache hit.
[2023-03-22 00:23:09] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:23:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 00:23:09] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:23:09] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:23:09] [INFO ] After 118ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:23:09] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-22 00:23:10] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 580/580 transitions.
Graph (complete) has 526 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 87 transition count 566
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 81 transition count 560
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 32 place count 81 transition count 554
Free-agglomeration rule applied 35 times.
Iterating global reduction 2 with 35 rules applied. Total rules applied 67 place count 81 transition count 519
Reduce places removed 36 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 59 rules applied. Total rules applied 126 place count 45 transition count 496
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 132 place count 39 transition count 496
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 138 place count 33 transition count 490
Iterating global reduction 4 with 6 rules applied. Total rules applied 144 place count 33 transition count 490
Performed 12 Post agglomeration using F-continuation condition with reduction of 245 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 168 place count 21 transition count 233
Drop transitions removed 6 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 4 with 92 rules applied. Total rules applied 260 place count 21 transition count 141
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 262 place count 19 transition count 139
Iterating global reduction 5 with 2 rules applied. Total rules applied 264 place count 19 transition count 139
Performed 6 Post agglomeration using F-continuation condition with reduction of 57 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 276 place count 13 transition count 76
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 282 place count 13 transition count 70
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 12 transition count 69
Applied a total of 283 rules in 59 ms. Remains 12 /88 variables (removed 76) and now considering 69/580 (removed 511) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 12/88 places, 69/580 transitions.
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 580/580 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 580/580 (removed 0) transitions.
[2023-03-22 00:23:10] [INFO ] Flow matrix only has 573 transitions (discarded 7 similar events)
[2023-03-22 00:23:10] [INFO ] Invariant cache hit.
[2023-03-22 00:23:10] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-22 00:23:10] [INFO ] Flow matrix only has 573 transitions (discarded 7 similar events)
[2023-03-22 00:23:10] [INFO ] Invariant cache hit.
[2023-03-22 00:23:10] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:23:11] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2023-03-22 00:23:11] [INFO ] Flow matrix only has 573 transitions (discarded 7 similar events)
[2023-03-22 00:23:11] [INFO ] Invariant cache hit.
[2023-03-22 00:23:11] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 857 ms. Remains : 88/88 places, 580/580 transitions.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 887 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1066098 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :{}
Probabilistic random walk after 1066098 steps, saw 196666 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:23:14] [INFO ] Flow matrix only has 573 transitions (discarded 7 similar events)
[2023-03-22 00:23:14] [INFO ] Invariant cache hit.
[2023-03-22 00:23:14] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:23:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 00:23:14] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:23:14] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:23:15] [INFO ] After 119ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:23:15] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-22 00:23:15] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 580/580 transitions.
Graph (complete) has 526 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 87 transition count 566
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 81 transition count 560
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 32 place count 81 transition count 554
Free-agglomeration rule applied 35 times.
Iterating global reduction 2 with 35 rules applied. Total rules applied 67 place count 81 transition count 519
Reduce places removed 36 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 59 rules applied. Total rules applied 126 place count 45 transition count 496
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 132 place count 39 transition count 496
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 138 place count 33 transition count 490
Iterating global reduction 4 with 6 rules applied. Total rules applied 144 place count 33 transition count 490
Performed 12 Post agglomeration using F-continuation condition with reduction of 245 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 168 place count 21 transition count 233
Drop transitions removed 6 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 4 with 92 rules applied. Total rules applied 260 place count 21 transition count 141
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 262 place count 19 transition count 139
Iterating global reduction 5 with 2 rules applied. Total rules applied 264 place count 19 transition count 139
Performed 6 Post agglomeration using F-continuation condition with reduction of 57 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 276 place count 13 transition count 76
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 282 place count 13 transition count 70
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 12 transition count 69
Applied a total of 283 rules in 55 ms. Remains 12 /88 variables (removed 76) and now considering 69/580 (removed 511) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 12/88 places, 69/580 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9003 reset in 314 ms.
Product exploration explored 100000 steps with 8963 reset in 278 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 580/580 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 88 transition count 574
Applied a total of 6 rules in 43 ms. Remains 88 /88 variables (removed 0) and now considering 574/580 (removed 6) transitions.
[2023-03-22 00:23:16] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 00:23:16] [INFO ] Flow matrix only has 567 transitions (discarded 7 similar events)
// Phase 1: matrix 567 rows 88 cols
[2023-03-22 00:23:16] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-22 00:23:16] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/88 places, 574/580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 433 ms. Remains : 88/88 places, 574/580 transitions.
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 580/580 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 580/580 (removed 0) transitions.
[2023-03-22 00:23:16] [INFO ] Flow matrix only has 573 transitions (discarded 7 similar events)
// Phase 1: matrix 573 rows 88 cols
[2023-03-22 00:23:16] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-22 00:23:17] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-22 00:23:17] [INFO ] Flow matrix only has 573 transitions (discarded 7 similar events)
[2023-03-22 00:23:17] [INFO ] Invariant cache hit.
[2023-03-22 00:23:17] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:23:17] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2023-03-22 00:23:17] [INFO ] Flow matrix only has 573 transitions (discarded 7 similar events)
[2023-03-22 00:23:17] [INFO ] Invariant cache hit.
[2023-03-22 00:23:17] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 995 ms. Remains : 88/88 places, 580/580 transitions.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-01 finished in 14164 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 (F(p1) U p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U G(((p1 U p2)||X(p3)))))'
Found a Lengthening insensitive property : StigmergyCommit-PT-05b-LTLFireability-15
Stuttering acceptance computed with spot in 401 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, p0, (NOT p2), (AND p0 (NOT p2) p3)]
Support contains 14 out of 1236 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1236/1236 places, 2850/2850 transitions.
Graph (trivial) has 1217 edges and 1236 vertex of which 102 / 1236 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 842 transitions
Trivial Post-agglo rules discarded 842 transitions
Performed 842 trivial Post agglomeration. Transition count delta: 842
Iterating post reduction 0 with 842 rules applied. Total rules applied 843 place count 1151 transition count 1911
Reduce places removed 842 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 861 rules applied. Total rules applied 1704 place count 309 transition count 1892
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1712 place count 301 transition count 1892
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1712 place count 301 transition count 1827
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1842 place count 236 transition count 1827
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1851 place count 227 transition count 1818
Iterating global reduction 3 with 9 rules applied. Total rules applied 1860 place count 227 transition count 1818
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1861 place count 227 transition count 1817
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1864 place count 224 transition count 1814
Iterating global reduction 4 with 3 rules applied. Total rules applied 1867 place count 224 transition count 1814
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1868 place count 224 transition count 1813
Performed 46 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 1960 place count 178 transition count 1765
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1985 place count 153 transition count 983
Iterating global reduction 5 with 25 rules applied. Total rules applied 2010 place count 153 transition count 983
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 2019 place count 153 transition count 974
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2036 place count 136 transition count 952
Iterating global reduction 6 with 17 rules applied. Total rules applied 2053 place count 136 transition count 952
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2070 place count 119 transition count 930
Iterating global reduction 6 with 17 rules applied. Total rules applied 2087 place count 119 transition count 930
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2093 place count 119 transition count 924
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 2115 place count 108 transition count 931
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2116 place count 107 transition count 917
Iterating global reduction 7 with 1 rules applied. Total rules applied 2117 place count 107 transition count 917
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2118 place count 107 transition count 916
Applied a total of 2118 rules in 186 ms. Remains 107 /1236 variables (removed 1129) and now considering 916/2850 (removed 1934) transitions.
[2023-03-22 00:23:18] [INFO ] Flow matrix only has 908 transitions (discarded 8 similar events)
// Phase 1: matrix 908 rows 107 cols
[2023-03-22 00:23:18] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-22 00:23:19] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-22 00:23:19] [INFO ] Flow matrix only has 908 transitions (discarded 8 similar events)
[2023-03-22 00:23:19] [INFO ] Invariant cache hit.
[2023-03-22 00:23:19] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 00:23:19] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2023-03-22 00:23:19] [INFO ] Flow matrix only has 908 transitions (discarded 8 similar events)
[2023-03-22 00:23:19] [INFO ] Invariant cache hit.
[2023-03-22 00:23:20] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 107/1236 places, 916/2850 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1436 ms. Remains : 107/1236 places, 916/2850 transitions.
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={0} source=9 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0) p3), acceptance={0} source=9 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) p1 (NOT p0) p3), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s25 1) (EQ s40 1) (EQ s58 1) (EQ s75 1) (EQ s93 1)), p2:(EQ s54 1), p1:(EQ s100 1), p3:(OR (AND (EQ s5 1) (EQ s21 1) (EQ s36 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-15 finished in 1971 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-22 00:23:20] [INFO ] Flatten gal took : 166 ms
[2023-03-22 00:23:20] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-22 00:23:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1236 places, 2850 transitions and 21104 arcs took 37 ms.
Total runtime 331969 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2659/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2659/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2659/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : StigmergyCommit-PT-05b-LTLFireability-01
Could not compute solution for formula : StigmergyCommit-PT-05b-LTLFireability-06
Could not compute solution for formula : StigmergyCommit-PT-05b-LTLFireability-15

BK_STOP 1679444607233

--------------------
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 StigmergyCommit-PT-05b-LTLFireability-01
ltl formula formula --ltl=/tmp/2659/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 1236 places, 2850 transitions and 21104 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.890 real 0.140 user 0.160 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2659/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2659/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2659/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2659/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name StigmergyCommit-PT-05b-LTLFireability-06
ltl formula formula --ltl=/tmp/2659/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 1236 places, 2850 transitions and 21104 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.130 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2659/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2659/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2659/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2659/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name StigmergyCommit-PT-05b-LTLFireability-15
ltl formula formula --ltl=/tmp/2659/ltl_2_
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 1236 places, 2850 transitions and 21104 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.890 real 0.150 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2659/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2659/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2659/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2659/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="StigmergyCommit-PT-05b"
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 StigmergyCommit-PT-05b, 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 r457-smll-167912649300452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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