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-171654372000083.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-S24C11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372000083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 12 06:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 06:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 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 19M 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-S24C11-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716649617968

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-S24C11
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:06:59] [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 15:06:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:07:00] [INFO ] Load time of PNML (sax parser for PT used): 649 ms
[2024-05-25 15:07:00] [INFO ] Transformed 19254 places.
[2024-05-25 15:07:00] [INFO ] Transformed 27973 transitions.
[2024-05-25 15:07:00] [INFO ] Parsed PT model containing 19254 places and 27973 transitions and 103022 arcs in 843 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 19254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19254/19254 places, 27973/27973 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 19204 transition count 27973
Applied a total of 50 rules in 775 ms. Remains 19204 /19254 variables (removed 50) and now considering 27973/27973 (removed 0) transitions.
[2024-05-25 15:07:01] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2024-05-25 15:07:04] [INFO ] Computed 1249 invariants in 2636 ms
[2024-05-25 15:07:06] [INFO ] Implicit Places using invariants in 4346 ms returned []
Implicit Place search using SMT only with invariants took 4549 ms to find 0 implicit places.
[2024-05-25 15:07:06] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:07:06] [INFO ] Invariant cache hit.
[2024-05-25 15:07:07] [INFO ] Dead Transitions using invariants and state equation in 1621 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19204/19254 places, 27973/27973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6957 ms. Remains : 19204/19254 places, 27973/27973 transitions.
Support contains 47 out of 19204 places after structural reductions.
[2024-05-25 15:07:09] [INFO ] Flatten gal took : 1066 ms
[2024-05-25 15:07:09] [INFO ] Flatten gal took : 782 ms
[2024-05-25 15:07:11] [INFO ] Input system was already deterministic with 27973 transitions.
Support contains 43 out of 19204 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 22) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) 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 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 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 14 ms. (steps per millisecond=71 ) 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 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 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 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 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 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 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 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 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 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-25 15:07:12] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:07:12] [INFO ] Invariant cache hit.
[2024-05-25 15:07:18] [INFO ] [Real]Absence check using 47 positive place invariants in 227 ms returned sat
[2024-05-25 15:07:19] [INFO ] [Real]Absence check using 47 positive and 1202 generalized place invariants in 748 ms returned sat
[2024-05-25 15:07:37] [INFO ] After 14033ms SMT Verify possible using state equation in real domain returned unsat :1 sat :16
[2024-05-25 15:07:37] [INFO ] State equation strengthened by 8602 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
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 15:07:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:07:37] [INFO ] After 25144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 19204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6503 transitions
Trivial Post-agglo rules discarded 6503 transitions
Performed 6503 trivial Post agglomeration. Transition count delta: 6503
Iterating post reduction 0 with 6503 rules applied. Total rules applied 6503 place count 19204 transition count 21470
Reduce places removed 6503 places and 0 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 1 with 6599 rules applied. Total rules applied 13102 place count 12701 transition count 21374
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 13198 place count 12605 transition count 21374
Performed 542 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 542 Pre rules applied. Total rules applied 13198 place count 12605 transition count 20832
Deduced a syphon composed of 542 places in 38 ms
Reduce places removed 542 places and 0 transitions.
Iterating global reduction 3 with 1084 rules applied. Total rules applied 14282 place count 12063 transition count 20832
Discarding 6041 places :
Symmetric choice reduction at 3 with 6041 rule applications. Total rules 20323 place count 6022 transition count 14791
Iterating global reduction 3 with 6041 rules applied. Total rules applied 26364 place count 6022 transition count 14791
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 26364 place count 6022 transition count 14776
Deduced a syphon composed of 15 places in 17 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 26394 place count 6007 transition count 14776
Discarding 540 places :
Symmetric choice reduction at 3 with 540 rule applications. Total rules 26934 place count 5467 transition count 8836
Iterating global reduction 3 with 540 rules applied. Total rules applied 27474 place count 5467 transition count 8836
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 10 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27524 place count 5442 transition count 8811
Free-agglomeration rule (complex) applied 345 times.
Iterating global reduction 3 with 345 rules applied. Total rules applied 27869 place count 5442 transition count 13866
Reduce places removed 345 places and 0 transitions.
Iterating post reduction 3 with 345 rules applied. Total rules applied 28214 place count 5097 transition count 13866
Partial Free-agglomeration rule applied 167 times.
Drop transitions removed 167 transitions
Iterating global reduction 4 with 167 rules applied. Total rules applied 28381 place count 5097 transition count 13866
Applied a total of 28381 rules in 6210 ms. Remains 5097 /19204 variables (removed 14107) and now considering 13866/27973 (removed 14107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6211 ms. Remains : 5097/19204 places, 13866/27973 transitions.
Incomplete random walk after 10000 steps, including 146 resets, run finished after 777 ms. (steps per millisecond=12 ) properties (out of 17) seen :3
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-05-25 15:07:46] [INFO ] Flow matrix only has 12980 transitions (discarded 886 similar events)
// Phase 1: matrix 12980 rows 5097 cols
[2024-05-25 15:07:46] [INFO ] Computed 1249 invariants in 342 ms
[2024-05-25 15:07:48] [INFO ] [Real]Absence check using 49 positive place invariants in 81 ms returned sat
[2024-05-25 15:07:48] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 319 ms returned sat
[2024-05-25 15:08:00] [INFO ] After 13761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-25 15:08:01] [INFO ] [Nat]Absence check using 49 positive place invariants in 85 ms returned sat
[2024-05-25 15:08:02] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 335 ms returned sat
[2024-05-25 15:08:14] [INFO ] After 11652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-25 15:08:14] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:08:25] [INFO ] After 10691ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-25 15:08:25] [INFO ] After 10692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-25 15:08:25] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 171 ms.
Support contains 22 out of 5097 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5097/5097 places, 13866/13866 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 5097 transition count 13863
Deduced a syphon composed of 3 places in 14 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 5094 transition count 13863
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 5091 transition count 13860
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 5091 transition count 13860
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 12 place count 5091 transition count 13857
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 5088 transition count 13857
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 5088 transition count 13856
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 5087 transition count 13856
Applied a total of 20 rules in 2050 ms. Remains 5087 /5097 variables (removed 10) and now considering 13856/13866 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2050 ms. Remains : 5087/5097 places, 13856/13866 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 740 ms. (steps per millisecond=13 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 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 20 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 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 20 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 20 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 36496 steps, run timeout after 6001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 36496 steps, saw 16719 distinct states, run finished after 6002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 13 properties.
[2024-05-25 15:08:36] [INFO ] Flow matrix only has 12970 transitions (discarded 886 similar events)
// Phase 1: matrix 12970 rows 5087 cols
[2024-05-25 15:08:36] [INFO ] Computed 1249 invariants in 341 ms
[2024-05-25 15:08:37] [INFO ] [Real]Absence check using 49 positive place invariants in 79 ms returned sat
[2024-05-25 15:08:38] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 312 ms returned sat
[2024-05-25 15:08:50] [INFO ] After 11907ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:11
[2024-05-25 15:08:51] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:08:53] [INFO ] After 2220ms SMT Verify possible using 8602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-25 15:08:53] [INFO ] After 16824ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-25 15:08:54] [INFO ] [Nat]Absence check using 49 positive place invariants in 78 ms returned sat
[2024-05-25 15:08:54] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 323 ms returned sat
[2024-05-25 15:09:08] [INFO ] After 12575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-25 15:09:18] [INFO ] After 9985ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-25 15:09:18] [INFO ] After 9986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-25 15:09:18] [INFO ] After 25063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 22 out of 5087 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5087/5087 places, 13856/13856 transitions.
Applied a total of 0 rules in 816 ms. Remains 5087 /5087 variables (removed 0) and now considering 13856/13856 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 816 ms. Remains : 5087/5087 places, 13856/13856 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5087/5087 places, 13856/13856 transitions.
Applied a total of 0 rules in 798 ms. Remains 5087 /5087 variables (removed 0) and now considering 13856/13856 (removed 0) transitions.
[2024-05-25 15:09:19] [INFO ] Flow matrix only has 12970 transitions (discarded 886 similar events)
[2024-05-25 15:09:19] [INFO ] Invariant cache hit.
[2024-05-25 15:09:24] [INFO ] Implicit Places using invariants in 4646 ms returned []
Implicit Place search using SMT only with invariants took 4648 ms to find 0 implicit places.
[2024-05-25 15:09:24] [INFO ] Flow matrix only has 12970 transitions (discarded 886 similar events)
[2024-05-25 15:09:24] [INFO ] Invariant cache hit.
[2024-05-25 15:09:32] [INFO ] Dead Transitions using invariants and state equation in 8063 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13512 ms. Remains : 5087/5087 places, 13856/13856 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16580 stabilizing places and 22772 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p0&&F(G((p0||F(p1))))))))'
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6600 transitions
Trivial Post-agglo rules discarded 6600 transitions
Performed 6600 trivial Post agglomeration. Transition count delta: 6600
Iterating post reduction 0 with 6600 rules applied. Total rules applied 6600 place count 19204 transition count 21373
Reduce places removed 6600 places and 0 transitions.
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 29 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 2 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6050 places :
Symmetric choice reduction at 2 with 6050 rule applications. Total rules 20350 place count 6004 transition count 14773
Iterating global reduction 2 with 6050 rules applied. Total rules applied 26400 place count 6004 transition count 14773
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 26400 place count 6004 transition count 14751
Deduced a syphon composed of 22 places in 16 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 26444 place count 5982 transition count 14751
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 26993 place count 5433 transition count 8712
Iterating global reduction 2 with 549 rules applied. Total rules applied 27542 place count 5433 transition count 8712
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 27592 place count 5408 transition count 8687
Applied a total of 27592 rules in 3359 ms. Remains 5408 /19204 variables (removed 13796) and now considering 8687/27973 (removed 19286) transitions.
[2024-05-25 15:09:36] [INFO ] Flow matrix only has 8087 transitions (discarded 600 similar events)
// Phase 1: matrix 8087 rows 5408 cols
[2024-05-25 15:09:36] [INFO ] Computed 1249 invariants in 239 ms
[2024-05-25 15:09:40] [INFO ] Implicit Places using invariants in 4457 ms returned []
[2024-05-25 15:09:40] [INFO ] Flow matrix only has 8087 transitions (discarded 600 similar events)
[2024-05-25 15:09:40] [INFO ] Invariant cache hit.
[2024-05-25 15:09:45] [INFO ] Implicit Places using invariants and state equation in 4273 ms returned []
Implicit Place search using SMT with State Equation took 8732 ms to find 0 implicit places.
[2024-05-25 15:09:46] [INFO ] Redundant transitions in 1322 ms returned []
[2024-05-25 15:09:46] [INFO ] Flow matrix only has 8087 transitions (discarded 600 similar events)
[2024-05-25 15:09:46] [INFO ] Invariant cache hit.
[2024-05-25 15:09:51] [INFO ] Dead Transitions using invariants and state equation in 5246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5408/19204 places, 8687/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18665 ms. Remains : 5408/19204 places, 8687/27973 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 342 ms :[p0, p0, false, false]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3390 1) (GEQ s3891 1)), p1:(AND (GEQ s3803 1) (GEQ s5218 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 1263 reset in 1194 ms.
Product exploration explored 100000 steps with 1264 reset in 1139 ms.
Computed a total of 2809 stabilizing places and 3511 stable transitions
Computed a total of 2809 stabilizing places and 3511 stable transitions
Detected a total of 2809/5408 stabilizing places and 3511/8687 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 132 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[false, false, false, false, false]
Incomplete random walk after 10000 steps, including 126 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 22831 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22831 steps, saw 10866 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:09:58] [INFO ] Flow matrix only has 8087 transitions (discarded 600 similar events)
[2024-05-25 15:09:58] [INFO ] Invariant cache hit.
[2024-05-25 15:09:58] [INFO ] [Real]Absence check using 49 positive place invariants in 81 ms returned sat
[2024-05-25 15:09:59] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 354 ms returned sat
[2024-05-25 15:09:59] [INFO ] After 1224ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-25 15:10:00] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2024-05-25 15:10:00] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 328 ms returned sat
[2024-05-25 15:10:06] [INFO ] After 6310ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-25 15:10:07] [INFO ] State equation strengthened by 3112 read => feed constraints.
[2024-05-25 15:10:14] [INFO ] After 7110ms SMT Verify possible using 3112 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-25 15:10:20] [INFO ] Deduced a trap composed of 684 places in 6066 ms of which 16 ms to minimize.
[2024-05-25 15:10:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6590 ms
[2024-05-25 15:10:27] [INFO ] Deduced a trap composed of 527 places in 6037 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 15:10:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:10:27] [INFO ] After 28364ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 5408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5408/5408 places, 8687/8687 transitions.
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 336 place count 5408 transition count 13841
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 672 place count 5072 transition count 13841
Applied a total of 672 rules in 1473 ms. Remains 5072 /5408 variables (removed 336) and now considering 13841/8687 (removed -5154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1475 ms. Remains : 5072/5408 places, 13841/8687 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 638 ms. (steps per millisecond=15 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:10:29] [INFO ] Flow matrix only has 12955 transitions (discarded 886 similar events)
// Phase 1: matrix 12955 rows 5072 cols
[2024-05-25 15:10:30] [INFO ] Computed 1249 invariants in 341 ms
[2024-05-25 15:10:30] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2024-05-25 15:10:31] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 330 ms returned sat
[2024-05-25 15:10:40] [INFO ] After 9693ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:10:40] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2024-05-25 15:10:40] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 336 ms returned sat
[2024-05-25 15:10:51] [INFO ] After 10530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:10:51] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:11:01] [INFO ] After 9802ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 15:11:01] [INFO ] After 21383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 5072 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5072/5072 places, 13841/13841 transitions.
Applied a total of 0 rules in 841 ms. Remains 5072 /5072 variables (removed 0) and now considering 13841/13841 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 842 ms. Remains : 5072/5072 places, 13841/13841 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 20016 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20016 steps, saw 9401 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:11:05] [INFO ] Flow matrix only has 12955 transitions (discarded 886 similar events)
[2024-05-25 15:11:05] [INFO ] Invariant cache hit.
[2024-05-25 15:11:06] [INFO ] [Real]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-05-25 15:11:06] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 333 ms returned sat
[2024-05-25 15:11:14] [INFO ] After 8613ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:11:15] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2024-05-25 15:11:15] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 335 ms returned sat
[2024-05-25 15:11:24] [INFO ] After 8701ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:11:24] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:11:30] [INFO ] After 5983ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:11:40] [INFO ] Deduced a trap composed of 730 places in 7044 ms of which 7 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 15:11:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:11:40] [INFO ] After 25737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 5072 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5072/5072 places, 13841/13841 transitions.
Applied a total of 0 rules in 806 ms. Remains 5072 /5072 variables (removed 0) and now considering 13841/13841 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 806 ms. Remains : 5072/5072 places, 13841/13841 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5072/5072 places, 13841/13841 transitions.
Applied a total of 0 rules in 827 ms. Remains 5072 /5072 variables (removed 0) and now considering 13841/13841 (removed 0) transitions.
[2024-05-25 15:11:41] [INFO ] Flow matrix only has 12955 transitions (discarded 886 similar events)
[2024-05-25 15:11:41] [INFO ] Invariant cache hit.
[2024-05-25 15:11:47] [INFO ] Implicit Places using invariants in 5498 ms returned []
Implicit Place search using SMT only with invariants took 5499 ms to find 0 implicit places.
[2024-05-25 15:11:47] [INFO ] Flow matrix only has 12955 transitions (discarded 886 similar events)
[2024-05-25 15:11:47] [INFO ] Invariant cache hit.
[2024-05-25 15:11:55] [INFO ] Dead Transitions using invariants and state equation in 7905 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14233 ms. Remains : 5072/5072 places, 13841/13841 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 385 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[false, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[false, false, false, false]
Support contains 4 out of 5408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5408/5408 places, 8687/8687 transitions.
Applied a total of 0 rules in 556 ms. Remains 5408 /5408 variables (removed 0) and now considering 8687/8687 (removed 0) transitions.
[2024-05-25 15:11:56] [INFO ] Flow matrix only has 8087 transitions (discarded 600 similar events)
// Phase 1: matrix 8087 rows 5408 cols
[2024-05-25 15:11:56] [INFO ] Computed 1249 invariants in 235 ms
[2024-05-25 15:12:00] [INFO ] Implicit Places using invariants in 4127 ms returned []
[2024-05-25 15:12:00] [INFO ] Flow matrix only has 8087 transitions (discarded 600 similar events)
[2024-05-25 15:12:00] [INFO ] Invariant cache hit.
[2024-05-25 15:12:04] [INFO ] Implicit Places using invariants and state equation in 4210 ms returned []
Implicit Place search using SMT with State Equation took 8340 ms to find 0 implicit places.
[2024-05-25 15:12:05] [INFO ] Redundant transitions in 1018 ms returned []
[2024-05-25 15:12:05] [INFO ] Flow matrix only has 8087 transitions (discarded 600 similar events)
[2024-05-25 15:12:05] [INFO ] Invariant cache hit.
[2024-05-25 15:12:11] [INFO ] Dead Transitions using invariants and state equation in 5276 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15202 ms. Remains : 5408/5408 places, 8687/8687 transitions.
Computed a total of 2809 stabilizing places and 3511 stable transitions
Computed a total of 2809 stabilizing places and 3511 stable transitions
Detected a total of 2809/5408 stabilizing places and 3511/8687 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[false, false, false, false]
Incomplete random walk after 10000 steps, including 126 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:12:11] [INFO ] Flow matrix only has 8087 transitions (discarded 600 similar events)
[2024-05-25 15:12:11] [INFO ] Invariant cache hit.
[2024-05-25 15:12:12] [INFO ] [Real]Absence check using 49 positive place invariants in 74 ms returned sat
[2024-05-25 15:12:12] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 340 ms returned sat
[2024-05-25 15:12:17] [INFO ] After 5662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:12:18] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2024-05-25 15:12:18] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 339 ms returned sat
[2024-05-25 15:12:23] [INFO ] After 4730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:12:23] [INFO ] State equation strengthened by 3112 read => feed constraints.
[2024-05-25 15:12:30] [INFO ] After 7422ms SMT Verify possible using 3112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:12:36] [INFO ] Deduced a trap composed of 944 places in 6059 ms of which 6 ms to minimize.
[2024-05-25 15:12:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6583 ms
[2024-05-25 15:12:37] [INFO ] After 14171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 263 ms.
[2024-05-25 15:12:37] [INFO ] After 20168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5408/5408 places, 8687/8687 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5407 transition count 8676
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5407 transition count 8676
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 338 place count 5407 transition count 13840
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 674 place count 5071 transition count 13840
Applied a total of 674 rules in 1899 ms. Remains 5071 /5408 variables (removed 337) and now considering 13840/8687 (removed -5153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1900 ms. Remains : 5071/5408 places, 13840/8687 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 21802 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21802 steps, saw 10200 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:12:43] [INFO ] Flow matrix only has 12954 transitions (discarded 886 similar events)
// Phase 1: matrix 12954 rows 5071 cols
[2024-05-25 15:12:43] [INFO ] Computed 1249 invariants in 340 ms
[2024-05-25 15:12:44] [INFO ] [Real]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-05-25 15:12:44] [INFO ] [Real]Absence check using 47 positive and 1202 generalized place invariants in 329 ms returned sat
[2024-05-25 15:12:50] [INFO ] After 6646ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:12:50] [INFO ] [Nat]Absence check using 47 positive place invariants in 54 ms returned sat
[2024-05-25 15:12:51] [INFO ] [Nat]Absence check using 47 positive and 1202 generalized place invariants in 333 ms returned sat
[2024-05-25 15:12:58] [INFO ] After 7089ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:12:58] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:13:07] [INFO ] After 9663ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 15:13:07] [INFO ] After 17762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 5071 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5071/5071 places, 13840/13840 transitions.
Applied a total of 0 rules in 799 ms. Remains 5071 /5071 variables (removed 0) and now considering 13840/13840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 799 ms. Remains : 5071/5071 places, 13840/13840 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5071/5071 places, 13840/13840 transitions.
Applied a total of 0 rules in 796 ms. Remains 5071 /5071 variables (removed 0) and now considering 13840/13840 (removed 0) transitions.
[2024-05-25 15:13:09] [INFO ] Flow matrix only has 12954 transitions (discarded 886 similar events)
[2024-05-25 15:13:09] [INFO ] Invariant cache hit.
[2024-05-25 15:13:16] [INFO ] Implicit Places using invariants in 6842 ms returned []
Implicit Place search using SMT only with invariants took 6844 ms to find 0 implicit places.
[2024-05-25 15:13:16] [INFO ] Flow matrix only has 12954 transitions (discarded 886 similar events)
[2024-05-25 15:13:16] [INFO ] Invariant cache hit.
[2024-05-25 15:13:24] [INFO ] Dead Transitions using invariants and state equation in 8179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15821 ms. Remains : 5071/5071 places, 13840/13840 transitions.
Graph (trivial) has 3577 edges and 5071 vertex of which 25 / 5071 are part of one of the 1 SCC in 12 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 51795 edges and 5047 vertex of which 5025 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.7 ms
Discarding 22 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 t11620.t13897 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 4639 transition count 12111
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 4397 transition count 11630
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 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 2 with 680 rules applied. Total rules applied 1648 place count 4156 transition count 11191
Ensure Unique test removed 40 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 635 rules applied. Total rules applied 2283 place count 3917 transition count 10795
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 4 with 557 rules applied. Total rules applied 2840 place count 3718 transition count 10437
Ensure Unique test removed 36 places
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 161 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 5 with 517 rules applied. Total rules applied 3357 place count 3521 transition count 10117
Ensure Unique test removed 2 places
Reduce places removed 161 places and 0 transitions.
Drop transitions removed 31 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 159 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 448 rules applied. Total rules applied 3805 place count 3360 transition count 9830
Ensure Unique test removed 31 places
Reduce places removed 159 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 413 rules applied. Total rules applied 4218 place count 3201 transition count 9576
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 4570 place count 3073 transition count 9352
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 4890 place count 2947 transition count 9158
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 5156 place count 2849 transition count 8990
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 5394 place count 2753 transition count 8848
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 5586 place count 2681 transition count 8728
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 5754 place count 2611 transition count 8630
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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5884 place count 2561 transition count 8550
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 5994 place count 2513 transition count 8488
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 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 80 rules applied. Total rules applied 6074 place count 2481 transition count 8440
Ensure Unique test removed 12 places
Reduce places removed 30 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 64 rules applied. Total rules applied 6138 place count 2451 transition count 8406
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 6180 place count 2433 transition count 8382
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 6210 place count 2417 transition count 8368
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 6226 place count 2409 transition count 8360
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 6235 place count 2403 transition count 8357
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 6239 place count 2400 transition count 8356
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6239 place count 2400 transition count 7806
Deduced a syphon composed of 550 places in 3 ms
Ensure Unique test removed 550 places
Reduce places removed 1100 places and 0 transitions.
Iterating global reduction 23 with 1650 rules applied. Total rules applied 7889 place count 1300 transition count 7806
Discarding 552 places :
Symmetric choice reduction at 23 with 552 rule applications. Total rules 8441 place count 748 transition count 7254
Iterating global reduction 23 with 552 rules applied. Total rules applied 8993 place count 748 transition count 7254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8993 place count 748 transition count 7253
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8995 place count 747 transition count 7253
Discarding 551 places :
Symmetric choice reduction at 23 with 551 rule applications. Total rules 9546 place count 196 transition count 1192
Iterating global reduction 23 with 551 rules applied. Total rules applied 10097 place count 196 transition count 1192
Ensure Unique test removed 551 transitions
Reduce isomorphic transitions removed 551 transitions.
Iterating post reduction 23 with 551 rules applied. Total rules applied 10648 place count 196 transition count 641
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 24 with 54 rules applied. Total rules applied 10702 place count 168 transition count 615
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 10703 place count 168 transition count 614
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 25 with 1 rules applied. Total rules applied 10704 place count 168 transition count 613
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 25 with 23 rules applied. Total rules applied 10727 place count 168 transition count 590
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 25 with 23 rules applied. Total rules applied 10750 place count 145 transition count 590
Discarding 22 places :
Symmetric choice reduction at 26 with 22 rule applications. Total rules 10772 place count 123 transition count 348
Ensure Unique test removed 21 places
Iterating global reduction 26 with 43 rules applied. Total rules applied 10815 place count 102 transition count 348
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 26 with 22 rules applied. Total rules applied 10837 place count 102 transition count 326
Discarding 21 places :
Symmetric choice reduction at 27 with 21 rule applications. Total rules 10858 place count 81 transition count 95
Iterating global reduction 27 with 21 rules applied. Total rules applied 10879 place count 81 transition count 95
Discarding 20 places :
Symmetric choice reduction at 27 with 20 rule applications. Total rules 10899 place count 61 transition count 75
Iterating global reduction 27 with 20 rules applied. Total rules applied 10919 place count 61 transition count 75
Applied a total of 10919 rules in 8948 ms. Remains 61 /5071 variables (removed 5010) and now considering 75/13840 (removed 13765) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 61 cols
[2024-05-25 15:13:33] [INFO ] Computed 28 invariants in 3 ms
[2024-05-25 15:13:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 15:13:33] [INFO ] [Real]Absence check using 4 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-25 15:13:33] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:13:33] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 15:13:33] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 197 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[false, false, false, false]
Stuttering acceptance computed with spot in 170 ms :[false, false, false, false]
Stuttering acceptance computed with spot in 140 ms :[false, false, false, false]
Product exploration explored 100000 steps with 1262 reset in 1065 ms.
Product exploration explored 100000 steps with 1262 reset in 1099 ms.
Built C files in :
/tmp/ltsmin6730391237337002100
[2024-05-25 15:13:36] [INFO ] Too many transitions (8687) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:13:36] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6730391237337002100
Running compilation step : cd /tmp/ltsmin6730391237337002100;'/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/ltsmin6730391237337002100;'/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/ltsmin6730391237337002100;'/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 4 out of 5408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5408/5408 places, 8687/8687 transitions.
Applied a total of 0 rules in 536 ms. Remains 5408 /5408 variables (removed 0) and now considering 8687/8687 (removed 0) transitions.
[2024-05-25 15:13:40] [INFO ] Flow matrix only has 8087 transitions (discarded 600 similar events)
// Phase 1: matrix 8087 rows 5408 cols
[2024-05-25 15:13:40] [INFO ] Computed 1249 invariants in 252 ms
[2024-05-25 15:13:44] [INFO ] Implicit Places using invariants in 4215 ms returned []
[2024-05-25 15:13:44] [INFO ] Flow matrix only has 8087 transitions (discarded 600 similar events)
[2024-05-25 15:13:44] [INFO ] Invariant cache hit.
[2024-05-25 15:13:48] [INFO ] Implicit Places using invariants and state equation in 4076 ms returned []
Implicit Place search using SMT with State Equation took 8292 ms to find 0 implicit places.
[2024-05-25 15:13:49] [INFO ] Redundant transitions in 732 ms returned []
[2024-05-25 15:13:49] [INFO ] Flow matrix only has 8087 transitions (discarded 600 similar events)
[2024-05-25 15:13:49] [INFO ] Invariant cache hit.
[2024-05-25 15:13:54] [INFO ] Dead Transitions using invariants and state equation in 4885 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14459 ms. Remains : 5408/5408 places, 8687/8687 transitions.
Built C files in :
/tmp/ltsmin8746710211727424099
[2024-05-25 15:13:54] [INFO ] Too many transitions (8687) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:13:54] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8746710211727424099
Running compilation step : cd /tmp/ltsmin8746710211727424099;'/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/ltsmin8746710211727424099;'/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/ltsmin8746710211727424099;'/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 15:13:58] [INFO ] Flatten gal took : 261 ms
[2024-05-25 15:13:58] [INFO ] Flatten gal took : 232 ms
[2024-05-25 15:13:58] [INFO ] Time to serialize gal into /tmp/LTL7683487261893078937.gal : 85 ms
[2024-05-25 15:13:58] [INFO ] Time to serialize properties into /tmp/LTL18250468991365765416.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/LTL7683487261893078937.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4980779349148688892.hoa' '-atoms' '/tmp/LTL18250468991365765416.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/LTL18250468991365765416.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4980779349148688892.hoa
Detected timeout of ITS tools.
[2024-05-25 15:14:14] [INFO ] Flatten gal took : 211 ms
[2024-05-25 15:14:14] [INFO ] Flatten gal took : 219 ms
[2024-05-25 15:14:14] [INFO ] Time to serialize gal into /tmp/LTL4270981783222505294.gal : 41 ms
[2024-05-25 15:14:14] [INFO ] Time to serialize properties into /tmp/LTL1550608217206517852.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/LTL4270981783222505294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1550608217206517852.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("((Node20NotifyThatHeIsActive<1)||(Node22ThinksNode20ShouldBeNodeMasterToReplaceNode6<1))"))||((F(G(("((Node20NotifyThatHeIsAc...411
Formula 0 simplified : G(F!"((Node20NotifyThatHeIsActive<1)||(Node22ThinksNode20ShouldBeNodeMasterToReplaceNode6<1))" & (!"((Node20NotifyThatHeIsActive<1)|...400
Detected timeout of ITS tools.
[2024-05-25 15:14:29] [INFO ] Flatten gal took : 214 ms
[2024-05-25 15:14:29] [INFO ] Applying decomposition
[2024-05-25 15:14:29] [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/graph15895962278396432520.txt' '-o' '/tmp/graph15895962278396432520.bin' '-w' '/tmp/graph15895962278396432520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15895962278396432520.bin' '-l' '-1' '-v' '-w' '/tmp/graph15895962278396432520.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:14:30] [INFO ] Decomposing Gal with order
[2024-05-25 15:14:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:14:32] [INFO ] Removed a total of 7469 redundant transitions.
[2024-05-25 15:14:32] [INFO ] Flatten gal took : 1722 ms
[2024-05-25 15:14:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 5057 labels/synchronizations in 537 ms.
[2024-05-25 15:14:34] [INFO ] Time to serialize gal into /tmp/LTL5588265272633434288.gal : 84 ms
[2024-05-25 15:14:34] [INFO ] Time to serialize properties into /tmp/LTL17512798107105271958.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/LTL5588265272633434288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17512798107105271958.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 : !((F((G("((i7.i7.u249.Node20NotifyThatHeIsActive<1)||(i16.u293.Node22ThinksNode20ShouldBeNodeMasterToReplaceNode6<1))"))||((F(G(("((i7...493
Formula 0 simplified : G(F!"((i7.i7.u249.Node20NotifyThatHeIsActive<1)||(i16.u293.Node22ThinksNode20ShouldBeNodeMasterToReplaceNode6<1))" & (!"((i7.i7.u249...482
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9140148069128606535
[2024-05-25 15:14:49] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9140148069128606535
Running compilation step : cd /tmp/ltsmin9140148069128606535;'/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/ltsmin9140148069128606535;'/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/ltsmin9140148069128606535;'/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-S24C11-LTLFireability-00 finished in 319307 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((G(p1) U p2))))'
Support contains 6 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6576 transitions
Trivial Post-agglo rules discarded 6576 transitions
Performed 6576 trivial Post agglomeration. Transition count delta: 6576
Iterating post reduction 0 with 6576 rules applied. Total rules applied 6576 place count 19204 transition count 21397
Reduce places removed 6576 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13176 place count 12628 transition count 21373
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 548 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 548 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20825
Deduced a syphon composed of 548 places in 62 ms
Reduce places removed 548 places and 0 transitions.
Iterating global reduction 3 with 1096 rules applied. Total rules applied 14296 place count 12056 transition count 20825
Discarding 6048 places :
Symmetric choice reduction at 3 with 6048 rule applications. Total rules 20344 place count 6008 transition count 14777
Iterating global reduction 3 with 6048 rules applied. Total rules applied 26392 place count 6008 transition count 14777
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 26392 place count 6008 transition count 14757
Deduced a syphon composed of 20 places in 16 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 26432 place count 5988 transition count 14757
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 26980 place count 5440 transition count 8729
Iterating global reduction 3 with 548 rules applied. Total rules applied 27528 place count 5440 transition count 8729
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27578 place count 5415 transition count 8704
Applied a total of 27578 rules in 3191 ms. Remains 5415 /19204 variables (removed 13789) and now considering 8704/27973 (removed 19269) transitions.
[2024-05-25 15:14:55] [INFO ] Flow matrix only has 8104 transitions (discarded 600 similar events)
// Phase 1: matrix 8104 rows 5415 cols
[2024-05-25 15:14:55] [INFO ] Computed 1249 invariants in 232 ms
[2024-05-25 15:15:00] [INFO ] Implicit Places using invariants in 4903 ms returned []
[2024-05-25 15:15:00] [INFO ] Flow matrix only has 8104 transitions (discarded 600 similar events)
[2024-05-25 15:15:00] [INFO ] Invariant cache hit.
[2024-05-25 15:15:06] [INFO ] Implicit Places using invariants and state equation in 5916 ms returned []
Implicit Place search using SMT with State Equation took 10822 ms to find 0 implicit places.
[2024-05-25 15:15:07] [INFO ] Redundant transitions in 1156 ms returned []
[2024-05-25 15:15:07] [INFO ] Flow matrix only has 8104 transitions (discarded 600 similar events)
[2024-05-25 15:15:07] [INFO ] Invariant cache hit.
[2024-05-25 15:15:12] [INFO ] Dead Transitions using invariants and state equation in 5453 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5415/19204 places, 8704/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20634 ms. Remains : 5415/19204 places, 8704/27973 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1052 1) (GEQ s3208 1)), p2:(OR (AND (GEQ s2117 1) (GEQ s2146 1)) (AND (GEQ s4233 1) (GEQ s4445 1))), p1:(AND (GEQ s2117 1) (GEQ s2146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-01 finished in 20869 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((X(X(G(p0)))&&G(p1)))))'
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 512 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2024-05-25 15:15:13] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2024-05-25 15:15:16] [INFO ] Computed 1249 invariants in 2406 ms
[2024-05-25 15:15:17] [INFO ] Implicit Places using invariants in 3887 ms returned []
Implicit Place search using SMT only with invariants took 3888 ms to find 0 implicit places.
[2024-05-25 15:15:17] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:15:17] [INFO ] Invariant cache hit.
[2024-05-25 15:15:19] [INFO ] Dead Transitions using invariants and state equation in 1528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5933 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 4}]], initial=2, aps=[p1:(OR (LT s10555 1) (LT s18722 1)), p0:(OR (LT s14410 1) (LT s15441 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 48193 steps with 426 reset in 845 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-02 finished in 7125 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)&&X(G((p1||X(G(!p0)))))))'
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 498 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2024-05-25 15:15:20] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:15:20] [INFO ] Invariant cache hit.
[2024-05-25 15:15:22] [INFO ] Implicit Places using invariants in 1511 ms returned []
Implicit Place search using SMT only with invariants took 1511 ms to find 0 implicit places.
[2024-05-25 15:15:22] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:15:22] [INFO ] Invariant cache hit.
[2024-05-25 15:15:23] [INFO ] Dead Transitions using invariants and state equation in 1533 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3543 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) p0), p0, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s16433 1) (GEQ s16786 1)), p0:(AND (GEQ s14985 1) (GEQ s15142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-04 finished in 3922 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(X(X((p0||F(p1))))) U G(p0))))'
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 555 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2024-05-25 15:15:24] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:15:24] [INFO ] Invariant cache hit.
[2024-05-25 15:15:26] [INFO ] Implicit Places using invariants in 1534 ms returned []
Implicit Place search using SMT only with invariants took 1535 ms to find 0 implicit places.
[2024-05-25 15:15:26] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:15:26] [INFO ] Invariant cache hit.
[2024-05-25 15:15:27] [INFO ] Dead Transitions using invariants and state equation in 1482 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3574 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s6264 1) (GEQ s6299 1)), p1:(AND (GEQ s600 1) (GEQ s16803 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-05 finished in 3937 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((F(p0)&&(G(p1)||G(p2)))))'
Support contains 6 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6588 transitions
Trivial Post-agglo rules discarded 6588 transitions
Performed 6588 trivial Post agglomeration. Transition count delta: 6588
Iterating post reduction 0 with 6588 rules applied. Total rules applied 6588 place count 19204 transition count 21385
Reduce places removed 6588 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13188 place count 12616 transition count 21373
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 549 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20824
Deduced a syphon composed of 549 places in 26 ms
Reduce places removed 549 places and 0 transitions.
Iterating global reduction 3 with 1098 rules applied. Total rules applied 14298 place count 12055 transition count 20824
Discarding 6049 places :
Symmetric choice reduction at 3 with 6049 rule applications. Total rules 20347 place count 6006 transition count 14775
Iterating global reduction 3 with 6049 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14754
Deduced a syphon composed of 21 places in 16 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 26438 place count 5985 transition count 14754
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 26987 place count 5436 transition count 8715
Iterating global reduction 3 with 549 rules applied. Total rules applied 27536 place count 5436 transition count 8715
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27586 place count 5411 transition count 8690
Applied a total of 27586 rules in 3064 ms. Remains 5411 /19204 variables (removed 13793) and now considering 8690/27973 (removed 19283) transitions.
[2024-05-25 15:15:31] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
// Phase 1: matrix 8090 rows 5411 cols
[2024-05-25 15:15:31] [INFO ] Computed 1249 invariants in 234 ms
[2024-05-25 15:15:35] [INFO ] Implicit Places using invariants in 4383 ms returned []
[2024-05-25 15:15:35] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:15:35] [INFO ] Invariant cache hit.
[2024-05-25 15:15:39] [INFO ] Implicit Places using invariants and state equation in 4175 ms returned []
Implicit Place search using SMT with State Equation took 8560 ms to find 0 implicit places.
[2024-05-25 15:15:40] [INFO ] Redundant transitions in 1031 ms returned []
[2024-05-25 15:15:40] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:15:40] [INFO ] Invariant cache hit.
[2024-05-25 15:15:46] [INFO ] Dead Transitions using invariants and state equation in 5327 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5411/19204 places, 8690/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17996 ms. Remains : 5411/19204 places, 8690/27973 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=0 dest: 3}, { cond=(AND p1 p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s413 1) (LT s1428 1)), p2:(OR (LT s807 1) (LT s3607 1)), p0:(AND (GEQ s1748 1) (GEQ s1771 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 624 steps with 7 reset in 11 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-06 finished in 18354 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(F(p0))||G(p1))))'
Support contains 3 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6587 transitions
Trivial Post-agglo rules discarded 6587 transitions
Performed 6587 trivial Post agglomeration. Transition count delta: 6587
Iterating post reduction 0 with 6587 rules applied. Total rules applied 6587 place count 19204 transition count 21386
Reduce places removed 6587 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 6599 rules applied. Total rules applied 13186 place count 12617 transition count 21374
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 13198 place count 12605 transition count 21374
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 549 Pre rules applied. Total rules applied 13198 place count 12605 transition count 20825
Deduced a syphon composed of 549 places in 28 ms
Reduce places removed 549 places and 0 transitions.
Iterating global reduction 3 with 1098 rules applied. Total rules applied 14296 place count 12056 transition count 20825
Discarding 6048 places :
Symmetric choice reduction at 3 with 6048 rule applications. Total rules 20344 place count 6008 transition count 14777
Iterating global reduction 3 with 6048 rules applied. Total rules applied 26392 place count 6008 transition count 14777
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 26392 place count 6008 transition count 14757
Deduced a syphon composed of 20 places in 15 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 26432 place count 5988 transition count 14757
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 26980 place count 5440 transition count 8729
Iterating global reduction 3 with 548 rules applied. Total rules applied 27528 place count 5440 transition count 8729
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27578 place count 5415 transition count 8704
Applied a total of 27578 rules in 3087 ms. Remains 5415 /19204 variables (removed 13789) and now considering 8704/27973 (removed 19269) transitions.
[2024-05-25 15:15:49] [INFO ] Flow matrix only has 8104 transitions (discarded 600 similar events)
// Phase 1: matrix 8104 rows 5415 cols
[2024-05-25 15:15:49] [INFO ] Computed 1249 invariants in 273 ms
[2024-05-25 15:15:54] [INFO ] Implicit Places using invariants in 5035 ms returned []
[2024-05-25 15:15:54] [INFO ] Flow matrix only has 8104 transitions (discarded 600 similar events)
[2024-05-25 15:15:54] [INFO ] Invariant cache hit.
[2024-05-25 15:15:58] [INFO ] Implicit Places using invariants and state equation in 4180 ms returned []
Implicit Place search using SMT with State Equation took 9217 ms to find 0 implicit places.
[2024-05-25 15:15:59] [INFO ] Redundant transitions in 1014 ms returned []
[2024-05-25 15:15:59] [INFO ] Flow matrix only has 8104 transitions (discarded 600 similar events)
[2024-05-25 15:15:59] [INFO ] Invariant cache hit.
[2024-05-25 15:16:05] [INFO ] Dead Transitions using invariants and state equation in 5367 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5415/19204 places, 8704/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18698 ms. Remains : 5415/19204 places, 8704/27973 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s4474 1) (GEQ s4801 1)), p0:(GEQ s1941 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-07 finished in 18820 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((X(p1)||p0))))'
Support contains 2 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 497 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2024-05-25 15:16:05] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2024-05-25 15:16:08] [INFO ] Computed 1249 invariants in 2330 ms
[2024-05-25 15:16:09] [INFO ] Implicit Places using invariants in 3801 ms returned []
Implicit Place search using SMT only with invariants took 3802 ms to find 0 implicit places.
[2024-05-25 15:16:09] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:16:09] [INFO ] Invariant cache hit.
[2024-05-25 15:16:11] [INFO ] Dead Transitions using invariants and state equation in 1510 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5811 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s9919 1) (LT s10256 1)), p1:(AND (GEQ s9919 1) (GEQ s10256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 886 reset in 1831 ms.
Product exploration explored 100000 steps with 887 reset in 1809 ms.
Computed a total of 16580 stabilizing places and 22772 stable transitions
Computed a total of 16580 stabilizing places and 22772 stable transitions
Detected a total of 16580/19204 stabilizing places and 22772/27973 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 239 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 10723 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10723 steps, saw 5463 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 15:16:19] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:16:19] [INFO ] Invariant cache hit.
[2024-05-25 15:16:21] [INFO ] [Real]Absence check using 47 positive place invariants in 181 ms returned sat
[2024-05-25 15:16:22] [INFO ] [Real]Absence check using 47 positive and 1202 generalized place invariants in 735 ms returned sat
[2024-05-25 15:16:44] [INFO ] After 20850ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2
[2024-05-25 15:16:44] [INFO ] State equation strengthened by 8602 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
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.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 15:16:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:16:44] [INFO ] After 25102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 19204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6588 transitions
Trivial Post-agglo rules discarded 6588 transitions
Performed 6588 trivial Post agglomeration. Transition count delta: 6588
Iterating post reduction 0 with 6588 rules applied. Total rules applied 6588 place count 19204 transition count 21385
Reduce places removed 6588 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13188 place count 12616 transition count 21373
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 549 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20824
Deduced a syphon composed of 549 places in 27 ms
Reduce places removed 549 places and 0 transitions.
Iterating global reduction 3 with 1098 rules applied. Total rules applied 14298 place count 12055 transition count 20824
Discarding 6049 places :
Symmetric choice reduction at 3 with 6049 rule applications. Total rules 20347 place count 6006 transition count 14775
Iterating global reduction 3 with 6049 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14754
Deduced a syphon composed of 21 places in 16 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 26438 place count 5985 transition count 14754
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 26987 place count 5436 transition count 8715
Iterating global reduction 3 with 549 rules applied. Total rules applied 27536 place count 5436 transition count 8715
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27586 place count 5411 transition count 8690
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 3 with 337 rules applied. Total rules applied 27923 place count 5411 transition count 13843
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 3 with 337 rules applied. Total rules applied 28260 place count 5074 transition count 13843
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 28284 place count 5074 transition count 13843
Applied a total of 28284 rules in 4767 ms. Remains 5074 /19204 variables (removed 14130) and now considering 13843/27973 (removed 14130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4767 ms. Remains : 5074/19204 places, 13843/27973 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 21586 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21586 steps, saw 10110 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:16:52] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
// Phase 1: matrix 12957 rows 5074 cols
[2024-05-25 15:16:53] [INFO ] Computed 1249 invariants in 336 ms
[2024-05-25 15:16:53] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 15:16:54] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 344 ms returned sat
[2024-05-25 15:16:54] [INFO ] After 1247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:16:55] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 15:16:55] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 336 ms returned sat
[2024-05-25 15:17:03] [INFO ] After 7918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:17:03] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:17:07] [INFO ] After 4359ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:17:16] [INFO ] Deduced a trap composed of 438 places in 7726 ms of which 4 ms to minimize.
[2024-05-25 15:17:24] [INFO ] Deduced a trap composed of 523 places in 7932 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 15:17:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:17:24] [INFO ] After 30579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 5074 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Applied a total of 0 rules in 785 ms. Remains 5074 /5074 variables (removed 0) and now considering 13843/13843 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 785 ms. Remains : 5074/5074 places, 13843/13843 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Applied a total of 0 rules in 809 ms. Remains 5074 /5074 variables (removed 0) and now considering 13843/13843 (removed 0) transitions.
[2024-05-25 15:17:26] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
[2024-05-25 15:17:26] [INFO ] Invariant cache hit.
[2024-05-25 15:17:32] [INFO ] Implicit Places using invariants in 5494 ms returned []
Implicit Place search using SMT only with invariants took 5497 ms to find 0 implicit places.
[2024-05-25 15:17:32] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
[2024-05-25 15:17:32] [INFO ] Invariant cache hit.
[2024-05-25 15:17:39] [INFO ] Dead Transitions using invariants and state equation in 7738 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14046 ms. Remains : 5074/5074 places, 13843/13843 transitions.
Graph (trivial) has 3579 edges and 5074 vertex of which 25 / 5074 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 51798 edges and 5050 vertex of which 5028 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 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 t11620.t13897 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 4642 transition count 12114
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 4400 transition count 11633
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 4159 transition count 11193
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 3919 transition count 10795
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 3719 transition count 10435
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 3521 transition count 10113
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 3359 transition count 9825
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 3199 transition count 9571
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 3071 transition count 9347
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 2945 transition count 9153
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 2847 transition count 8985
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 2751 transition count 8843
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 2679 transition count 8723
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 2609 transition count 8625
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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2559 transition count 8545
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2511 transition count 8483
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 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 80 rules applied. Total rules applied 6087 place count 2479 transition count 8435
Ensure Unique test removed 12 places
Reduce places removed 30 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 64 rules applied. Total rules applied 6151 place count 2449 transition count 8401
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 6193 place count 2431 transition count 8377
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 6223 place count 2415 transition count 8363
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 6239 place count 2407 transition count 8355
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2400 transition count 8353
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2398 transition count 8353
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6250 place count 2398 transition count 7803
Deduced a syphon composed of 550 places in 2 ms
Ensure Unique test removed 549 places
Reduce places removed 1099 places and 0 transitions.
Iterating global reduction 23 with 1649 rules applied. Total rules applied 7899 place count 1299 transition count 7803
Discarding 551 places :
Symmetric choice reduction at 23 with 551 rule applications. Total rules 8450 place count 748 transition count 7252
Iterating global reduction 23 with 551 rules applied. Total rules applied 9001 place count 748 transition count 7252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9001 place count 748 transition count 7251
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9003 place count 747 transition count 7251
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 9543 place count 207 transition count 1311
Iterating global reduction 23 with 540 rules applied. Total rules applied 10083 place count 207 transition count 1311
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 10623 place count 207 transition count 771
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 10674 place count 181 transition count 746
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10696 place count 181 transition count 724
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10718 place count 159 transition count 724
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10740 place count 137 transition count 482
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10773 place count 126 transition count 482
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10795 place count 126 transition count 460
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10806 place count 115 transition count 339
Iterating global reduction 26 with 11 rules applied. Total rules applied 10817 place count 115 transition count 339
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10828 place count 104 transition count 328
Iterating global reduction 26 with 11 rules applied. Total rules applied 10839 place count 104 transition count 328
Applied a total of 10839 rules in 8854 ms. Remains 104 /5074 variables (removed 4970) and now considering 328/13843 (removed 13515) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 328 rows 104 cols
[2024-05-25 15:17:48] [INFO ] Computed 38 invariants in 5 ms
[2024-05-25 15:17:48] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 15:17:48] [INFO ] [Real]Absence check using 3 positive and 35 generalized place invariants in 5 ms returned sat
[2024-05-25 15:17:48] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:17:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 15:17:48] [INFO ] [Nat]Absence check using 3 positive and 35 generalized place invariants in 5 ms returned sat
[2024-05-25 15:17:48] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:17:48] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-25 15:17:49] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 292 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-08 finished in 104071 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 2 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6588 transitions
Trivial Post-agglo rules discarded 6588 transitions
Performed 6588 trivial Post agglomeration. Transition count delta: 6588
Iterating post reduction 0 with 6588 rules applied. Total rules applied 6588 place count 19204 transition count 21385
Reduce places removed 6588 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13188 place count 12616 transition count 21373
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 549 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20824
Deduced a syphon composed of 549 places in 27 ms
Reduce places removed 549 places and 0 transitions.
Iterating global reduction 3 with 1098 rules applied. Total rules applied 14298 place count 12055 transition count 20824
Discarding 6049 places :
Symmetric choice reduction at 3 with 6049 rule applications. Total rules 20347 place count 6006 transition count 14775
Iterating global reduction 3 with 6049 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14754
Deduced a syphon composed of 21 places in 17 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 26438 place count 5985 transition count 14754
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 26987 place count 5436 transition count 8715
Iterating global reduction 3 with 549 rules applied. Total rules applied 27536 place count 5436 transition count 8715
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27586 place count 5411 transition count 8690
Applied a total of 27586 rules in 3101 ms. Remains 5411 /19204 variables (removed 13793) and now considering 8690/27973 (removed 19283) transitions.
[2024-05-25 15:17:52] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
// Phase 1: matrix 8090 rows 5411 cols
[2024-05-25 15:17:52] [INFO ] Computed 1249 invariants in 245 ms
[2024-05-25 15:17:58] [INFO ] Implicit Places using invariants in 6340 ms returned []
[2024-05-25 15:17:58] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:17:58] [INFO ] Invariant cache hit.
[2024-05-25 15:18:04] [INFO ] Implicit Places using invariants and state equation in 6039 ms returned []
Implicit Place search using SMT with State Equation took 12382 ms to find 0 implicit places.
[2024-05-25 15:18:05] [INFO ] Redundant transitions in 1040 ms returned []
[2024-05-25 15:18:05] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:18:05] [INFO ] Invariant cache hit.
[2024-05-25 15:18:11] [INFO ] Dead Transitions using invariants and state equation in 5683 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5411/19204 places, 8690/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22214 ms. Remains : 5411/19204 places, 8690/27973 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-10 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 s2417 1) (LT s2444 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 1245 reset in 1046 ms.
Product exploration explored 100000 steps with 1246 reset in 1084 ms.
Computed a total of 2812 stabilizing places and 3514 stable transitions
Computed a total of 2812 stabilizing places and 3514 stable transitions
Detected a total of 2812/5411 stabilizing places and 3514/8690 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 76 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)]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 27221 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 27221 steps, saw 12881 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:18:17] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:18:17] [INFO ] Invariant cache hit.
[2024-05-25 15:18:17] [INFO ] [Real]Absence check using 49 positive place invariants in 80 ms returned sat
[2024-05-25 15:18:18] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 337 ms returned sat
[2024-05-25 15:18:22] [INFO ] After 4729ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:18:22] [INFO ] State equation strengthened by 3112 read => feed constraints.
[2024-05-25 15:18:23] [INFO ] After 475ms SMT Verify possible using 3112 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:18:23] [INFO ] After 6239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:18:23] [INFO ] [Nat]Absence check using 49 positive place invariants in 81 ms returned sat
[2024-05-25 15:18:24] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 344 ms returned sat
[2024-05-25 15:18:29] [INFO ] After 4958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:18:30] [INFO ] After 792ms SMT Verify possible using 3112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:18:36] [INFO ] Deduced a trap composed of 341 places in 5906 ms of which 5 ms to minimize.
[2024-05-25 15:18:43] [INFO ] Deduced a trap composed of 414 places in 6003 ms of which 6 ms to minimize.
[2024-05-25 15:18:50] [INFO ] Deduced a trap composed of 486 places in 5989 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: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 15:18:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:18:50] [INFO ] After 27141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5411/5411 places, 8690/8690 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5411 transition count 13843
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5074 transition count 13843
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 698 place count 5074 transition count 13843
Applied a total of 698 rules in 2272 ms. Remains 5074 /5411 variables (removed 337) and now considering 13843/8690 (removed -5153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2274 ms. Remains : 5074/5411 places, 13843/8690 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23183 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23183 steps, saw 10827 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:18:56] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
// Phase 1: matrix 12957 rows 5074 cols
[2024-05-25 15:18:56] [INFO ] Computed 1249 invariants in 354 ms
[2024-05-25 15:18:57] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2024-05-25 15:18:57] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 322 ms returned sat
[2024-05-25 15:19:04] [INFO ] After 7473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:19:04] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2024-05-25 15:19:05] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 333 ms returned sat
[2024-05-25 15:19:12] [INFO ] After 7038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:19:12] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2024-05-25 15:19:17] [INFO ] After 4933ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:19:24] [INFO ] Deduced a trap composed of 301 places in 7437 ms of which 5 ms to minimize.
[2024-05-25 15:19:34] [INFO ] Deduced a trap composed of 481 places in 7500 ms of which 4 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 15:19:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:19:34] [INFO ] After 29814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5074 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Applied a total of 0 rules in 784 ms. Remains 5074 /5074 variables (removed 0) and now considering 13843/13843 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 784 ms. Remains : 5074/5074 places, 13843/13843 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Applied a total of 0 rules in 779 ms. Remains 5074 /5074 variables (removed 0) and now considering 13843/13843 (removed 0) transitions.
[2024-05-25 15:19:35] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
[2024-05-25 15:19:35] [INFO ] Invariant cache hit.
[2024-05-25 15:19:42] [INFO ] Implicit Places using invariants in 6837 ms returned []
Implicit Place search using SMT only with invariants took 6838 ms to find 0 implicit places.
[2024-05-25 15:19:42] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
[2024-05-25 15:19:42] [INFO ] Invariant cache hit.
[2024-05-25 15:19:50] [INFO ] Dead Transitions using invariants and state equation in 8339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15961 ms. Remains : 5074/5074 places, 13843/13843 transitions.
Graph (trivial) has 3579 edges and 5074 vertex of which 25 / 5074 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 51798 edges and 5050 vertex of which 5028 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 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 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 4642 transition count 12114
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 4400 transition count 11633
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 4159 transition count 11193
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 3919 transition count 10795
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 3719 transition count 10435
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 3521 transition count 10113
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 3359 transition count 9825
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 3199 transition count 9571
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 3071 transition count 9347
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 2945 transition count 9153
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 2847 transition count 8985
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 2751 transition count 8843
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 2679 transition count 8723
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 2609 transition count 8625
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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2559 transition count 8545
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2511 transition count 8483
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 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 80 rules applied. Total rules applied 6087 place count 2479 transition count 8435
Ensure Unique test removed 12 places
Reduce places removed 30 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 64 rules applied. Total rules applied 6151 place count 2449 transition count 8401
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 6193 place count 2431 transition count 8377
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 6223 place count 2415 transition count 8363
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 6239 place count 2407 transition count 8355
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2400 transition count 8353
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2398 transition count 8353
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6250 place count 2398 transition count 7803
Deduced a syphon composed of 550 places in 3 ms
Ensure Unique test removed 549 places
Reduce places removed 1099 places and 0 transitions.
Iterating global reduction 23 with 1649 rules applied. Total rules applied 7899 place count 1299 transition count 7803
Discarding 551 places :
Symmetric choice reduction at 23 with 551 rule applications. Total rules 8450 place count 748 transition count 7252
Iterating global reduction 23 with 551 rules applied. Total rules applied 9001 place count 748 transition count 7252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9001 place count 748 transition count 7251
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9003 place count 747 transition count 7251
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 9543 place count 207 transition count 1311
Iterating global reduction 23 with 540 rules applied. Total rules applied 10083 place count 207 transition count 1311
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 10623 place count 207 transition count 771
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 10674 place count 181 transition count 746
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10696 place count 181 transition count 724
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10718 place count 159 transition count 724
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10740 place count 137 transition count 482
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10773 place count 126 transition count 482
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10795 place count 126 transition count 460
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10806 place count 115 transition count 339
Iterating global reduction 26 with 11 rules applied. Total rules applied 10817 place count 115 transition count 339
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10828 place count 104 transition count 328
Iterating global reduction 26 with 11 rules applied. Total rules applied 10839 place count 104 transition count 328
Applied a total of 10839 rules in 8775 ms. Remains 104 /5074 variables (removed 4970) and now considering 328/13843 (removed 13515) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 328 rows 104 cols
[2024-05-25 15:19:59] [INFO ] Computed 38 invariants in 6 ms
[2024-05-25 15:19:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 15:19:59] [INFO ] [Real]Absence check using 3 positive and 35 generalized place invariants in 5 ms returned sat
[2024-05-25 15:19:59] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:19:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 15:19:59] [INFO ] [Nat]Absence check using 3 positive and 35 generalized place invariants in 5 ms returned sat
[2024-05-25 15:19:59] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:19:59] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 15:19:59] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 80 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 5411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5411/5411 places, 8690/8690 transitions.
Applied a total of 0 rules in 542 ms. Remains 5411 /5411 variables (removed 0) and now considering 8690/8690 (removed 0) transitions.
[2024-05-25 15:20:00] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
// Phase 1: matrix 8090 rows 5411 cols
[2024-05-25 15:20:00] [INFO ] Computed 1249 invariants in 248 ms
[2024-05-25 15:20:06] [INFO ] Implicit Places using invariants in 6074 ms returned []
[2024-05-25 15:20:06] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:20:06] [INFO ] Invariant cache hit.
[2024-05-25 15:20:12] [INFO ] Implicit Places using invariants and state equation in 6037 ms returned []
Implicit Place search using SMT with State Equation took 12112 ms to find 0 implicit places.
[2024-05-25 15:20:13] [INFO ] Redundant transitions in 1000 ms returned []
[2024-05-25 15:20:13] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:20:13] [INFO ] Invariant cache hit.
[2024-05-25 15:20:19] [INFO ] Dead Transitions using invariants and state equation in 5693 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19356 ms. Remains : 5411/5411 places, 8690/8690 transitions.
Computed a total of 2812 stabilizing places and 3514 stable transitions
Computed a total of 2812 stabilizing places and 3514 stable transitions
Detected a total of 2812/5411 stabilizing places and 3514/8690 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 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6801 steps, including 84 resets, run visited all 1 properties in 75 ms. (steps per millisecond=90 )
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 97 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1246 reset in 1046 ms.
Product exploration explored 100000 steps with 1245 reset in 1083 ms.
Built C files in :
/tmp/ltsmin15667666073482987504
[2024-05-25 15:20:22] [INFO ] Too many transitions (8690) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:20:22] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15667666073482987504
Running compilation step : cd /tmp/ltsmin15667666073482987504;'/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/ltsmin15667666073482987504;'/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/ltsmin15667666073482987504;'/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 2 out of 5411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5411/5411 places, 8690/8690 transitions.
Applied a total of 0 rules in 527 ms. Remains 5411 /5411 variables (removed 0) and now considering 8690/8690 (removed 0) transitions.
[2024-05-25 15:20:25] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:20:25] [INFO ] Invariant cache hit.
[2024-05-25 15:20:31] [INFO ] Implicit Places using invariants in 5783 ms returned []
[2024-05-25 15:20:31] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:20:31] [INFO ] Invariant cache hit.
[2024-05-25 15:20:37] [INFO ] Implicit Places using invariants and state equation in 5946 ms returned []
Implicit Place search using SMT with State Equation took 11729 ms to find 0 implicit places.
[2024-05-25 15:20:38] [INFO ] Redundant transitions in 952 ms returned []
[2024-05-25 15:20:38] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
[2024-05-25 15:20:38] [INFO ] Invariant cache hit.
[2024-05-25 15:20:44] [INFO ] Dead Transitions using invariants and state equation in 5762 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18982 ms. Remains : 5411/5411 places, 8690/8690 transitions.
Built C files in :
/tmp/ltsmin4411410597037610317
[2024-05-25 15:20:44] [INFO ] Too many transitions (8690) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:20:44] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4411410597037610317
Running compilation step : cd /tmp/ltsmin4411410597037610317;'/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/ltsmin4411410597037610317;'/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/ltsmin4411410597037610317;'/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 15:20:48] [INFO ] Flatten gal took : 214 ms
[2024-05-25 15:20:48] [INFO ] Flatten gal took : 224 ms
[2024-05-25 15:20:48] [INFO ] Time to serialize gal into /tmp/LTL7672840824964985270.gal : 40 ms
[2024-05-25 15:20:48] [INFO ] Time to serialize properties into /tmp/LTL755790886956022541.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/LTL7672840824964985270.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9641900648977436002.hoa' '-atoms' '/tmp/LTL755790886956022541.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...316
Loading property file /tmp/LTL755790886956022541.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9641900648977436002.hoa
Detected timeout of ITS tools.
[2024-05-25 15:21:03] [INFO ] Flatten gal took : 214 ms
[2024-05-25 15:21:04] [INFO ] Flatten gal took : 226 ms
[2024-05-25 15:21:04] [INFO ] Time to serialize gal into /tmp/LTL6432955313496657914.gal : 41 ms
[2024-05-25 15:21:04] [INFO ] Time to serialize properties into /tmp/LTL6426611104028024916.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/LTL6432955313496657914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6426611104028024916.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 : !((G(F("((Node12HasAskedItsLeafSetToRx3ToReplaceNode15<1)||(LeafSetOfRx3IsSentToNode12<1))"))))
Formula 0 simplified : FG!"((Node12HasAskedItsLeafSetToRx3ToReplaceNode15<1)||(LeafSetOfRx3IsSentToNode12<1))"
Detected timeout of ITS tools.
[2024-05-25 15:21:19] [INFO ] Flatten gal took : 215 ms
[2024-05-25 15:21:19] [INFO ] Applying decomposition
[2024-05-25 15:21:19] [INFO ] Flatten gal took : 224 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/graph13666319476529743554.txt' '-o' '/tmp/graph13666319476529743554.bin' '-w' '/tmp/graph13666319476529743554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13666319476529743554.bin' '-l' '-1' '-v' '-w' '/tmp/graph13666319476529743554.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:21:20] [INFO ] Decomposing Gal with order
[2024-05-25 15:21:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:21:21] [INFO ] Removed a total of 7326 redundant transitions.
[2024-05-25 15:21:21] [INFO ] Flatten gal took : 1049 ms
[2024-05-25 15:21:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 4804 labels/synchronizations in 427 ms.
[2024-05-25 15:21:22] [INFO ] Time to serialize gal into /tmp/LTL445669880772796238.gal : 72 ms
[2024-05-25 15:21:22] [INFO ] Time to serialize properties into /tmp/LTL2925208829288289592.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/LTL445669880772796238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2925208829288289592.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...253
Read 1 LTL properties
Checking formula 0 : !((G(F("((i21.i1.u389.Node12HasAskedItsLeafSetToRx3ToReplaceNode15<1)||(i21.i1.u374.LeafSetOfRx3IsSentToNode12<1))"))))
Formula 0 simplified : FG!"((i21.i1.u389.Node12HasAskedItsLeafSetToRx3ToReplaceNode15<1)||(i21.i1.u374.LeafSetOfRx3IsSentToNode12<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6964180194884784568
[2024-05-25 15:21:37] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6964180194884784568
Running compilation step : cd /tmp/ltsmin6964180194884784568;'/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/ltsmin6964180194884784568;'/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/ltsmin6964180194884784568;'/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-S24C11-LTLFireability-10 finished in 231500 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(X(G(p0)))))'
Support contains 2 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 499 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2024-05-25 15:21:41] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2024-05-25 15:21:43] [INFO ] Computed 1249 invariants in 2469 ms
[2024-05-25 15:21:45] [INFO ] Implicit Places using invariants in 3971 ms returned []
Implicit Place search using SMT only with invariants took 3972 ms to find 0 implicit places.
[2024-05-25 15:21:45] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:21:45] [INFO ] Invariant cache hit.
[2024-05-25 15:21:46] [INFO ] Dead Transitions using invariants and state equation in 1533 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6007 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-11 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s1431 1) (LT s19019 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 74728 steps with 661 reset in 1315 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-11 finished in 7606 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 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 495 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2024-05-25 15:21:48] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:21:48] [INFO ] Invariant cache hit.
[2024-05-25 15:21:50] [INFO ] Implicit Places using invariants in 1541 ms returned []
Implicit Place search using SMT only with invariants took 1542 ms to find 0 implicit places.
[2024-05-25 15:21:50] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2024-05-25 15:21:50] [INFO ] Invariant cache hit.
[2024-05-25 15:21:51] [INFO ] Dead Transitions using invariants and state equation in 1527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3565 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-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 s4264 1) (GEQ s18614 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 116 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLFireability-13 finished in 3791 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)||(!p0&&F(G((p0||F(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)))'
[2024-05-25 15:21:53] [INFO ] Flatten gal took : 662 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4760534685953957573
[2024-05-25 15:21:53] [INFO ] Too many transitions (27973) to apply POR reductions. Disabling POR matrices.
[2024-05-25 15:21:53] [INFO ] Built C files in 274ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4760534685953957573
Running compilation step : cd /tmp/ltsmin4760534685953957573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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 15:21:53] [INFO ] Applying decomposition
[2024-05-25 15:21:54] [INFO ] Flatten gal took : 749 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/graph1069599520156179935.txt' '-o' '/tmp/graph1069599520156179935.bin' '-w' '/tmp/graph1069599520156179935.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1069599520156179935.bin' '-l' '-1' '-v' '-w' '/tmp/graph1069599520156179935.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:21:56] [INFO ] Decomposing Gal with order
[2024-05-25 15:21:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:22:03] [INFO ] Removed a total of 17770 redundant transitions.
[2024-05-25 15:22:03] [INFO ] Flatten gal took : 2714 ms
[2024-05-25 15:22:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 1558 labels/synchronizations in 389 ms.
[2024-05-25 15:22:04] [INFO ] Time to serialize gal into /tmp/LTLFireability1206428272153352202.gal : 140 ms
[2024-05-25 15:22:04] [INFO ] Time to serialize properties into /tmp/LTLFireability7965993250115746158.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/LTLFireability1206428272153352202.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7965993250115746158.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...276
Read 2 LTL properties
Checking formula 0 : !((F((G(!("((i2.u246.Node20NotifyThatHeIsActive>=1)&&(i2.u289.Node22ThinksNode20ShouldBeNodeMasterToReplaceNode6>=1))")))||((!("((i2.u...486
Formula 0 simplified : G(F"((i2.u246.Node20NotifyThatHeIsActive>=1)&&(i2.u289.Node22ThinksNode20ShouldBeNodeMasterToReplaceNode6>=1))" & ("((i2.u246.Node20...467
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/ltsmin4760534685953957573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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 360 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4760534685953957573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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 360 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)
ITS-tools command line returned an error code 137
[2024-05-25 15:33:58] [INFO ] Flatten gal took : 1780 ms
[2024-05-25 15:33:59] [INFO ] Time to serialize gal into /tmp/LTLFireability12361832863894189670.gal : 170 ms
[2024-05-25 15:33:59] [INFO ] Time to serialize properties into /tmp/LTLFireability10340946457445717684.ltl : 5 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/LTLFireability12361832863894189670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10340946457445717684.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...299
Read 2 LTL properties
Checking formula 0 : !((F((G(!("((Node20NotifyThatHeIsActive>=1)&&(Node22ThinksNode20ShouldBeNodeMasterToReplaceNode6>=1))")))||((!("((Node20NotifyThatHeIs...421
Formula 0 simplified : G(F"((Node20NotifyThatHeIsActive>=1)&&(Node22ThinksNode20ShouldBeNodeMasterToReplaceNode6>=1))" & ("((Node20NotifyThatHeIsActive>=1)...402
ITS-tools command line returned an error code 137
[2024-05-25 15:56:44] [INFO ] Flatten gal took : 5644 ms
[2024-05-25 15:56:46] [INFO ] Input system was already deterministic with 27973 transitions.
[2024-05-25 15:56:46] [INFO ] Transformed 19204 places.
[2024-05-25 15:56:46] [INFO ] Transformed 27973 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 15:57:21] [INFO ] Time to serialize gal into /tmp/LTLFireability8057024872283567602.gal : 99 ms
[2024-05-25 15:57:21] [INFO ] Time to serialize properties into /tmp/LTLFireability10358502783517492224.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/LTLFireability8057024872283567602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10358502783517492224.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(!("((Node20NotifyThatHeIsActive>=1)&&(Node22ThinksNode20ShouldBeNodeMasterToReplaceNode6>=1))")))||((!("((Node20NotifyThatHeIs...421
Formula 0 simplified : G(F"((Node20NotifyThatHeIsActive>=1)&&(Node22ThinksNode20ShouldBeNodeMasterToReplaceNode6>=1))" & ("((Node20NotifyThatHeIsActive>=1)...402
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12153428 kB
After kill :
MemTotal: 16393232 kB
MemFree: 13980684 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ 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-S24C11"
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-S24C11, 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-171654372000083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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