About the Execution of 2023-gold for MultiCrashLeafsetExtension-PT-S24C08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16216.960 | 3600000.00 | 3171329.00 | 485352.10 | FF?F?FF?FFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372000068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MultiCrashLeafsetExtension-PT-S24C08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372000068
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 12 06:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 06:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716642379057
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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 13:06:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 13:06:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 13:06:21] [INFO ] Load time of PNML (sax parser for PT used): 489 ms
[2024-05-25 13:06:21] [INFO ] Transformed 15180 places.
[2024-05-25 13:06:21] [INFO ] Transformed 22267 transitions.
[2024-05-25 13:06:21] [INFO ] Parsed PT model containing 15180 places and 22267 transitions and 84086 arcs in 654 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 MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 15180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15180/15180 places, 22267/22267 transitions.
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 15136 transition count 22267
Applied a total of 44 rules in 649 ms. Remains 15136 /15180 variables (removed 44) and now considering 22267/22267 (removed 0) transitions.
[2024-05-25 13:06:22] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2024-05-25 13:06:23] [INFO ] Computed 1093 invariants in 1753 ms
[2024-05-25 13:06:25] [INFO ] Implicit Places using invariants in 3215 ms returned []
Implicit Place search using SMT only with invariants took 3242 ms to find 0 implicit places.
[2024-05-25 13:06:25] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2024-05-25 13:06:25] [INFO ] Invariant cache hit.
[2024-05-25 13:06:26] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15136/15180 places, 22267/22267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5157 ms. Remains : 15136/15180 places, 22267/22267 transitions.
Support contains 45 out of 15136 places after structural reductions.
[2024-05-25 13:06:27] [INFO ] Flatten gal took : 861 ms
[2024-05-25 13:06:28] [INFO ] Flatten gal took : 613 ms
[2024-05-25 13:06:29] [INFO ] Input system was already deterministic with 22267 transitions.
Support contains 44 out of 15136 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 24) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2024-05-25 13:06:30] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2024-05-25 13:06:30] [INFO ] Invariant cache hit.
[2024-05-25 13:06:35] [INFO ] [Real]Absence check using 47 positive place invariants in 205 ms returned sat
[2024-05-25 13:06:36] [INFO ] [Real]Absence check using 47 positive and 1046 generalized place invariants in 587 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 13:06:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 13:06:55] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 15136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4773 transitions
Trivial Post-agglo rules discarded 4773 transitions
Performed 4773 trivial Post agglomeration. Transition count delta: 4773
Iterating post reduction 0 with 4773 rules applied. Total rules applied 4773 place count 15136 transition count 17494
Reduce places removed 4773 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 4797 rules applied. Total rules applied 9570 place count 10363 transition count 17470
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 9594 place count 10339 transition count 17470
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 398 Pre rules applied. Total rules applied 9594 place count 10339 transition count 17072
Deduced a syphon composed of 398 places in 12 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 796 rules applied. Total rules applied 10390 place count 9941 transition count 17072
Discarding 4395 places :
Symmetric choice reduction at 3 with 4395 rule applications. Total rules 14785 place count 5546 transition count 12677
Iterating global reduction 3 with 4395 rules applied. Total rules applied 19180 place count 5546 transition count 12677
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 19180 place count 5546 transition count 12665
Deduced a syphon composed of 12 places in 10 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 19204 place count 5534 transition count 12665
Discarding 542 places :
Symmetric choice reduction at 3 with 542 rule applications. Total rules 19746 place count 4992 transition count 8329
Iterating global reduction 3 with 542 rules applied. Total rules applied 20288 place count 4992 transition count 8329
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 7 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 20336 place count 4968 transition count 8305
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 3 with 338 rules applied. Total rules applied 20674 place count 4968 transition count 11761
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 3 with 338 rules applied. Total rules applied 21012 place count 4630 transition count 11761
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 4 with 98 rules applied. Total rules applied 21110 place count 4630 transition count 11761
Applied a total of 21110 rules in 5178 ms. Remains 4630 /15136 variables (removed 10506) and now considering 11761/22267 (removed 10506) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5181 ms. Remains : 4630/15136 places, 11761/22267 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-25 13:07:02] [INFO ] Flow matrix only has 10878 transitions (discarded 883 similar events)
// Phase 1: matrix 10878 rows 4630 cols
[2024-05-25 13:07:03] [INFO ] Computed 1093 invariants in 254 ms
[2024-05-25 13:07:04] [INFO ] [Real]Absence check using 49 positive place invariants in 85 ms returned sat
[2024-05-25 13:07:04] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 274 ms returned sat
[2024-05-25 13:07:14] [INFO ] After 8916ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:9
[2024-05-25 13:07:14] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 13:07:17] [INFO ] After 2671ms SMT Verify possible using 6802 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-25 13:07:17] [INFO ] After 14011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-25 13:07:18] [INFO ] [Nat]Absence check using 49 positive place invariants in 80 ms returned sat
[2024-05-25 13:07:18] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 289 ms returned sat
[2024-05-25 13:07:28] [INFO ] After 8975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-25 13:07:42] [INFO ] After 13796ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :1 sat :9
[2024-05-25 13:07:42] [INFO ] After 13801ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-25 13:07:42] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 21 out of 4630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4630/4630 places, 11761/11761 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4630 transition count 11759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4628 transition count 11759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 4628 transition count 11758
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4627 transition count 11758
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 4626 transition count 11757
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 4626 transition count 11757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 4626 transition count 11756
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 4625 transition count 11756
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 4625 transition count 11754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 4623 transition count 11754
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 4622 transition count 11753
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 4622 transition count 11753
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 4622 transition count 11753
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 4621 transition count 11752
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 4621 transition count 11752
Applied a total of 19 rules in 2778 ms. Remains 4621 /4630 variables (removed 9) and now considering 11752/11761 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2780 ms. Remains : 4621/4630 places, 11752/11761 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 674 ms. (steps per millisecond=14 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-25 13:07:46] [INFO ] Flow matrix only has 10869 transitions (discarded 883 similar events)
// Phase 1: matrix 10869 rows 4621 cols
[2024-05-25 13:07:46] [INFO ] Computed 1093 invariants in 258 ms
[2024-05-25 13:07:47] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2024-05-25 13:07:48] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 277 ms returned sat
[2024-05-25 13:07:57] [INFO ] After 8887ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2024-05-25 13:07:57] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 13:07:58] [INFO ] After 1170ms SMT Verify possible using 6802 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 13:07:58] [INFO ] After 12027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 13:07:59] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-05-25 13:08:00] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 281 ms returned sat
[2024-05-25 13:08:08] [INFO ] After 7797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-25 13:08:23] [INFO ] After 15432ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-25 13:08:23] [INFO ] After 15433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 13:08:23] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 66 ms.
Support contains 18 out of 4621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4621/4621 places, 11752/11752 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4621 transition count 11751
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4620 transition count 11751
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 4620 transition count 11749
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 4618 transition count 11749
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 4617 transition count 11748
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 4617 transition count 11748
Applied a total of 8 rules in 1537 ms. Remains 4617 /4621 variables (removed 4) and now considering 11748/11752 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1538 ms. Remains : 4617/4621 places, 11748/11752 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 12512 stabilizing places and 17066 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Support contains 3 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 400 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2024-05-25 13:08:26] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2024-05-25 13:08:27] [INFO ] Computed 1093 invariants in 1423 ms
[2024-05-25 13:08:28] [INFO ] Implicit Places using invariants in 2628 ms returned []
Implicit Place search using SMT only with invariants took 2629 ms to find 0 implicit places.
[2024-05-25 13:08:28] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2024-05-25 13:08:28] [INFO ] Invariant cache hit.
[2024-05-25 13:08:30] [INFO ] Dead Transitions using invariants and state equation in 1163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4194 ms. Remains : 15136/15136 places, 22267/22267 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 315 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s3403 1) (GEQ s12385 1)), p0:(GEQ s12038 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 8 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01 finished in 4625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4800 transitions
Trivial Post-agglo rules discarded 4800 transitions
Performed 4800 trivial Post agglomeration. Transition count delta: 4800
Iterating post reduction 0 with 4800 rules applied. Total rules applied 4800 place count 15136 transition count 17467
Reduce places removed 4800 places and 0 transitions.
Iterating post reduction 1 with 4800 rules applied. Total rules applied 9600 place count 10336 transition count 17467
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 9600 place count 10336 transition count 17067
Deduced a syphon composed of 400 places in 35 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 10400 place count 9936 transition count 17067
Discarding 4400 places :
Symmetric choice reduction at 2 with 4400 rule applications. Total rules 14800 place count 5536 transition count 12667
Iterating global reduction 2 with 4400 rules applied. Total rules applied 19200 place count 5536 transition count 12667
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 19200 place count 5536 transition count 12651
Deduced a syphon composed of 16 places in 8 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 19232 place count 5520 transition count 12651
Discarding 550 places :
Symmetric choice reduction at 2 with 550 rule applications. Total rules 19782 place count 4970 transition count 8251
Iterating global reduction 2 with 550 rules applied. Total rules applied 20332 place count 4970 transition count 8251
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 20380 place count 4946 transition count 8227
Applied a total of 20380 rules in 2678 ms. Remains 4946 /15136 variables (removed 10190) and now considering 8227/22267 (removed 14040) transitions.
[2024-05-25 13:08:33] [INFO ] Flow matrix only has 7627 transitions (discarded 600 similar events)
// Phase 1: matrix 7627 rows 4946 cols
[2024-05-25 13:08:33] [INFO ] Computed 1093 invariants in 188 ms
[2024-05-25 13:08:38] [INFO ] Implicit Places using invariants in 5449 ms returned []
[2024-05-25 13:08:38] [INFO ] Flow matrix only has 7627 transitions (discarded 600 similar events)
[2024-05-25 13:08:38] [INFO ] Invariant cache hit.
[2024-05-25 13:08:43] [INFO ] Implicit Places using invariants and state equation in 5047 ms returned []
Implicit Place search using SMT with State Equation took 10502 ms to find 0 implicit places.
[2024-05-25 13:08:44] [INFO ] Redundant transitions in 1043 ms returned []
[2024-05-25 13:08:44] [INFO ] Flow matrix only has 7627 transitions (discarded 600 similar events)
[2024-05-25 13:08:44] [INFO ] Invariant cache hit.
[2024-05-25 13:08:49] [INFO ] Dead Transitions using invariants and state equation in 5035 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4946/15136 places, 8227/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19265 ms. Remains : 4946/15136 places, 8227/22267 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s3852 1) (LT s3855 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1732 reset in 1244 ms.
Product exploration explored 100000 steps with 1730 reset in 1192 ms.
Computed a total of 2346 stabilizing places and 3050 stable transitions
Computed a total of 2346 stabilizing places and 3050 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 173 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24978 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24978 steps, saw 11721 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:08:55] [INFO ] Flow matrix only has 7627 transitions (discarded 600 similar events)
[2024-05-25 13:08:55] [INFO ] Invariant cache hit.
[2024-05-25 13:08:56] [INFO ] [Real]Absence check using 49 positive place invariants in 65 ms returned sat
[2024-05-25 13:08:56] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 298 ms returned sat
[2024-05-25 13:09:01] [INFO ] After 4601ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:09:01] [INFO ] State equation strengthened by 2952 read => feed constraints.
[2024-05-25 13:09:02] [INFO ] After 890ms SMT Verify possible using 2952 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:09:02] [INFO ] After 6439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:09:02] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2024-05-25 13:09:02] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 295 ms returned sat
[2024-05-25 13:09:07] [INFO ] After 4277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:09:16] [INFO ] After 9184ms SMT Verify possible using 2952 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 13:09:16] [INFO ] After 14358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 4946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4946/4946 places, 8227/8227 transitions.
Free-agglomeration rule (complex) applied 334 times.
Iterating global reduction 0 with 334 rules applied. Total rules applied 334 place count 4946 transition count 11743
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 0 with 334 rules applied. Total rules applied 668 place count 4612 transition count 11743
Applied a total of 668 rules in 1262 ms. Remains 4612 /4946 variables (removed 334) and now considering 11743/8227 (removed -3516) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1263 ms. Remains : 4612/4946 places, 11743/8227 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22272 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22272 steps, saw 10286 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:09:21] [INFO ] Flow matrix only has 10859 transitions (discarded 884 similar events)
// Phase 1: matrix 10859 rows 4612 cols
[2024-05-25 13:09:21] [INFO ] Computed 1093 invariants in 247 ms
[2024-05-25 13:09:21] [INFO ] [Real]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-05-25 13:09:22] [INFO ] [Real]Absence check using 47 positive and 1046 generalized place invariants in 301 ms returned sat
[2024-05-25 13:09:28] [INFO ] After 6536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:09:28] [INFO ] [Nat]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-05-25 13:09:28] [INFO ] [Nat]Absence check using 47 positive and 1046 generalized place invariants in 304 ms returned sat
[2024-05-25 13:09:34] [INFO ] After 5902ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:09:34] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 13:09:44] [INFO ] After 9519ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 13:09:44] [INFO ] After 16338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 4612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4612/4612 places, 11743/11743 transitions.
Applied a total of 0 rules in 616 ms. Remains 4612 /4612 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 616 ms. Remains : 4612/4612 places, 11743/11743 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4612/4612 places, 11743/11743 transitions.
Applied a total of 0 rules in 635 ms. Remains 4612 /4612 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
[2024-05-25 13:09:45] [INFO ] Flow matrix only has 10859 transitions (discarded 884 similar events)
[2024-05-25 13:09:45] [INFO ] Invariant cache hit.
[2024-05-25 13:09:49] [INFO ] Implicit Places using invariants in 4338 ms returned []
Implicit Place search using SMT only with invariants took 4339 ms to find 0 implicit places.
[2024-05-25 13:09:49] [INFO ] Flow matrix only has 10859 transitions (discarded 884 similar events)
[2024-05-25 13:09:49] [INFO ] Invariant cache hit.
[2024-05-25 13:09:56] [INFO ] Dead Transitions using invariants and state equation in 6335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11312 ms. Remains : 4612/4612 places, 11743/11743 transitions.
Graph (trivial) has 3378 edges and 4612 vertex of which 24 / 4612 are part of one of the 1 SCC in 4 ms
Free SCC test removed 23 places
Drop transitions removed 611 transitions
Ensure Unique test removed 831 transitions
Reduce isomorphic transitions removed 1442 transitions.
Graph (complete) has 39972 edges and 4589 vertex of which 4567 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t9361.t11089 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 203 rules applied. Total rules applied 205 place count 4183 transition count 10098
Ensure Unique test removed 1 places
Reduce places removed 202 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 180 transitions.
Drop transitions removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 1 with 561 rules applied. Total rules applied 766 place count 3981 transition count 9739
Ensure Unique test removed 1 places
Reduce places removed 180 places and 0 transitions.
Drop transitions removed 34 transitions
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 179 transitions.
Drop transitions removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 2 with 504 rules applied. Total rules applied 1270 place count 3801 transition count 9415
Ensure Unique test removed 34 places
Reduce places removed 179 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 145 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 3 with 467 rules applied. Total rules applied 1737 place count 3622 transition count 9127
Ensure Unique test removed 2 places
Reduce places removed 145 places and 0 transitions.
Drop transitions removed 30 transitions
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 143 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 4 with 401 rules applied. Total rules applied 2138 place count 3477 transition count 8871
Ensure Unique test removed 30 places
Reduce places removed 143 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 113 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 5 with 367 rules applied. Total rules applied 2505 place count 3334 transition count 8647
Ensure Unique test removed 2 places
Reduce places removed 113 places and 0 transitions.
Drop transitions removed 26 transitions
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 111 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 6 with 309 rules applied. Total rules applied 2814 place count 3221 transition count 8451
Ensure Unique test removed 26 places
Reduce places removed 111 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 85 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 7 with 279 rules applied. Total rules applied 3093 place count 3110 transition count 8283
Ensure Unique test removed 2 places
Reduce places removed 85 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 8 with 229 rules applied. Total rules applied 3322 place count 3025 transition count 8139
Ensure Unique test removed 22 places
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 9 with 203 rules applied. Total rules applied 3525 place count 2942 transition count 8019
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Drop transitions removed 18 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 10 with 161 rules applied. Total rules applied 3686 place count 2881 transition count 7919
Ensure Unique test removed 18 places
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 11 with 139 rules applied. Total rules applied 3825 place count 2822 transition count 7839
Ensure Unique test removed 2 places
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 12 with 105 rules applied. Total rules applied 3930 place count 2781 transition count 7775
Ensure Unique test removed 14 places
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 13 with 87 rules applied. Total rules applied 4017 place count 2742 transition count 7727
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 14 with 61 rules applied. Total rules applied 4078 place count 2717 transition count 7691
Ensure Unique test removed 10 places
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 15 with 47 rules applied. Total rules applied 4125 place count 2694 transition count 7667
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 16 with 29 rules applied. Total rules applied 4154 place count 2681 transition count 7651
Ensure Unique test removed 6 places
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 17 with 19 rules applied. Total rules applied 4173 place count 2670 transition count 7643
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 18 with 9 rules applied. Total rules applied 4182 place count 2665 transition count 7639
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 19 with 6 rules applied. Total rules applied 4188 place count 2662 transition count 7636
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 4191 place count 2659 transition count 7636
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 400 Pre rules applied. Total rules applied 4191 place count 2659 transition count 7236
Deduced a syphon composed of 400 places in 2 ms
Ensure Unique test removed 400 places
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 21 with 1200 rules applied. Total rules applied 5391 place count 1859 transition count 7236
Discarding 407 places :
Symmetric choice reduction at 21 with 407 rule applications. Total rules 5798 place count 1452 transition count 6829
Iterating global reduction 21 with 407 rules applied. Total rules applied 6205 place count 1452 transition count 6829
Discarding 490 places :
Symmetric choice reduction at 21 with 490 rule applications. Total rules 6695 place count 962 transition count 2909
Iterating global reduction 21 with 490 rules applied. Total rules applied 7185 place count 962 transition count 2909
Ensure Unique test removed 489 transitions
Reduce isomorphic transitions removed 489 transitions.
Iterating post reduction 21 with 489 rules applied. Total rules applied 7674 place count 962 transition count 2420
Performed 662 Post agglomeration using F-continuation condition.Transition count delta: 662
Deduced a syphon composed of 662 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 663 places and 0 transitions.
Iterating global reduction 22 with 1325 rules applied. Total rules applied 8999 place count 299 transition count 1758
Drop transitions removed 660 transitions
Reduce isomorphic transitions removed 660 transitions.
Iterating post reduction 22 with 660 rules applied. Total rules applied 9659 place count 299 transition count 1098
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 23 with 64 rules applied. Total rules applied 9723 place count 299 transition count 1034
Ensure Unique test removed 63 places
Iterating post reduction 23 with 63 rules applied. Total rules applied 9786 place count 236 transition count 1034
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 24 with 1 Pre rules applied. Total rules applied 9786 place count 236 transition count 1033
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 9788 place count 235 transition count 1033
Discarding 62 places :
Symmetric choice reduction at 24 with 62 rule applications. Total rules 9850 place count 173 transition count 537
Iterating global reduction 24 with 62 rules applied. Total rules applied 9912 place count 173 transition count 537
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 24 with 40 rules applied. Total rules applied 9952 place count 173 transition count 497
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 25 with 22 rules applied. Total rules applied 9974 place count 173 transition count 475
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 25 with 16 rules applied. Total rules applied 9990 place count 173 transition count 459
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 25 with 16 rules applied. Total rules applied 10006 place count 157 transition count 459
Discarding 22 places :
Symmetric choice reduction at 26 with 22 rule applications. Total rules 10028 place count 135 transition count 283
Iterating global reduction 26 with 22 rules applied. Total rules applied 10050 place count 135 transition count 283
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 26 with 22 rules applied. Total rules applied 10072 place count 135 transition count 261
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 10073 place count 135 transition count 261
Applied a total of 10073 rules in 10279 ms. Remains 135 /4612 variables (removed 4477) and now considering 261/11743 (removed 11482) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 261 rows 135 cols
[2024-05-25 13:10:06] [INFO ] Computed 43 invariants in 9 ms
[2024-05-25 13:10:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 13:10:06] [INFO ] [Real]Absence check using 4 positive and 39 generalized place invariants in 6 ms returned sat
[2024-05-25 13:10:06] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:10:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 13:10:06] [INFO ] [Nat]Absence check using 4 positive and 39 generalized place invariants in 5 ms returned sat
[2024-05-25 13:10:06] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:10:06] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-25 13:10:06] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 4946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4946/4946 places, 8227/8227 transitions.
Applied a total of 0 rules in 544 ms. Remains 4946 /4946 variables (removed 0) and now considering 8227/8227 (removed 0) transitions.
[2024-05-25 13:10:07] [INFO ] Flow matrix only has 7627 transitions (discarded 600 similar events)
// Phase 1: matrix 7627 rows 4946 cols
[2024-05-25 13:10:07] [INFO ] Computed 1093 invariants in 329 ms
[2024-05-25 13:10:13] [INFO ] Implicit Places using invariants in 5523 ms returned []
[2024-05-25 13:10:13] [INFO ] Flow matrix only has 7627 transitions (discarded 600 similar events)
[2024-05-25 13:10:13] [INFO ] Invariant cache hit.
[2024-05-25 13:10:18] [INFO ] Implicit Places using invariants and state equation in 4971 ms returned []
Implicit Place search using SMT with State Equation took 10498 ms to find 0 implicit places.
[2024-05-25 13:10:19] [INFO ] Redundant transitions in 887 ms returned []
[2024-05-25 13:10:19] [INFO ] Flow matrix only has 7627 transitions (discarded 600 similar events)
[2024-05-25 13:10:19] [INFO ] Invariant cache hit.
[2024-05-25 13:10:24] [INFO ] Dead Transitions using invariants and state equation in 5068 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17006 ms. Remains : 4946/4946 places, 8227/8227 transitions.
Computed a total of 2346 stabilizing places and 3050 stable transitions
Computed a total of 2346 stabilizing places and 3050 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 890 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 172 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25634 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25634 steps, saw 12022 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:10:28] [INFO ] Flow matrix only has 7627 transitions (discarded 600 similar events)
[2024-05-25 13:10:28] [INFO ] Invariant cache hit.
[2024-05-25 13:10:28] [INFO ] [Real]Absence check using 49 positive place invariants in 66 ms returned sat
[2024-05-25 13:10:29] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 296 ms returned sat
[2024-05-25 13:10:33] [INFO ] After 4293ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:10:33] [INFO ] State equation strengthened by 2952 read => feed constraints.
[2024-05-25 13:10:34] [INFO ] After 911ms SMT Verify possible using 2952 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:10:34] [INFO ] After 6109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:10:34] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2024-05-25 13:10:35] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 290 ms returned sat
[2024-05-25 13:10:39] [INFO ] After 4207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:10:48] [INFO ] After 9163ms SMT Verify possible using 2952 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 13:10:48] [INFO ] After 14251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 4946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4946/4946 places, 8227/8227 transitions.
Free-agglomeration rule (complex) applied 334 times.
Iterating global reduction 0 with 334 rules applied. Total rules applied 334 place count 4946 transition count 11743
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 0 with 334 rules applied. Total rules applied 668 place count 4612 transition count 11743
Applied a total of 668 rules in 1288 ms. Remains 4612 /4946 variables (removed 334) and now considering 11743/8227 (removed -3516) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1288 ms. Remains : 4612/4946 places, 11743/8227 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22654 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22654 steps, saw 10456 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:10:53] [INFO ] Flow matrix only has 10859 transitions (discarded 884 similar events)
// Phase 1: matrix 10859 rows 4612 cols
[2024-05-25 13:10:53] [INFO ] Computed 1093 invariants in 239 ms
[2024-05-25 13:10:54] [INFO ] [Real]Absence check using 47 positive place invariants in 49 ms returned sat
[2024-05-25 13:10:54] [INFO ] [Real]Absence check using 47 positive and 1046 generalized place invariants in 294 ms returned sat
[2024-05-25 13:11:00] [INFO ] After 6502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:11:00] [INFO ] [Nat]Absence check using 47 positive place invariants in 49 ms returned sat
[2024-05-25 13:11:00] [INFO ] [Nat]Absence check using 47 positive and 1046 generalized place invariants in 288 ms returned sat
[2024-05-25 13:11:06] [INFO ] After 5696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:11:06] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 13:11:16] [INFO ] After 9502ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 13:11:16] [INFO ] After 16083ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 4612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4612/4612 places, 11743/11743 transitions.
Applied a total of 0 rules in 618 ms. Remains 4612 /4612 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 618 ms. Remains : 4612/4612 places, 11743/11743 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4612/4612 places, 11743/11743 transitions.
Applied a total of 0 rules in 618 ms. Remains 4612 /4612 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
[2024-05-25 13:11:17] [INFO ] Flow matrix only has 10859 transitions (discarded 884 similar events)
[2024-05-25 13:11:17] [INFO ] Invariant cache hit.
[2024-05-25 13:11:21] [INFO ] Implicit Places using invariants in 4026 ms returned []
Implicit Place search using SMT only with invariants took 4027 ms to find 0 implicit places.
[2024-05-25 13:11:21] [INFO ] Flow matrix only has 10859 transitions (discarded 884 similar events)
[2024-05-25 13:11:21] [INFO ] Invariant cache hit.
[2024-05-25 13:11:27] [INFO ] Dead Transitions using invariants and state equation in 6398 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11046 ms. Remains : 4612/4612 places, 11743/11743 transitions.
Graph (trivial) has 3378 edges and 4612 vertex of which 24 / 4612 are part of one of the 1 SCC in 2 ms
Free SCC test removed 23 places
Drop transitions removed 611 transitions
Ensure Unique test removed 831 transitions
Reduce isomorphic transitions removed 1442 transitions.
Graph (complete) has 39972 edges and 4589 vertex of which 4567 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t9361.t11089 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 203 rules applied. Total rules applied 205 place count 4183 transition count 10098
Ensure Unique test removed 1 places
Reduce places removed 202 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 180 transitions.
Drop transitions removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 1 with 561 rules applied. Total rules applied 766 place count 3981 transition count 9739
Ensure Unique test removed 1 places
Reduce places removed 180 places and 0 transitions.
Drop transitions removed 34 transitions
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 179 transitions.
Drop transitions removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 2 with 504 rules applied. Total rules applied 1270 place count 3801 transition count 9415
Ensure Unique test removed 34 places
Reduce places removed 179 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 145 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 3 with 467 rules applied. Total rules applied 1737 place count 3622 transition count 9127
Ensure Unique test removed 2 places
Reduce places removed 145 places and 0 transitions.
Drop transitions removed 30 transitions
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 143 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 4 with 401 rules applied. Total rules applied 2138 place count 3477 transition count 8871
Ensure Unique test removed 30 places
Reduce places removed 143 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 113 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 5 with 367 rules applied. Total rules applied 2505 place count 3334 transition count 8647
Ensure Unique test removed 2 places
Reduce places removed 113 places and 0 transitions.
Drop transitions removed 26 transitions
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 111 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 6 with 309 rules applied. Total rules applied 2814 place count 3221 transition count 8451
Ensure Unique test removed 26 places
Reduce places removed 111 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 85 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 7 with 279 rules applied. Total rules applied 3093 place count 3110 transition count 8283
Ensure Unique test removed 2 places
Reduce places removed 85 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 8 with 229 rules applied. Total rules applied 3322 place count 3025 transition count 8139
Ensure Unique test removed 22 places
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 9 with 203 rules applied. Total rules applied 3525 place count 2942 transition count 8019
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Drop transitions removed 18 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 10 with 161 rules applied. Total rules applied 3686 place count 2881 transition count 7919
Ensure Unique test removed 18 places
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 11 with 139 rules applied. Total rules applied 3825 place count 2822 transition count 7839
Ensure Unique test removed 2 places
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 12 with 105 rules applied. Total rules applied 3930 place count 2781 transition count 7775
Ensure Unique test removed 14 places
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 13 with 87 rules applied. Total rules applied 4017 place count 2742 transition count 7727
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 14 with 61 rules applied. Total rules applied 4078 place count 2717 transition count 7691
Ensure Unique test removed 10 places
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 15 with 47 rules applied. Total rules applied 4125 place count 2694 transition count 7667
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 16 with 29 rules applied. Total rules applied 4154 place count 2681 transition count 7651
Ensure Unique test removed 6 places
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 17 with 19 rules applied. Total rules applied 4173 place count 2670 transition count 7643
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 18 with 9 rules applied. Total rules applied 4182 place count 2665 transition count 7639
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 19 with 6 rules applied. Total rules applied 4188 place count 2662 transition count 7636
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 4191 place count 2659 transition count 7636
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 400 Pre rules applied. Total rules applied 4191 place count 2659 transition count 7236
Deduced a syphon composed of 400 places in 2 ms
Ensure Unique test removed 400 places
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 21 with 1200 rules applied. Total rules applied 5391 place count 1859 transition count 7236
Discarding 407 places :
Symmetric choice reduction at 21 with 407 rule applications. Total rules 5798 place count 1452 transition count 6829
Iterating global reduction 21 with 407 rules applied. Total rules applied 6205 place count 1452 transition count 6829
Discarding 490 places :
Symmetric choice reduction at 21 with 490 rule applications. Total rules 6695 place count 962 transition count 2909
Iterating global reduction 21 with 490 rules applied. Total rules applied 7185 place count 962 transition count 2909
Ensure Unique test removed 489 transitions
Reduce isomorphic transitions removed 489 transitions.
Iterating post reduction 21 with 489 rules applied. Total rules applied 7674 place count 962 transition count 2420
Performed 662 Post agglomeration using F-continuation condition.Transition count delta: 662
Deduced a syphon composed of 662 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 663 places and 0 transitions.
Iterating global reduction 22 with 1325 rules applied. Total rules applied 8999 place count 299 transition count 1758
Drop transitions removed 660 transitions
Reduce isomorphic transitions removed 660 transitions.
Iterating post reduction 22 with 660 rules applied. Total rules applied 9659 place count 299 transition count 1098
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 23 with 64 rules applied. Total rules applied 9723 place count 299 transition count 1034
Ensure Unique test removed 63 places
Iterating post reduction 23 with 63 rules applied. Total rules applied 9786 place count 236 transition count 1034
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 24 with 1 Pre rules applied. Total rules applied 9786 place count 236 transition count 1033
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 9788 place count 235 transition count 1033
Discarding 62 places :
Symmetric choice reduction at 24 with 62 rule applications. Total rules 9850 place count 173 transition count 537
Iterating global reduction 24 with 62 rules applied. Total rules applied 9912 place count 173 transition count 537
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 24 with 40 rules applied. Total rules applied 9952 place count 173 transition count 497
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 25 with 22 rules applied. Total rules applied 9974 place count 173 transition count 475
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 25 with 16 rules applied. Total rules applied 9990 place count 173 transition count 459
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 25 with 16 rules applied. Total rules applied 10006 place count 157 transition count 459
Discarding 22 places :
Symmetric choice reduction at 26 with 22 rule applications. Total rules 10028 place count 135 transition count 283
Iterating global reduction 26 with 22 rules applied. Total rules applied 10050 place count 135 transition count 283
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 26 with 22 rules applied. Total rules applied 10072 place count 135 transition count 261
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 10073 place count 135 transition count 261
Applied a total of 10073 rules in 9779 ms. Remains 135 /4612 variables (removed 4477) and now considering 261/11743 (removed 11482) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 261 rows 135 cols
[2024-05-25 13:11:37] [INFO ] Computed 43 invariants in 5 ms
[2024-05-25 13:11:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 13:11:37] [INFO ] [Real]Absence check using 4 positive and 39 generalized place invariants in 5 ms returned sat
[2024-05-25 13:11:37] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:11:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 13:11:37] [INFO ] [Nat]Absence check using 4 positive and 39 generalized place invariants in 5 ms returned sat
[2024-05-25 13:11:37] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:11:37] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-25 13:11:37] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1729 reset in 1145 ms.
Product exploration explored 100000 steps with 1730 reset in 1178 ms.
Built C files in :
/tmp/ltsmin7588829890035754728
[2024-05-25 13:11:40] [INFO ] Too many transitions (8227) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:11:40] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7588829890035754728
Running compilation step : cd /tmp/ltsmin7588829890035754728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7588829890035754728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7588829890035754728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 4946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4946/4946 places, 8227/8227 transitions.
Applied a total of 0 rules in 502 ms. Remains 4946 /4946 variables (removed 0) and now considering 8227/8227 (removed 0) transitions.
[2024-05-25 13:11:44] [INFO ] Flow matrix only has 7627 transitions (discarded 600 similar events)
// Phase 1: matrix 7627 rows 4946 cols
[2024-05-25 13:11:44] [INFO ] Computed 1093 invariants in 195 ms
[2024-05-25 13:11:49] [INFO ] Implicit Places using invariants in 5269 ms returned []
[2024-05-25 13:11:49] [INFO ] Flow matrix only has 7627 transitions (discarded 600 similar events)
[2024-05-25 13:11:49] [INFO ] Invariant cache hit.
[2024-05-25 13:11:54] [INFO ] Implicit Places using invariants and state equation in 4773 ms returned []
Implicit Place search using SMT with State Equation took 10045 ms to find 0 implicit places.
[2024-05-25 13:11:54] [INFO ] Redundant transitions in 668 ms returned []
[2024-05-25 13:11:54] [INFO ] Flow matrix only has 7627 transitions (discarded 600 similar events)
[2024-05-25 13:11:54] [INFO ] Invariant cache hit.
[2024-05-25 13:11:59] [INFO ] Dead Transitions using invariants and state equation in 4998 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16225 ms. Remains : 4946/4946 places, 8227/8227 transitions.
Built C files in :
/tmp/ltsmin6190346147383561586
[2024-05-25 13:11:59] [INFO ] Too many transitions (8227) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:12:00] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6190346147383561586
Running compilation step : cd /tmp/ltsmin6190346147383561586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6190346147383561586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6190346147383561586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 13:12:04] [INFO ] Flatten gal took : 240 ms
[2024-05-25 13:12:04] [INFO ] Flatten gal took : 206 ms
[2024-05-25 13:12:04] [INFO ] Time to serialize gal into /tmp/LTL395737016965081674.gal : 70 ms
[2024-05-25 13:12:04] [INFO ] Time to serialize properties into /tmp/LTL4009472968493895018.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL395737016965081674.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11771699005025142321.hoa' '-atoms' '/tmp/LTL4009472968493895018.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4009472968493895018.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11771699005025142321.hoa
Detected timeout of ITS tools.
[2024-05-25 13:12:19] [INFO ] Flatten gal took : 213 ms
[2024-05-25 13:12:20] [INFO ] Flatten gal took : 208 ms
[2024-05-25 13:12:20] [INFO ] Time to serialize gal into /tmp/LTL18200342337313231785.gal : 40 ms
[2024-05-25 13:12:20] [INFO ] Time to serialize properties into /tmp/LTL10035351606089879094.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18200342337313231785.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10035351606089879094.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(((Node0AsksIsThereANodeMaster<1)||(Node23IsActive<1))||(Node23IsTheNodeMaster<1))"))))
Formula 0 simplified : FG!"(((Node0AsksIsThereANodeMaster<1)||(Node23IsActive<1))||(Node23IsTheNodeMaster<1))"
Detected timeout of ITS tools.
[2024-05-25 13:12:35] [INFO ] Flatten gal took : 194 ms
[2024-05-25 13:12:35] [INFO ] Applying decomposition
[2024-05-25 13:12:35] [INFO ] Flatten gal took : 219 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3753852741936239423.txt' '-o' '/tmp/graph3753852741936239423.bin' '-w' '/tmp/graph3753852741936239423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3753852741936239423.bin' '-l' '-1' '-v' '-w' '/tmp/graph3753852741936239423.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:12:36] [INFO ] Decomposing Gal with order
[2024-05-25 13:12:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:12:37] [INFO ] Removed a total of 6916 redundant transitions.
[2024-05-25 13:12:38] [INFO ] Flatten gal took : 1564 ms
[2024-05-25 13:12:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 5269 labels/synchronizations in 536 ms.
[2024-05-25 13:12:39] [INFO ] Time to serialize gal into /tmp/LTL1179720408835866630.gal : 241 ms
[2024-05-25 13:12:39] [INFO ] Time to serialize properties into /tmp/LTL16222211547219884592.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1179720408835866630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16222211547219884592.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i0.u1.Node0AsksIsThereANodeMaster<1)||(i0.u1.Node23IsActive<1))||(i0.u1.Node23IsTheNodeMaster<1))"))))
Formula 0 simplified : FG!"(((i0.u1.Node0AsksIsThereANodeMaster<1)||(i0.u1.Node23IsActive<1))||(i0.u1.Node23IsTheNodeMaster<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7848078813780873682
[2024-05-25 13:12:54] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7848078813780873682
Running compilation step : cd /tmp/ltsmin7848078813780873682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7848078813780873682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7848078813780873682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-02 finished in 267302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1||G(p2))))))'
Support contains 5 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4787 transitions
Trivial Post-agglo rules discarded 4787 transitions
Performed 4787 trivial Post agglomeration. Transition count delta: 4787
Iterating post reduction 0 with 4787 rules applied. Total rules applied 4787 place count 15136 transition count 17480
Reduce places removed 4787 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9586 place count 10349 transition count 17468
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17069
Deduced a syphon composed of 399 places in 12 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10396 place count 9938 transition count 17069
Discarding 4398 places :
Symmetric choice reduction at 3 with 4398 rule applications. Total rules 14794 place count 5540 transition count 12671
Iterating global reduction 3 with 4398 rules applied. Total rules applied 19192 place count 5540 transition count 12671
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 19192 place count 5540 transition count 12657
Deduced a syphon composed of 14 places in 8 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 19220 place count 5526 transition count 12657
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 19768 place count 4978 transition count 8273
Iterating global reduction 3 with 548 rules applied. Total rules applied 20316 place count 4978 transition count 8273
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20366 place count 4953 transition count 8248
Applied a total of 20366 rules in 2593 ms. Remains 4953 /15136 variables (removed 10183) and now considering 8248/22267 (removed 14019) transitions.
[2024-05-25 13:13:00] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
// Phase 1: matrix 7648 rows 4953 cols
[2024-05-25 13:13:00] [INFO ] Computed 1093 invariants in 193 ms
[2024-05-25 13:13:05] [INFO ] Implicit Places using invariants in 4760 ms returned []
[2024-05-25 13:13:05] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
[2024-05-25 13:13:05] [INFO ] Invariant cache hit.
[2024-05-25 13:13:08] [INFO ] Implicit Places using invariants and state equation in 3685 ms returned []
Implicit Place search using SMT with State Equation took 8446 ms to find 0 implicit places.
[2024-05-25 13:13:09] [INFO ] Redundant transitions in 1167 ms returned []
[2024-05-25 13:13:09] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
[2024-05-25 13:13:09] [INFO ] Invariant cache hit.
[2024-05-25 13:13:14] [INFO ] Dead Transitions using invariants and state equation in 4822 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4953/15136 places, 8248/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17039 ms. Remains : 4953/15136 places, 8248/22267 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s230 1) (GEQ s934 1)), p1:(LT s2165 1), p2:(AND (GEQ s3068 1) (GEQ s3138 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 58 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-03 finished in 17223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((p0&&F(!p1))) U !p1))))'
Support contains 3 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4799 transitions
Trivial Post-agglo rules discarded 4799 transitions
Performed 4799 trivial Post agglomeration. Transition count delta: 4799
Iterating post reduction 0 with 4799 rules applied. Total rules applied 4799 place count 15136 transition count 17468
Reduce places removed 4799 places and 0 transitions.
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17068
Deduced a syphon composed of 400 places in 12 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 10398 place count 9937 transition count 17068
Discarding 4399 places :
Symmetric choice reduction at 2 with 4399 rule applications. Total rules 14797 place count 5538 transition count 12669
Iterating global reduction 2 with 4399 rules applied. Total rules applied 19196 place count 5538 transition count 12669
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 19196 place count 5538 transition count 12654
Deduced a syphon composed of 15 places in 8 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 19226 place count 5523 transition count 12654
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 19775 place count 4974 transition count 8262
Iterating global reduction 2 with 549 rules applied. Total rules applied 20324 place count 4974 transition count 8262
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 20374 place count 4949 transition count 8237
Applied a total of 20374 rules in 2588 ms. Remains 4949 /15136 variables (removed 10187) and now considering 8237/22267 (removed 14030) transitions.
[2024-05-25 13:13:17] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4949 cols
[2024-05-25 13:13:17] [INFO ] Computed 1093 invariants in 188 ms
[2024-05-25 13:13:21] [INFO ] Implicit Places using invariants in 3868 ms returned []
[2024-05-25 13:13:21] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2024-05-25 13:13:21] [INFO ] Invariant cache hit.
[2024-05-25 13:13:26] [INFO ] Implicit Places using invariants and state equation in 5188 ms returned [2213]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9065 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4948/15136 places, 8237/22267 transitions.
Applied a total of 0 rules in 522 ms. Remains 4948 /4948 variables (removed 0) and now considering 8237/8237 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12175 ms. Remains : 4948/15136 places, 8237/22267 transitions.
Stuttering acceptance computed with spot in 152 ms :[p1, p1, p1, p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=p1, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s454 1) (GEQ s1933 1)), p0:(LT s2519 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1701 reset in 1244 ms.
Product exploration explored 100000 steps with 1701 reset in 1265 ms.
Computed a total of 2349 stabilizing places and 3061 stable transitions
Computed a total of 2349 stabilizing places and 3061 stable transitions
Detected a total of 2349/4948 stabilizing places and 3061/8237 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR (NOT p1) p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 145 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[p1, p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 170 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 13:13:30] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4948 cols
[2024-05-25 13:13:30] [INFO ] Computed 1092 invariants in 213 ms
[2024-05-25 13:13:31] [INFO ] [Real]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-05-25 13:13:31] [INFO ] [Real]Absence check using 49 positive and 1043 generalized place invariants in 284 ms returned sat
[2024-05-25 13:13:31] [INFO ] After 1027ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-25 13:13:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 81 ms returned sat
[2024-05-25 13:13:32] [INFO ] [Nat]Absence check using 49 positive and 1043 generalized place invariants in 296 ms returned sat
[2024-05-25 13:13:37] [INFO ] After 4635ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-25 13:13:37] [INFO ] State equation strengthened by 2959 read => feed constraints.
[2024-05-25 13:13:39] [INFO ] After 2091ms SMT Verify possible using 2959 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-25 13:13:45] [INFO ] Deduced a trap composed of 538 places in 5007 ms of which 6 ms to minimize.
[2024-05-25 13:13:50] [INFO ] Deduced a trap composed of 422 places in 4986 ms of which 5 ms to minimize.
[2024-05-25 13:13:55] [INFO ] Deduced a trap composed of 429 places in 5019 ms of which 4 ms to minimize.
[2024-05-25 13:13:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 16138 ms
[2024-05-25 13:13:56] [INFO ] After 18856ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 409 ms.
[2024-05-25 13:13:57] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 4948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4948/4948 places, 8237/8237 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 4948 transition count 11743
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 4611 transition count 11743
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 4611 transition count 11743
Applied a total of 699 rules in 1881 ms. Remains 4611 /4948 variables (removed 337) and now considering 11743/8237 (removed -3506) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1881 ms. Remains : 4611/4948 places, 11743/8237 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 20939 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20939 steps, saw 9698 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 13:14:02] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4611 cols
[2024-05-25 13:14:02] [INFO ] Computed 1092 invariants in 250 ms
[2024-05-25 13:14:03] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2024-05-25 13:14:03] [INFO ] [Real]Absence check using 49 positive and 1043 generalized place invariants in 269 ms returned sat
[2024-05-25 13:14:03] [INFO ] After 931ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 13:14:04] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-05-25 13:14:04] [INFO ] [Nat]Absence check using 49 positive and 1043 generalized place invariants in 285 ms returned sat
[2024-05-25 13:14:10] [INFO ] After 5267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 13:14:10] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 13:14:22] [INFO ] After 11859ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:14:27] [INFO ] Deduced a trap composed of 401 places in 5624 ms of which 5 ms to minimize.
[2024-05-25 13:14:34] [INFO ] Deduced a trap composed of 341 places in 6000 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 13:14:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 13:14:34] [INFO ] After 30430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 4611 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4611/4611 places, 11743/11743 transitions.
Applied a total of 0 rules in 616 ms. Remains 4611 /4611 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 616 ms. Remains : 4611/4611 places, 11743/11743 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4611/4611 places, 11743/11743 transitions.
Applied a total of 0 rules in 633 ms. Remains 4611 /4611 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
[2024-05-25 13:14:35] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
[2024-05-25 13:14:35] [INFO ] Invariant cache hit.
[2024-05-25 13:14:40] [INFO ] Implicit Places using invariants in 4523 ms returned []
Implicit Place search using SMT only with invariants took 4524 ms to find 0 implicit places.
[2024-05-25 13:14:40] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
[2024-05-25 13:14:40] [INFO ] Invariant cache hit.
[2024-05-25 13:14:46] [INFO ] Dead Transitions using invariants and state equation in 6427 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11592 ms. Remains : 4611/4611 places, 11743/11743 transitions.
Graph (trivial) has 3428 edges and 4611 vertex of which 25 / 4611 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 39539 edges and 4587 vertex of which 4566 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.14 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t9361.t11089 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4180 transition count 10014
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3938 transition count 9533
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3697 transition count 9093
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3457 transition count 8695
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3257 transition count 8335
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3059 transition count 8013
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2897 transition count 7725
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2737 transition count 7471
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2609 transition count 7247
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2483 transition count 7053
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2385 transition count 6885
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2289 transition count 6743
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2217 transition count 6623
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2147 transition count 6525
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 14 with 129 rules applied. Total rules applied 5896 place count 2097 transition count 6446
Ensure Unique test removed 16 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 15 with 107 rules applied. Total rules applied 6003 place count 2050 transition count 6386
Ensure Unique test removed 2 places
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 78 rules applied. Total rules applied 6081 place count 2019 transition count 6339
Ensure Unique test removed 11 places
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 63 rules applied. Total rules applied 6144 place count 1990 transition count 6305
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 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 18 with 42 rules applied. Total rules applied 6186 place count 1972 transition count 6281
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 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 19 with 30 rules applied. Total rules applied 6216 place count 1956 transition count 6267
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6232 place count 1948 transition count 6259
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6241 place count 1942 transition count 6256
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6245 place count 1939 transition count 6255
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 400 Pre rules applied. Total rules applied 6245 place count 1939 transition count 5855
Deduced a syphon composed of 400 places in 1 ms
Ensure Unique test removed 399 places
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 23 with 1199 rules applied. Total rules applied 7444 place count 1140 transition count 5855
Discarding 407 places :
Symmetric choice reduction at 23 with 407 rule applications. Total rules 7851 place count 733 transition count 5448
Iterating global reduction 23 with 407 rules applied. Total rules applied 8258 place count 733 transition count 5448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8258 place count 733 transition count 5447
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8260 place count 732 transition count 5447
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 8800 place count 192 transition count 1127
Iterating global reduction 23 with 540 rules applied. Total rules applied 9340 place count 192 transition count 1127
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 9880 place count 192 transition count 587
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9931 place count 166 transition count 562
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 24 with 16 rules applied. Total rules applied 9947 place count 166 transition count 546
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 24 with 16 rules applied. Total rules applied 9963 place count 150 transition count 546
Discarding 21 places :
Symmetric choice reduction at 25 with 21 rule applications. Total rules 9984 place count 129 transition count 378
Ensure Unique test removed 11 places
Iterating global reduction 25 with 32 rules applied. Total rules applied 10016 place count 118 transition count 378
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 25 with 21 rules applied. Total rules applied 10037 place count 118 transition count 357
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10048 place count 107 transition count 269
Iterating global reduction 26 with 11 rules applied. Total rules applied 10059 place count 107 transition count 269
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10070 place count 96 transition count 258
Iterating global reduction 26 with 11 rules applied. Total rules applied 10081 place count 96 transition count 258
Applied a total of 10081 rules in 6945 ms. Remains 96 /4611 variables (removed 4515) and now considering 258/11743 (removed 11485) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 258 rows 96 cols
[2024-05-25 13:14:53] [INFO ] Computed 34 invariants in 8 ms
[2024-05-25 13:14:53] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 13:14:53] [INFO ] [Real]Absence check using 5 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-25 13:14:53] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 13:14:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-25 13:14:53] [INFO ] [Nat]Absence check using 5 positive and 29 generalized place invariants in 4 ms returned sat
[2024-05-25 13:14:53] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 13:14:53] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-25 13:14:53] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR (NOT p1) p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 235 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 500 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 153 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 4948 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4948/4948 places, 8237/8237 transitions.
Applied a total of 0 rules in 507 ms. Remains 4948 /4948 variables (removed 0) and now considering 8237/8237 (removed 0) transitions.
[2024-05-25 13:14:55] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4948 cols
[2024-05-25 13:14:55] [INFO ] Computed 1092 invariants in 194 ms
[2024-05-25 13:14:59] [INFO ] Implicit Places using invariants in 3948 ms returned []
[2024-05-25 13:14:59] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2024-05-25 13:14:59] [INFO ] Invariant cache hit.
[2024-05-25 13:15:02] [INFO ] Implicit Places using invariants and state equation in 3638 ms returned []
Implicit Place search using SMT with State Equation took 7588 ms to find 0 implicit places.
[2024-05-25 13:15:03] [INFO ] Redundant transitions in 963 ms returned []
[2024-05-25 13:15:03] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2024-05-25 13:15:03] [INFO ] Invariant cache hit.
[2024-05-25 13:15:08] [INFO ] Dead Transitions using invariants and state equation in 5028 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14097 ms. Remains : 4948/4948 places, 8237/8237 transitions.
Computed a total of 2349 stabilizing places and 3061 stable transitions
Computed a total of 2349 stabilizing places and 3061 stable transitions
Detected a total of 2349/4948 stabilizing places and 3061/8237 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 154 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[p1, p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 170 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 23780 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{4=1, 5=1}
Probabilistic random walk after 23780 steps, saw 11190 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :2
Running SMT prover for 4 properties.
[2024-05-25 13:15:12] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2024-05-25 13:15:12] [INFO ] Invariant cache hit.
[2024-05-25 13:15:13] [INFO ] [Real]Absence check using 49 positive place invariants in 80 ms returned sat
[2024-05-25 13:15:13] [INFO ] [Real]Absence check using 49 positive and 1043 generalized place invariants in 285 ms returned sat
[2024-05-25 13:15:13] [INFO ] After 1009ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-25 13:15:14] [INFO ] [Nat]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 13:15:14] [INFO ] [Nat]Absence check using 49 positive and 1043 generalized place invariants in 321 ms returned sat
[2024-05-25 13:15:21] [INFO ] After 6933ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-25 13:15:21] [INFO ] State equation strengthened by 2959 read => feed constraints.
[2024-05-25 13:15:23] [INFO ] After 2015ms SMT Verify possible using 2959 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-25 13:15:29] [INFO ] Deduced a trap composed of 538 places in 5018 ms of which 5 ms to minimize.
[2024-05-25 13:15:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5578 ms
[2024-05-25 13:15:29] [INFO ] After 8211ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 527 ms.
[2024-05-25 13:15:30] [INFO ] After 16842ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 4948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4948/4948 places, 8237/8237 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 4948 transition count 11743
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 4611 transition count 11743
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 4611 transition count 11743
Applied a total of 699 rules in 1956 ms. Remains 4611 /4948 variables (removed 337) and now considering 11743/8237 (removed -3506) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1956 ms. Remains : 4611/4948 places, 11743/8237 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 595 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 20665 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20665 steps, saw 9574 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 13:15:36] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4611 cols
[2024-05-25 13:15:36] [INFO ] Computed 1092 invariants in 271 ms
[2024-05-25 13:15:37] [INFO ] [Real]Absence check using 49 positive place invariants in 83 ms returned sat
[2024-05-25 13:15:37] [INFO ] [Real]Absence check using 49 positive and 1043 generalized place invariants in 281 ms returned sat
[2024-05-25 13:15:37] [INFO ] After 1047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 13:15:38] [INFO ] [Nat]Absence check using 49 positive place invariants in 85 ms returned sat
[2024-05-25 13:15:38] [INFO ] [Nat]Absence check using 49 positive and 1043 generalized place invariants in 288 ms returned sat
[2024-05-25 13:15:45] [INFO ] After 6601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 13:15:45] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 13:16:02] [INFO ] After 17279ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:16:02] [INFO ] After 17346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-25 13:16:02] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 4611 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4611/4611 places, 11743/11743 transitions.
Applied a total of 0 rules in 718 ms. Remains 4611 /4611 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 718 ms. Remains : 4611/4611 places, 11743/11743 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4611/4611 places, 11743/11743 transitions.
Applied a total of 0 rules in 701 ms. Remains 4611 /4611 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
[2024-05-25 13:16:04] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
[2024-05-25 13:16:04] [INFO ] Invariant cache hit.
[2024-05-25 13:16:08] [INFO ] Implicit Places using invariants in 4727 ms returned []
Implicit Place search using SMT only with invariants took 4729 ms to find 0 implicit places.
[2024-05-25 13:16:08] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
[2024-05-25 13:16:08] [INFO ] Invariant cache hit.
[2024-05-25 13:16:15] [INFO ] Dead Transitions using invariants and state equation in 6659 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12091 ms. Remains : 4611/4611 places, 11743/11743 transitions.
Graph (trivial) has 3428 edges and 4611 vertex of which 25 / 4611 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 39539 edges and 4587 vertex of which 4566 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.5 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t9361.t11089 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4180 transition count 10014
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3938 transition count 9533
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3697 transition count 9093
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3457 transition count 8695
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3257 transition count 8335
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3059 transition count 8013
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2897 transition count 7725
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2737 transition count 7471
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2609 transition count 7247
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2483 transition count 7053
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2385 transition count 6885
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2289 transition count 6743
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2217 transition count 6623
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2147 transition count 6525
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 14 with 129 rules applied. Total rules applied 5896 place count 2097 transition count 6446
Ensure Unique test removed 16 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 15 with 107 rules applied. Total rules applied 6003 place count 2050 transition count 6386
Ensure Unique test removed 2 places
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 78 rules applied. Total rules applied 6081 place count 2019 transition count 6339
Ensure Unique test removed 11 places
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 63 rules applied. Total rules applied 6144 place count 1990 transition count 6305
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 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 18 with 42 rules applied. Total rules applied 6186 place count 1972 transition count 6281
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 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 19 with 30 rules applied. Total rules applied 6216 place count 1956 transition count 6267
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6232 place count 1948 transition count 6259
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6241 place count 1942 transition count 6256
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6245 place count 1939 transition count 6255
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 400 Pre rules applied. Total rules applied 6245 place count 1939 transition count 5855
Deduced a syphon composed of 400 places in 1 ms
Ensure Unique test removed 399 places
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 23 with 1199 rules applied. Total rules applied 7444 place count 1140 transition count 5855
Discarding 407 places :
Symmetric choice reduction at 23 with 407 rule applications. Total rules 7851 place count 733 transition count 5448
Iterating global reduction 23 with 407 rules applied. Total rules applied 8258 place count 733 transition count 5448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8258 place count 733 transition count 5447
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8260 place count 732 transition count 5447
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 8800 place count 192 transition count 1127
Iterating global reduction 23 with 540 rules applied. Total rules applied 9340 place count 192 transition count 1127
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 9880 place count 192 transition count 587
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9931 place count 166 transition count 562
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 24 with 16 rules applied. Total rules applied 9947 place count 166 transition count 546
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 24 with 16 rules applied. Total rules applied 9963 place count 150 transition count 546
Discarding 21 places :
Symmetric choice reduction at 25 with 21 rule applications. Total rules 9984 place count 129 transition count 378
Ensure Unique test removed 11 places
Iterating global reduction 25 with 32 rules applied. Total rules applied 10016 place count 118 transition count 378
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 25 with 21 rules applied. Total rules applied 10037 place count 118 transition count 357
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10048 place count 107 transition count 269
Iterating global reduction 26 with 11 rules applied. Total rules applied 10059 place count 107 transition count 269
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10070 place count 96 transition count 258
Iterating global reduction 26 with 11 rules applied. Total rules applied 10081 place count 96 transition count 258
Applied a total of 10081 rules in 6784 ms. Remains 96 /4611 variables (removed 4515) and now considering 258/11743 (removed 11485) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 258 rows 96 cols
[2024-05-25 13:16:22] [INFO ] Computed 34 invariants in 6 ms
[2024-05-25 13:16:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 13:16:22] [INFO ] [Real]Absence check using 5 positive and 29 generalized place invariants in 4 ms returned sat
[2024-05-25 13:16:22] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 13:16:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 13:16:22] [INFO ] [Nat]Absence check using 5 positive and 29 generalized place invariants in 4 ms returned sat
[2024-05-25 13:16:22] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 13:16:22] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-25 13:16:22] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 2981 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 171 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 196 ms :[p1, p1, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 1700 reset in 1471 ms.
Product exploration explored 100000 steps with 1701 reset in 1499 ms.
Built C files in :
/tmp/ltsmin7485110901363167619
[2024-05-25 13:16:28] [INFO ] Too many transitions (8237) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:16:29] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7485110901363167619
Running compilation step : cd /tmp/ltsmin7485110901363167619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7485110901363167619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7485110901363167619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 4948 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4948/4948 places, 8237/8237 transitions.
Applied a total of 0 rules in 517 ms. Remains 4948 /4948 variables (removed 0) and now considering 8237/8237 (removed 0) transitions.
[2024-05-25 13:16:32] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4948 cols
[2024-05-25 13:16:32] [INFO ] Computed 1092 invariants in 230 ms
[2024-05-25 13:16:36] [INFO ] Implicit Places using invariants in 4027 ms returned []
[2024-05-25 13:16:36] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2024-05-25 13:16:36] [INFO ] Invariant cache hit.
[2024-05-25 13:16:40] [INFO ] Implicit Places using invariants and state equation in 4038 ms returned []
Implicit Place search using SMT with State Equation took 8066 ms to find 0 implicit places.
[2024-05-25 13:16:41] [INFO ] Redundant transitions in 974 ms returned []
[2024-05-25 13:16:41] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2024-05-25 13:16:41] [INFO ] Invariant cache hit.
[2024-05-25 13:16:46] [INFO ] Dead Transitions using invariants and state equation in 4828 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14399 ms. Remains : 4948/4948 places, 8237/8237 transitions.
Built C files in :
/tmp/ltsmin7340693251068866461
[2024-05-25 13:16:46] [INFO ] Too many transitions (8237) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:16:46] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7340693251068866461
Running compilation step : cd /tmp/ltsmin7340693251068866461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7340693251068866461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7340693251068866461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 13:16:50] [INFO ] Flatten gal took : 220 ms
[2024-05-25 13:16:50] [INFO ] Flatten gal took : 220 ms
[2024-05-25 13:16:50] [INFO ] Time to serialize gal into /tmp/LTL17385159808340380122.gal : 39 ms
[2024-05-25 13:16:50] [INFO ] Time to serialize properties into /tmp/LTL14589152148152058249.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17385159808340380122.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15235465259670207650.hoa' '-atoms' '/tmp/LTL14589152148152058249.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14589152148152058249.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15235465259670207650.hoa
Detected timeout of ITS tools.
[2024-05-25 13:17:05] [INFO ] Flatten gal took : 202 ms
[2024-05-25 13:17:06] [INFO ] Flatten gal took : 209 ms
[2024-05-25 13:17:06] [INFO ] Time to serialize gal into /tmp/LTL5959676783810285053.gal : 435 ms
[2024-05-25 13:17:06] [INFO ] Time to serialize properties into /tmp/LTL3105932540761504460.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5959676783810285053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3105932540761504460.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((G(("(Node15HasTheLeafSetOfLx1ToReplaceNode9<1)")&&(F(!("((Node1ThinksNode9ShouldBeNodeMasterToReplaceNode10>=1)&&(NodesCanDete...295
Formula 0 simplified : GF(F(!"(Node15HasTheLeafSetOfLx1ToReplaceNode9<1)" | G"((Node1ThinksNode9ShouldBeNodeMasterToReplaceNode10>=1)&&(NodesCanDetectThatN...278
Detected timeout of ITS tools.
[2024-05-25 13:17:21] [INFO ] Flatten gal took : 208 ms
[2024-05-25 13:17:21] [INFO ] Applying decomposition
[2024-05-25 13:17:21] [INFO ] Flatten gal took : 221 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6372174087723897981.txt' '-o' '/tmp/graph6372174087723897981.bin' '-w' '/tmp/graph6372174087723897981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6372174087723897981.bin' '-l' '-1' '-v' '-w' '/tmp/graph6372174087723897981.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:17:22] [INFO ] Decomposing Gal with order
[2024-05-25 13:17:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:17:23] [INFO ] Removed a total of 7046 redundant transitions.
[2024-05-25 13:17:24] [INFO ] Flatten gal took : 1310 ms
[2024-05-25 13:17:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 3692 labels/synchronizations in 361 ms.
[2024-05-25 13:17:24] [INFO ] Time to serialize gal into /tmp/LTL7220106425438706632.gal : 51 ms
[2024-05-25 13:17:24] [INFO ] Time to serialize properties into /tmp/LTL6875175862405595351.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7220106425438706632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6875175862405595351.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((G(("(i31.u386.Node15HasTheLeafSetOfLx1ToReplaceNode9<1)")&&(F(!("((i10.u36.Node1ThinksNode9ShouldBeNodeMasterToReplaceNode10>=...338
Formula 0 simplified : GF(F(!"(i31.u386.Node15HasTheLeafSetOfLx1ToReplaceNode9<1)" | G"((i10.u36.Node1ThinksNode9ShouldBeNodeMasterToReplaceNode10>=1)&&(i2...321
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9473507737439918047
[2024-05-25 13:17:40] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9473507737439918047
Running compilation step : cd /tmp/ltsmin9473507737439918047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9473507737439918047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9473507737439918047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04 finished in 268071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&X(X(X(F(!p1)))))) U G(p0)))'
Support contains 4 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 427 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2024-05-25 13:17:43] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2024-05-25 13:17:45] [INFO ] Computed 1093 invariants in 1516 ms
[2024-05-25 13:17:46] [INFO ] Implicit Places using invariants in 2887 ms returned []
Implicit Place search using SMT only with invariants took 2892 ms to find 0 implicit places.
[2024-05-25 13:17:46] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2024-05-25 13:17:46] [INFO ] Invariant cache hit.
[2024-05-25 13:17:47] [INFO ] Dead Transitions using invariants and state equation in 1249 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4584 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 670 ms :[(NOT p0), (OR (NOT p0) p1), (NOT p0), (NOT p0), p1, p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s5083 1) (GEQ s5561 1)), p1:(AND (GEQ s504 1) (GEQ s11290 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05 finished in 5336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((G(p0) U X(p1))||G(!p2)||(!p2&&F(!p0)))))'
Support contains 5 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 419 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2024-05-25 13:17:48] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2024-05-25 13:17:48] [INFO ] Invariant cache hit.
[2024-05-25 13:17:50] [INFO ] Implicit Places using invariants in 1212 ms returned []
Implicit Place search using SMT only with invariants took 1216 ms to find 0 implicit places.
[2024-05-25 13:17:50] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2024-05-25 13:17:50] [INFO ] Invariant cache hit.
[2024-05-25 13:17:51] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2828 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (NOT p1), (AND p0 (NOT p1) p2), (NOT p1), true, (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s5907 1), p2:(AND (GEQ s2022 1) (GEQ s15119 1)), p1:(AND (GEQ s7671 1) (GEQ s8080 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06 finished in 3235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((F(p1)&&F(G(p2))))))'
Support contains 5 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4787 transitions
Trivial Post-agglo rules discarded 4787 transitions
Performed 4787 trivial Post agglomeration. Transition count delta: 4787
Iterating post reduction 0 with 4787 rules applied. Total rules applied 4787 place count 15136 transition count 17480
Reduce places removed 4787 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9586 place count 10349 transition count 17468
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17069
Deduced a syphon composed of 399 places in 13 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10396 place count 9938 transition count 17069
Discarding 4398 places :
Symmetric choice reduction at 3 with 4398 rule applications. Total rules 14794 place count 5540 transition count 12671
Iterating global reduction 3 with 4398 rules applied. Total rules applied 19192 place count 5540 transition count 12671
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 19192 place count 5540 transition count 12657
Deduced a syphon composed of 14 places in 8 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 19220 place count 5526 transition count 12657
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 19767 place count 4979 transition count 8281
Iterating global reduction 3 with 547 rules applied. Total rules applied 20314 place count 4979 transition count 8281
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20364 place count 4954 transition count 8256
Applied a total of 20364 rules in 2629 ms. Remains 4954 /15136 variables (removed 10182) and now considering 8256/22267 (removed 14011) transitions.
[2024-05-25 13:17:54] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
// Phase 1: matrix 7656 rows 4954 cols
[2024-05-25 13:17:54] [INFO ] Computed 1093 invariants in 194 ms
[2024-05-25 13:17:58] [INFO ] Implicit Places using invariants in 3994 ms returned []
[2024-05-25 13:17:58] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2024-05-25 13:17:58] [INFO ] Invariant cache hit.
[2024-05-25 13:18:03] [INFO ] Implicit Places using invariants and state equation in 4920 ms returned []
Implicit Place search using SMT with State Equation took 8916 ms to find 0 implicit places.
[2024-05-25 13:18:04] [INFO ] Redundant transitions in 1006 ms returned []
[2024-05-25 13:18:04] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2024-05-25 13:18:04] [INFO ] Invariant cache hit.
[2024-05-25 13:18:09] [INFO ] Dead Transitions using invariants and state equation in 5190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4954/15136 places, 8256/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17747 ms. Remains : 4954/15136 places, 8256/22267 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s2371 1), p1:(AND (GEQ s1780 1) (GEQ s4843 1)), p2:(AND (GEQ s1145 1) (GEQ s1152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1674 reset in 1307 ms.
Product exploration explored 100000 steps with 1674 reset in 1283 ms.
Computed a total of 2355 stabilizing places and 3080 stable transitions
Computed a total of 2355 stabilizing places and 3080 stable transitions
Detected a total of 2355/4954 stabilizing places and 3080/8256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 515 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 166 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-25 13:18:13] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2024-05-25 13:18:13] [INFO ] Invariant cache hit.
[2024-05-25 13:18:13] [INFO ] [Real]Absence check using 49 positive place invariants in 75 ms returned sat
[2024-05-25 13:18:14] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 316 ms returned sat
[2024-05-25 13:18:14] [INFO ] After 854ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 11 factoid took 1054 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 4954 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Applied a total of 0 rules in 497 ms. Remains 4954 /4954 variables (removed 0) and now considering 8256/8256 (removed 0) transitions.
[2024-05-25 13:18:15] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2024-05-25 13:18:15] [INFO ] Invariant cache hit.
[2024-05-25 13:18:20] [INFO ] Implicit Places using invariants in 5032 ms returned []
[2024-05-25 13:18:20] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2024-05-25 13:18:20] [INFO ] Invariant cache hit.
[2024-05-25 13:18:25] [INFO ] Implicit Places using invariants and state equation in 4957 ms returned []
Implicit Place search using SMT with State Equation took 9995 ms to find 0 implicit places.
[2024-05-25 13:18:26] [INFO ] Redundant transitions in 995 ms returned []
[2024-05-25 13:18:26] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2024-05-25 13:18:26] [INFO ] Invariant cache hit.
[2024-05-25 13:18:31] [INFO ] Dead Transitions using invariants and state equation in 5136 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16639 ms. Remains : 4954/4954 places, 8256/8256 transitions.
Computed a total of 2355 stabilizing places and 3080 stable transitions
Computed a total of 2355 stabilizing places and 3080 stable transitions
Detected a total of 2355/4954 stabilizing places and 3080/8256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 167 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25161 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25161 steps, saw 11806 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:18:35] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2024-05-25 13:18:35] [INFO ] Invariant cache hit.
[2024-05-25 13:18:35] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2024-05-25 13:18:36] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 294 ms returned sat
[2024-05-25 13:18:36] [INFO ] After 891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:18:36] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2024-05-25 13:18:37] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 299 ms returned sat
[2024-05-25 13:18:41] [INFO ] After 4603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:18:41] [INFO ] State equation strengthened by 2973 read => feed constraints.
[2024-05-25 13:18:43] [INFO ] After 1402ms SMT Verify possible using 2973 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:18:48] [INFO ] Deduced a trap composed of 684 places in 5114 ms of which 6 ms to minimize.
[2024-05-25 13:18:53] [INFO ] Deduced a trap composed of 368 places in 5114 ms of which 5 ms to minimize.
[2024-05-25 13:18:59] [INFO ] Deduced a trap composed of 547 places in 4957 ms of which 6 ms to minimize.
[2024-05-25 13:19:04] [INFO ] Deduced a trap composed of 486 places in 4961 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 13:19:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 13:19:04] [INFO ] After 28480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 4954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4954 transition count 8255
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4953 transition count 8255
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 4951 transition count 8246
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4951 transition count 8246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 4951 transition count 8245
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4950 transition count 8245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 4949 transition count 8237
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 4949 transition count 8237
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 347 place count 4949 transition count 11743
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 684 place count 4612 transition count 11743
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 709 place count 4612 transition count 11743
Applied a total of 709 rules in 2779 ms. Remains 4612 /4954 variables (removed 342) and now considering 11743/8256 (removed -3487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2779 ms. Remains : 4612/4954 places, 11743/8256 transitions.
Finished random walk after 5998 steps, including 121 resets, run visited all 1 properties in 279 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1673 reset in 1379 ms.
Product exploration explored 100000 steps with 1675 reset in 1338 ms.
Built C files in :
/tmp/ltsmin12589142193537953293
[2024-05-25 13:19:10] [INFO ] Too many transitions (8256) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:19:11] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12589142193537953293
Running compilation step : cd /tmp/ltsmin12589142193537953293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12589142193537953293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12589142193537953293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 4954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4954 transition count 8255
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4953 transition count 8255
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 4951 transition count 8246
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4951 transition count 8246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 4951 transition count 8245
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4950 transition count 8245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 4949 transition count 8237
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 4949 transition count 8237
Applied a total of 10 rules in 1330 ms. Remains 4949 /4954 variables (removed 5) and now considering 8237/8256 (removed 19) transitions.
[2024-05-25 13:19:15] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4949 cols
[2024-05-25 13:19:15] [INFO ] Computed 1093 invariants in 210 ms
[2024-05-25 13:19:19] [INFO ] Implicit Places using invariants in 3953 ms returned []
[2024-05-25 13:19:19] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2024-05-25 13:19:19] [INFO ] Invariant cache hit.
[2024-05-25 13:19:23] [INFO ] Implicit Places using invariants and state equation in 3717 ms returned []
Implicit Place search using SMT with State Equation took 7672 ms to find 0 implicit places.
[2024-05-25 13:19:23] [INFO ] Redundant transitions in 944 ms returned []
[2024-05-25 13:19:23] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2024-05-25 13:19:23] [INFO ] Invariant cache hit.
[2024-05-25 13:19:28] [INFO ] Dead Transitions using invariants and state equation in 4813 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4949/4954 places, 8237/8256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14771 ms. Remains : 4949/4954 places, 8237/8256 transitions.
Built C files in :
/tmp/ltsmin13048979532482369750
[2024-05-25 13:19:28] [INFO ] Too many transitions (8237) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:19:28] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13048979532482369750
Running compilation step : cd /tmp/ltsmin13048979532482369750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13048979532482369750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13048979532482369750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 13:19:32] [INFO ] Flatten gal took : 218 ms
[2024-05-25 13:19:32] [INFO ] Flatten gal took : 237 ms
[2024-05-25 13:19:32] [INFO ] Time to serialize gal into /tmp/LTL1512121268994994566.gal : 44 ms
[2024-05-25 13:19:32] [INFO ] Time to serialize properties into /tmp/LTL12532443399412868580.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1512121268994994566.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9317835682546705362.hoa' '-atoms' '/tmp/LTL12532443399412868580.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12532443399412868580.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9317835682546705362.hoa
Detected timeout of ITS tools.
[2024-05-25 13:19:48] [INFO ] Flatten gal took : 196 ms
[2024-05-25 13:19:48] [INFO ] Flatten gal took : 203 ms
[2024-05-25 13:19:48] [INFO ] Time to serialize gal into /tmp/LTL3053433230868109421.gal : 36 ms
[2024-05-25 13:19:48] [INFO ] Time to serialize properties into /tmp/LTL13667265653970975256.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3053433230868109421.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13667265653970975256.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("(Node13HasTheLeafSetOfRx1ToReplaceNode20<1)")))||(G((F("((Node7ManageTheCrashOfNode15>=1)&&(Rx3IsAtTheRightExtremityOfTheLeaf...264
Formula 0 simplified : FG!"(Node13HasTheLeafSetOfRx1ToReplaceNode20<1)" & F(G!"((Node7ManageTheCrashOfNode15>=1)&&(Rx3IsAtTheRightExtremityOfTheLeafSet>=1)...248
Detected timeout of ITS tools.
[2024-05-25 13:20:03] [INFO ] Flatten gal took : 203 ms
[2024-05-25 13:20:03] [INFO ] Applying decomposition
[2024-05-25 13:20:03] [INFO ] Flatten gal took : 215 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9890930701595079676.txt' '-o' '/tmp/graph9890930701595079676.bin' '-w' '/tmp/graph9890930701595079676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9890930701595079676.bin' '-l' '-1' '-v' '-w' '/tmp/graph9890930701595079676.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:20:04] [INFO ] Decomposing Gal with order
[2024-05-25 13:20:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:20:05] [INFO ] Removed a total of 6936 redundant transitions.
[2024-05-25 13:20:06] [INFO ] Flatten gal took : 1200 ms
[2024-05-25 13:20:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 4747 labels/synchronizations in 381 ms.
[2024-05-25 13:20:06] [INFO ] Time to serialize gal into /tmp/LTL14474622129031772721.gal : 57 ms
[2024-05-25 13:20:06] [INFO ] Time to serialize properties into /tmp/LTL10871361084108743404.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14474622129031772721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10871361084108743404.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i25.u400.Node13HasTheLeafSetOfRx1ToReplaceNode20<1)")))||(G((F("((i23.u396.Node7ManageTheCrashOfNode15>=1)&&(i23.u395.Rx3IsA...309
Formula 0 simplified : FG!"(i25.u400.Node13HasTheLeafSetOfRx1ToReplaceNode20<1)" & F(G!"((i23.u396.Node7ManageTheCrashOfNode15>=1)&&(i23.u395.Rx3IsAtTheRig...293
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8047965867192791919
[2024-05-25 13:20:21] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8047965867192791919
Running compilation step : cd /tmp/ltsmin8047965867192791919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8047965867192791919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8047965867192791919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-07 finished in 153319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!F(p0)) U p1))'
Support contains 4 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 429 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2024-05-25 13:20:25] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2024-05-25 13:20:26] [INFO ] Computed 1093 invariants in 1483 ms
[2024-05-25 13:20:28] [INFO ] Implicit Places using invariants in 2710 ms returned []
Implicit Place search using SMT only with invariants took 2711 ms to find 0 implicit places.
[2024-05-25 13:20:28] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2024-05-25 13:20:28] [INFO ] Invariant cache hit.
[2024-05-25 13:20:29] [INFO ] Dead Transitions using invariants and state equation in 1228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4375 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 145 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s13811 1) (GEQ s15011 1)), p1:(AND (GEQ s4539 1) (GEQ s12273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-08 finished in 4602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 447 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2024-05-25 13:20:29] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2024-05-25 13:20:30] [INFO ] Invariant cache hit.
[2024-05-25 13:20:31] [INFO ] Implicit Places using invariants in 1225 ms returned []
Implicit Place search using SMT only with invariants took 1225 ms to find 0 implicit places.
[2024-05-25 13:20:31] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2024-05-25 13:20:31] [INFO ] Invariant cache hit.
[2024-05-25 13:20:32] [INFO ] Dead Transitions using invariants and state equation in 1222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2896 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s8237 1) (GEQ s8568 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 finished in 3085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4799 transitions
Trivial Post-agglo rules discarded 4799 transitions
Performed 4799 trivial Post agglomeration. Transition count delta: 4799
Iterating post reduction 0 with 4799 rules applied. Total rules applied 4799 place count 15136 transition count 17468
Reduce places removed 4799 places and 0 transitions.
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17068
Deduced a syphon composed of 400 places in 13 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 10398 place count 9937 transition count 17068
Discarding 4399 places :
Symmetric choice reduction at 2 with 4399 rule applications. Total rules 14797 place count 5538 transition count 12669
Iterating global reduction 2 with 4399 rules applied. Total rules applied 19196 place count 5538 transition count 12669
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 19196 place count 5538 transition count 12654
Deduced a syphon composed of 15 places in 9 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 19226 place count 5523 transition count 12654
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 19775 place count 4974 transition count 8262
Iterating global reduction 2 with 549 rules applied. Total rules applied 20324 place count 4974 transition count 8262
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 20374 place count 4949 transition count 8237
Applied a total of 20374 rules in 2697 ms. Remains 4949 /15136 variables (removed 10187) and now considering 8237/22267 (removed 14030) transitions.
[2024-05-25 13:20:35] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4949 cols
[2024-05-25 13:20:35] [INFO ] Computed 1093 invariants in 198 ms
[2024-05-25 13:20:40] [INFO ] Implicit Places using invariants in 5537 ms returned []
[2024-05-25 13:20:40] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2024-05-25 13:20:40] [INFO ] Invariant cache hit.
[2024-05-25 13:20:44] [INFO ] Implicit Places using invariants and state equation in 4026 ms returned []
Implicit Place search using SMT with State Equation took 9565 ms to find 0 implicit places.
[2024-05-25 13:20:45] [INFO ] Redundant transitions in 702 ms returned []
[2024-05-25 13:20:45] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2024-05-25 13:20:45] [INFO ] Invariant cache hit.
[2024-05-25 13:20:50] [INFO ] Dead Transitions using invariants and state equation in 5032 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4949/15136 places, 8237/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18006 ms. Remains : 4949/15136 places, 8237/22267 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2419 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 61 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-12 finished in 18082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 424 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2024-05-25 13:20:51] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2024-05-25 13:20:52] [INFO ] Computed 1093 invariants in 1466 ms
[2024-05-25 13:20:53] [INFO ] Implicit Places using invariants in 2707 ms returned []
Implicit Place search using SMT only with invariants took 2718 ms to find 0 implicit places.
[2024-05-25 13:20:53] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2024-05-25 13:20:53] [INFO ] Invariant cache hit.
[2024-05-25 13:20:55] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4302 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s2 1) (GEQ s11236 1) (GEQ s11238 1) (GEQ s14687 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13 finished in 4479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4787 transitions
Trivial Post-agglo rules discarded 4787 transitions
Performed 4787 trivial Post agglomeration. Transition count delta: 4787
Iterating post reduction 0 with 4787 rules applied. Total rules applied 4787 place count 15136 transition count 17480
Reduce places removed 4787 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9586 place count 10349 transition count 17468
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17069
Deduced a syphon composed of 399 places in 13 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10396 place count 9938 transition count 17069
Discarding 4398 places :
Symmetric choice reduction at 3 with 4398 rule applications. Total rules 14794 place count 5540 transition count 12671
Iterating global reduction 3 with 4398 rules applied. Total rules applied 19192 place count 5540 transition count 12671
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 19192 place count 5540 transition count 12657
Deduced a syphon composed of 14 places in 7 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 19220 place count 5526 transition count 12657
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 19768 place count 4978 transition count 8273
Iterating global reduction 3 with 548 rules applied. Total rules applied 20316 place count 4978 transition count 8273
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20366 place count 4953 transition count 8248
Applied a total of 20366 rules in 2603 ms. Remains 4953 /15136 variables (removed 10183) and now considering 8248/22267 (removed 14019) transitions.
[2024-05-25 13:20:57] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
// Phase 1: matrix 7648 rows 4953 cols
[2024-05-25 13:20:57] [INFO ] Computed 1093 invariants in 203 ms
[2024-05-25 13:21:01] [INFO ] Implicit Places using invariants in 3913 ms returned []
[2024-05-25 13:21:01] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
[2024-05-25 13:21:01] [INFO ] Invariant cache hit.
[2024-05-25 13:21:05] [INFO ] Implicit Places using invariants and state equation in 3656 ms returned []
Implicit Place search using SMT with State Equation took 7571 ms to find 0 implicit places.
[2024-05-25 13:21:06] [INFO ] Redundant transitions in 671 ms returned []
[2024-05-25 13:21:06] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
[2024-05-25 13:21:06] [INFO ] Invariant cache hit.
[2024-05-25 13:21:10] [INFO ] Dead Transitions using invariants and state equation in 4810 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4953/15136 places, 8248/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15661 ms. Remains : 4953/15136 places, 8248/22267 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-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:(OR (GEQ s1858 1) (AND (GEQ s4279 1) (GEQ s4505 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 58 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14 finished in 15739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 433 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2024-05-25 13:21:11] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2024-05-25 13:21:12] [INFO ] Computed 1093 invariants in 1438 ms
[2024-05-25 13:21:13] [INFO ] Implicit Places using invariants in 2611 ms returned []
Implicit Place search using SMT only with invariants took 2623 ms to find 0 implicit places.
[2024-05-25 13:21:13] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2024-05-25 13:21:13] [INFO ] Invariant cache hit.
[2024-05-25 13:21:15] [INFO ] Dead Transitions using invariants and state equation in 1179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4237 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15 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 (GEQ s4849 1) (GEQ s5596 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15 finished in 4425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((p0&&F(!p1))) U !p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((F(p1)&&F(G(p2))))))'
[2024-05-25 13:21:16] [INFO ] Flatten gal took : 533 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14170906000476508673
[2024-05-25 13:21:16] [INFO ] Too many transitions (22267) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:21:16] [INFO ] Built C files in 209ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14170906000476508673
Running compilation step : cd /tmp/ltsmin14170906000476508673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 13:21:16] [INFO ] Applying decomposition
[2024-05-25 13:21:17] [INFO ] Flatten gal took : 555 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15063082647770924744.txt' '-o' '/tmp/graph15063082647770924744.bin' '-w' '/tmp/graph15063082647770924744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15063082647770924744.bin' '-l' '-1' '-v' '-w' '/tmp/graph15063082647770924744.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:21:18] [INFO ] Decomposing Gal with order
[2024-05-25 13:21:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:21:23] [INFO ] Removed a total of 14344 redundant transitions.
[2024-05-25 13:21:23] [INFO ] Flatten gal took : 2261 ms
[2024-05-25 13:21:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1580 labels/synchronizations in 400 ms.
[2024-05-25 13:21:24] [INFO ] Time to serialize gal into /tmp/LTLFireability13059780925806460152.gal : 139 ms
[2024-05-25 13:21:24] [INFO ] Time to serialize properties into /tmp/LTLFireability3873642462852196532.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13059780925806460152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3873642462852196532.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G(F("(((i0.u0.Node0AsksIsThereANodeMaster<1)||(i0.u0.Node23IsActive<1))||(i0.u0.Node23IsTheNodeMaster<1))"))))
Formula 0 simplified : FG!"(((i0.u0.Node0AsksIsThereANodeMaster<1)||(i0.u0.Node23IsActive<1))||(i0.u0.Node23IsTheNodeMaster<1))"
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14170906000476508673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 240 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14170906000476508673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 240 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-25 13:46:47] [INFO ] Flatten gal took : 1422 ms
[2024-05-25 13:46:48] [INFO ] Time to serialize gal into /tmp/LTLFireability12949843758971060311.gal : 94 ms
[2024-05-25 13:46:48] [INFO ] Time to serialize properties into /tmp/LTLFireability8865331444897106103.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12949843758971060311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8865331444897106103.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((G(F("(((Node0AsksIsThereANodeMaster<1)||(Node23IsActive<1))||(Node23IsTheNodeMaster<1))"))))
Formula 0 simplified : FG!"(((Node0AsksIsThereANodeMaster<1)||(Node23IsActive<1))||(Node23IsTheNodeMaster<1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 136628 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16261952 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="MultiCrashLeafsetExtension-PT-S24C08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S24C08, 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 r263-tall-171654372000068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C08.tgz
mv MultiCrashLeafsetExtension-PT-S24C08 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 '
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 ;