fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r417-tall-171690555800143
Last Updated
July 7, 2024

About the Execution of 2023-gold for StigmergyCommit-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16210.191 3600000.00 4318420.00 68310.20 ??????F????FTT?? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r417-tall-171690555800143.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 StigmergyCommit-PT-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690555800143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 416M 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 StigmergyCommit-PT-10b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717122205724

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=StigmergyCommit-PT-10b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 02:23:30] [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-31 02:23:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 02:23:43] [INFO ] Load time of PNML (sax parser for PT used): 12491 ms
[2024-05-31 02:23:44] [INFO ] Transformed 3352 places.
[2024-05-31 02:23:45] [INFO ] Transformed 359880 transitions.
[2024-05-31 02:23:45] [INFO ] Found NUPN structural information;
[2024-05-31 02:23:46] [INFO ] Parsed PT model containing 3352 places and 359880 transitions and 7847007 arcs in 15231 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 192 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyCommit-PT-10b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 3352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3352/3352 places, 359880/359880 transitions.
Discarding 267 places :
Symmetric choice reduction at 0 with 267 rule applications. Total rules 267 place count 3085 transition count 359613
Iterating global reduction 0 with 267 rules applied. Total rules applied 534 place count 3085 transition count 359613
Discarding 167 places :
Symmetric choice reduction at 0 with 167 rule applications. Total rules 701 place count 2918 transition count 359446
Iterating global reduction 0 with 167 rules applied. Total rules applied 868 place count 2918 transition count 359446
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 967 place count 2819 transition count 359347
Iterating global reduction 0 with 99 rules applied. Total rules applied 1066 place count 2819 transition count 359347
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 1154 place count 2731 transition count 359259
Iterating global reduction 0 with 88 rules applied. Total rules applied 1242 place count 2731 transition count 359259
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 1319 place count 2654 transition count 359182
Iterating global reduction 0 with 77 rules applied. Total rules applied 1396 place count 2654 transition count 359182
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 1473 place count 2577 transition count 359105
Iterating global reduction 0 with 77 rules applied. Total rules applied 1550 place count 2577 transition count 359105
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 1627 place count 2500 transition count 359028
Iterating global reduction 0 with 77 rules applied. Total rules applied 1704 place count 2500 transition count 359028
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 1781 place count 2423 transition count 358951
Iterating global reduction 0 with 77 rules applied. Total rules applied 1858 place count 2423 transition count 358951
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 1924 place count 2357 transition count 358885
Iterating global reduction 0 with 66 rules applied. Total rules applied 1990 place count 2357 transition count 358885
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 2045 place count 2302 transition count 358830
Iterating global reduction 0 with 55 rules applied. Total rules applied 2100 place count 2302 transition count 358830
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 2111 place count 2302 transition count 358819
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 2133 place count 2280 transition count 358797
Iterating global reduction 1 with 22 rules applied. Total rules applied 2155 place count 2280 transition count 358797
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 2177 place count 2258 transition count 358775
Iterating global reduction 1 with 22 rules applied. Total rules applied 2199 place count 2258 transition count 358775
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 2210 place count 2247 transition count 358764
Iterating global reduction 1 with 11 rules applied. Total rules applied 2221 place count 2247 transition count 358764
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 2232 place count 2236 transition count 358753
Iterating global reduction 1 with 11 rules applied. Total rules applied 2243 place count 2236 transition count 358753
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 2254 place count 2225 transition count 358742
Iterating global reduction 1 with 11 rules applied. Total rules applied 2265 place count 2225 transition count 358742
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 2276 place count 2214 transition count 358731
Iterating global reduction 1 with 11 rules applied. Total rules applied 2287 place count 2214 transition count 358731
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 2298 place count 2203 transition count 358720
Iterating global reduction 1 with 11 rules applied. Total rules applied 2309 place count 2203 transition count 358720
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 2320 place count 2192 transition count 358709
Iterating global reduction 1 with 11 rules applied. Total rules applied 2331 place count 2192 transition count 358709
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 2342 place count 2181 transition count 358698
Iterating global reduction 1 with 11 rules applied. Total rules applied 2353 place count 2181 transition count 358698
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 2364 place count 2170 transition count 358687
Iterating global reduction 1 with 11 rules applied. Total rules applied 2375 place count 2170 transition count 358687
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 2386 place count 2159 transition count 358676
Iterating global reduction 1 with 11 rules applied. Total rules applied 2397 place count 2159 transition count 358676
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 2408 place count 2148 transition count 358665
Iterating global reduction 1 with 11 rules applied. Total rules applied 2419 place count 2148 transition count 358665
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 2430 place count 2148 transition count 358654
Applied a total of 2430 rules in 61915 ms. Remains 2148 /3352 variables (removed 1204) and now considering 358654/359880 (removed 1226) transitions.
// Phase 1: matrix 358654 rows 2148 cols
[2024-05-31 02:25:09] [INFO ] Computed 12 invariants in 17923 ms
[2024-05-31 02:25:11] [INFO ] Implicit Places using invariants in 19508 ms returned []
Implicit Place search using SMT only with invariants took 19547 ms to find 0 implicit places.
[2024-05-31 02:25:11] [INFO ] Invariant cache hit.
[2024-05-31 02:25:41] [INFO ] Performed 46192/358654 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-31 02:26:11] [INFO ] Dead Transitions using invariants and state equation in 60330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2148/3352 places, 358654/359880 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141824 ms. Remains : 2148/3352 places, 358654/359880 transitions.
Support contains 66 out of 2148 places after structural reductions.
[2024-05-31 02:27:02] [INFO ] Flatten gal took : 44628 ms
[2024-05-31 02:27:44] [INFO ] Flatten gal took : 41319 ms
[2024-05-31 02:28:56] [INFO ] Input system was already deterministic with 358654 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 2602 ms. (steps per millisecond=3 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 6034 steps, run timeout after 9013 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 6034 steps, saw 5428 distinct states, run finished after 9014 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 29 properties.
[2024-05-31 02:29:14] [INFO ] Invariant cache hit.
[2024-05-31 02:29:16] [INFO ] After 1281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2024-05-31 02:29:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 02:29:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 02:29:41] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:29
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 66 out of 2148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2148/2148 places, 358654/358654 transitions.
Graph (trivial) has 2081 edges and 2148 vertex of which 187 / 2148 are part of one of the 33 SCC in 50 ms
Free SCC test removed 154 places
Drop transitions removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Graph (complete) has 4911 edges and 1994 vertex of which 1983 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1114 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 1439 transitions
Trivial Post-agglo rules discarded 1439 transitions
Performed 1439 trivial Post agglomeration. Transition count delta: 1439
Iterating post reduction 0 with 1450 rules applied. Total rules applied 1452 place count 1983 transition count 356995
Reduce places removed 1439 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1472 rules applied. Total rules applied 2924 place count 544 transition count 356962
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 2935 place count 533 transition count 356962
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 2935 place count 533 transition count 356840
Deduced a syphon composed of 122 places in 405 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 3179 place count 411 transition count 356840
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3180 place count 411 transition count 356839
Performed 12 Post agglomeration using F-continuation condition.
Performed 18 Post agglomeration using F-continuation condition.
Performed 24 Post agglomeration using F-continuation condition.
Performed 30 Post agglomeration using F-continuation condition.
Performed 36 Post agglomeration using F-continuation condition.
Performed 42 Post agglomeration using F-continuation condition.
Performed 48 Post agglomeration using F-continuation condition.
Performed 54 Post agglomeration using F-continuation condition.
Performed 60 Post agglomeration using F-continuation condition.
Performed 66 Post agglomeration using F-continuation condition.
Performed 72 Post agglomeration using F-continuation condition.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 128 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 3336 place count 333 transition count 356761
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 3358 place count 333 transition count 356739
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 3403 place count 288 transition count 356673
Iterating global reduction 5 with 45 rules applied. Total rules applied 3448 place count 288 transition count 356673
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 3460 place count 288 transition count 356661
Discarding 33 places :
Symmetric choice reduction at 6 with 33 rule applications. Total rules 3493 place count 255 transition count 356628
Iterating global reduction 6 with 33 rules applied. Total rules applied 3526 place count 255 transition count 356628
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 3548 place count 233 transition count 356606
Iterating global reduction 6 with 22 rules applied. Total rules applied 3570 place count 233 transition count 356606
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 3581 place count 233 transition count 356595
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 123 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 3603 place count 222 transition count 356584
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 126 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 3609 place count 219 transition count 356592
Free-agglomeration rule applied 78 times.
Iterating global reduction 7 with 78 rules applied. Total rules applied 3687 place count 219 transition count 356514
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 7 with 78 rules applied. Total rules applied 3765 place count 141 transition count 356514
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 3776 place count 130 transition count 356503
Iterating global reduction 8 with 11 rules applied. Total rules applied 3787 place count 130 transition count 356503
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 3794 place count 130 transition count 356496
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 3801 place count 123 transition count 356496
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 3816 place count 123 transition count 356496
Applied a total of 3816 rules in 562214 ms. Remains 123 /2148 variables (removed 2025) and now considering 356496/358654 (removed 2158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 562227 ms. Remains : 123/2148 places, 356496/358654 transitions.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 451 stabilizing places and 473 stable transitions
FORMULA StigmergyCommit-PT-10b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(p0)||G(p1)))'
Support contains 28 out of 2148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2148/2148 places, 358654/358654 transitions.
Graph (trivial) has 2119 edges and 2148 vertex of which 187 / 2148 are part of one of the 33 SCC in 14 ms
Free SCC test removed 154 places
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1455 transitions
Trivial Post-agglo rules discarded 1455 transitions
Performed 1455 trivial Post agglomeration. Transition count delta: 1455
Iterating post reduction 0 with 1455 rules applied. Total rules applied 1456 place count 1993 transition count 357022
Reduce places removed 1455 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1488 rules applied. Total rules applied 2944 place count 538 transition count 356989
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 2955 place count 527 transition count 356989
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 2955 place count 527 transition count 356878
Deduced a syphon composed of 111 places in 590 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 3177 place count 416 transition count 356878
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 3187 place count 406 transition count 356868
Iterating global reduction 3 with 10 rules applied. Total rules applied 3197 place count 406 transition count 356868
Performed 11 Post agglomeration using F-continuation condition.
Performed 18 Post agglomeration using F-continuation condition.
Performed 25 Post agglomeration using F-continuation condition.
Performed 32 Post agglomeration using F-continuation condition.
Performed 39 Post agglomeration using F-continuation condition.
Performed 46 Post agglomeration using F-continuation condition.
Performed 53 Post agglomeration using F-continuation condition.
Performed 60 Post agglomeration using F-continuation condition.
Performed 67 Post agglomeration using F-continuation condition.
Performed 74 Post agglomeration using F-continuation condition.
Performed 81 Post agglomeration using F-continuation condition.
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 151 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 3371 place count 319 transition count 356781
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 3420 place count 270 transition count 133652
Iterating global reduction 3 with 49 rules applied. Total rules applied 3469 place count 270 transition count 133652
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 3485 place count 270 transition count 133636
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 3518 place count 237 transition count 133592
Iterating global reduction 4 with 33 rules applied. Total rules applied 3551 place count 237 transition count 133592
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 3584 place count 204 transition count 133548
Iterating global reduction 4 with 33 rules applied. Total rules applied 3617 place count 204 transition count 133548
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 3628 place count 204 transition count 133537
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 15 places in 30 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 3658 place count 189 transition count 133544
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3659 place count 188 transition count 133522
Iterating global reduction 5 with 1 rules applied. Total rules applied 3660 place count 188 transition count 133522
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3661 place count 188 transition count 133521
Applied a total of 3661 rules in 602218 ms. Remains 188 /2148 variables (removed 1960) and now considering 133521/358654 (removed 225133) transitions.
[2024-05-31 02:49:10] [INFO ] Flow matrix only has 133509 transitions (discarded 12 similar events)
// Phase 1: matrix 133509 rows 188 cols
[2024-05-31 02:49:13] [INFO ] Computed 2 invariants in 2844 ms
[2024-05-31 02:49:34] [INFO ] Implicit Places using invariants in 24035 ms returned []
Implicit Place search using SMT only with invariants took 24038 ms to find 0 implicit places.
[2024-05-31 02:49:34] [INFO ] Flow matrix only has 133509 transitions (discarded 12 similar events)
[2024-05-31 02:49:34] [INFO ] Invariant cache hit.
[2024-05-31 02:50:04] [INFO ] Performed 96096/133521 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-31 02:50:16] [INFO ] Dead Transitions using invariants and state equation in 42112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 188/2148 places, 133521/358654 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 668399 ms. Remains : 188/2148 places, 133521/358654 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 239 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s4 1) (EQ s22 1) (EQ s40 1) (EQ s56 1) (EQ s73 1) (EQ s90 1) (EQ s108 1) (EQ s124 1) (EQ s142 1) (EQ s159 1) (EQ s176 1)), p0:(OR (EQ s9 0) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 54020 steps with 2464 reset in 10001 ms.
Product exploration timeout after 50250 steps with 2277 reset in 10002 ms.
Computed a total of 8 stabilizing places and 30 stable transitions
Computed a total of 8 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 119 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 450 resets, run finished after 3564 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 20955 steps, run timeout after 9003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 20955 steps, saw 12588 distinct states, run finished after 9005 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 02:50:51] [INFO ] Flow matrix only has 133509 transitions (discarded 12 similar events)
[2024-05-31 02:50:51] [INFO ] Invariant cache hit.
[2024-05-31 02:50:51] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 02:50:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 02:51:16] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 133521/133521 transitions.
Graph (complete) has 1819 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.328 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 187 transition count 133486
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 46 place count 176 transition count 133486
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 54 place count 168 transition count 83046
Iterating global reduction 2 with 8 rules applied. Total rules applied 62 place count 168 transition count 83046
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 70 place count 168 transition count 83038
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 19 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 92 place count 157 transition count 83027
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 103 place count 157 transition count 83016
Free-agglomeration rule applied 65 times.
Iterating global reduction 4 with 65 rules applied. Total rules applied 168 place count 157 transition count 82951
Reduce places removed 66 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 86 rules applied. Total rules applied 254 place count 91 transition count 82931
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 265 place count 80 transition count 82931
Renaming transitions due to excessive name length > 1024 char.
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 276 place count 69 transition count 82920
Iterating global reduction 6 with 11 rules applied. Total rules applied 287 place count 69 transition count 82920
Performed 15 Post agglomeration using F-continuation condition.
Performed 22 Post agglomeration using F-continuation condition with reduction of 52911 identical transitions.
Deduced a syphon composed of 22 places in 9 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 331 place count 47 transition count 29987
Drop transitions removed 11 transitions
Ensure Unique test removed 4566 transitions
Reduce isomorphic transitions removed 4577 transitions.
Iterating post reduction 6 with 4577 rules applied. Total rules applied 4908 place count 47 transition count 25410
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 4915 place count 40 transition count 25403
Iterating global reduction 7 with 7 rules applied. Total rules applied 4922 place count 40 transition count 25403
Performed 11 Post agglomeration using F-continuation condition with reduction of 2036 identical transitions.
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 4944 place count 29 transition count 23356
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 4955 place count 29 transition count 23345
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4956 place count 28 transition count 23344
Applied a total of 4956 rules in 96614 ms. Remains 28 /188 variables (removed 160) and now considering 23344/133521 (removed 110177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96616 ms. Remains : 28/188 places, 23344/133521 transitions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 109 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 40 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0)]
Support contains 17 out of 188 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 133521/133521 transitions.
Applied a total of 0 rules in 2109 ms. Remains 188 /188 variables (removed 0) and now considering 133521/133521 (removed 0) transitions.
[2024-05-31 02:52:55] [INFO ] Flow matrix only has 133509 transitions (discarded 12 similar events)
[2024-05-31 02:52:55] [INFO ] Invariant cache hit.
[2024-05-31 02:53:15] [INFO ] Implicit Places using invariants in 20335 ms returned []
Implicit Place search using SMT only with invariants took 20341 ms to find 0 implicit places.
[2024-05-31 02:53:16] [INFO ] Flow matrix only has 133509 transitions (discarded 12 similar events)
[2024-05-31 02:53:16] [INFO ] Invariant cache hit.
[2024-05-31 02:53:46] [INFO ] Performed 92424/133521 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-31 02:53:59] [INFO ] Dead Transitions using invariants and state equation in 43219 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65685 ms. Remains : 188/188 places, 133521/133521 transitions.
Computed a total of 8 stabilizing places and 30 stable transitions
Computed a total of 8 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 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 38 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 457 resets, run finished after 3593 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22629 steps, run timeout after 9002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 22629 steps, saw 12920 distinct states, run finished after 9002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 02:54:13] [INFO ] Flow matrix only has 133509 transitions (discarded 12 similar events)
[2024-05-31 02:54:13] [INFO ] Invariant cache hit.
[2024-05-31 02:54:13] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 02:54:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 02:54:38] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 133521/133521 transitions.
Graph (complete) has 1819 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.328 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 187 transition count 133486
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 46 place count 176 transition count 133486
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 54 place count 168 transition count 83046
Iterating global reduction 2 with 8 rules applied. Total rules applied 62 place count 168 transition count 83046
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 70 place count 168 transition count 83038
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 20 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 92 place count 157 transition count 83027
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 103 place count 157 transition count 83016
Free-agglomeration rule applied 65 times.
Iterating global reduction 4 with 65 rules applied. Total rules applied 168 place count 157 transition count 82951
Reduce places removed 66 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 86 rules applied. Total rules applied 254 place count 91 transition count 82931
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 265 place count 80 transition count 82931
Renaming transitions due to excessive name length > 1024 char.
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 276 place count 69 transition count 82920
Iterating global reduction 6 with 11 rules applied. Total rules applied 287 place count 69 transition count 82920
Performed 15 Post agglomeration using F-continuation condition.
Performed 22 Post agglomeration using F-continuation condition with reduction of 52911 identical transitions.
Deduced a syphon composed of 22 places in 10 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 331 place count 47 transition count 29987
Drop transitions removed 11 transitions
Ensure Unique test removed 4566 transitions
Reduce isomorphic transitions removed 4577 transitions.
Iterating post reduction 6 with 4577 rules applied. Total rules applied 4908 place count 47 transition count 25410
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 4915 place count 40 transition count 25403
Iterating global reduction 7 with 7 rules applied. Total rules applied 4922 place count 40 transition count 25403
Performed 11 Post agglomeration using F-continuation condition with reduction of 2036 identical transitions.
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 4944 place count 29 transition count 23356
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 4955 place count 29 transition count 23345
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4956 place count 28 transition count 23344
Applied a total of 4956 rules in 96601 ms. Remains 28 /188 variables (removed 160) and now considering 23344/133521 (removed 110177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96603 ms. Remains : 28/188 places, 23344/133521 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 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 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Product exploration timeout after 33470 steps with 1528 reset in 10015 ms.
Product exploration timeout after 37770 steps with 1735 reset in 10001 ms.
Built C files in :
/tmp/ltsmin3898418177570266413
[2024-05-31 02:56:35] [INFO ] Too many transitions (133521) to apply POR reductions. Disabling POR matrices.
[2024-05-31 02:56:38] [INFO ] Built C files in 2259ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3898418177570266413
Running compilation step : cd /tmp/ltsmin3898418177570266413;'/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/ltsmin3898418177570266413;'/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/ltsmin3898418177570266413;'/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 17 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 133521/133521 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 188 transition count 133510
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 177 transition count 133510
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 30 place count 169 transition count 83070
Iterating global reduction 2 with 8 rules applied. Total rules applied 38 place count 169 transition count 83070
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 46 place count 169 transition count 83062
Applied a total of 46 rules in 13584 ms. Remains 169 /188 variables (removed 19) and now considering 83062/133521 (removed 50459) transitions.
[2024-05-31 02:56:54] [INFO ] Flow matrix only has 83050 transitions (discarded 12 similar events)
// Phase 1: matrix 83050 rows 169 cols
[2024-05-31 02:56:56] [INFO ] Computed 2 invariants in 1536 ms
[2024-05-31 02:57:08] [INFO ] Implicit Places using invariants in 13438 ms returned []
Implicit Place search using SMT only with invariants took 13446 ms to find 0 implicit places.
[2024-05-31 02:57:08] [INFO ] Flow matrix only has 83050 transitions (discarded 12 similar events)
[2024-05-31 02:57:08] [INFO ] Invariant cache hit.
[2024-05-31 02:57:34] [INFO ] Dead Transitions using invariants and state equation in 26299 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/188 places, 83062/133521 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53336 ms. Remains : 169/188 places, 83062/133521 transitions.
Built C files in :
/tmp/ltsmin7204144964910803003
[2024-05-31 02:57:34] [INFO ] Too many transitions (83062) to apply POR reductions. Disabling POR matrices.
[2024-05-31 02:57:36] [INFO ] Built C files in 1531ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7204144964910803003
Running compilation step : cd /tmp/ltsmin7204144964910803003;'/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/ltsmin7204144964910803003;'/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/ltsmin7204144964910803003;'/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-31 02:58:37] [INFO ] Flatten gal took : 14438 ms
[2024-05-31 02:58:52] [INFO ] Flatten gal took : 15064 ms
[2024-05-31 02:58:54] [INFO ] Time to serialize gal into /tmp/LTL14609583937382987850.gal : 1353 ms
[2024-05-31 02:58:54] [INFO ] Time to serialize properties into /tmp/LTL15698863034744192794.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/LTL14609583937382987850.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16041112341279132862.hoa' '-atoms' '/tmp/LTL15698863034744192794.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Detected timeout of ITS tools.
[2024-05-31 03:00:25] [INFO ] Flatten gal took : 27461 ms
[2024-05-31 03:00:53] [INFO ] Flatten gal took : 28297 ms
[2024-05-31 03:00:55] [INFO ] Time to serialize gal into /tmp/LTL16266803768079241024.gal : 2293 ms
[2024-05-31 03:00:55] [INFO ] Time to serialize properties into /tmp/LTL8955940285701389151.ltl : 3 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/LTL16266803768079241024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8955940285701389151.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-05-31 03:01:44] [INFO ] Flatten gal took : 25593 ms
[2024-05-31 03:01:44] [INFO ] Applying decomposition
[2024-05-31 03:02:06] [INFO ] Flatten gal took : 22260 ms
[2024-05-31 03:03:12] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14655726647174622612.txt' '-o' '/tmp/graph14655726647174622612.bin' '-w' '/tmp/graph14655726647174622612.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
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-31 03:03:36] [INFO ] Flatten gal took : 23830 ms
[2024-05-31 03:03:38] [INFO ] Time to serialize gal into /tmp/LTL17025889291079129740.gal : 2058 ms
[2024-05-31 03:03:38] [INFO ] Time to serialize properties into /tmp/LTL17070075544589368429.ltl : 13 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/LTL17025889291079129740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17070075544589368429.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6751590135714395974
[2024-05-31 03:04:00] [INFO ] Built C files in 4223ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6751590135714395974
Running compilation step : cd /tmp/ltsmin6751590135714395974;'/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/ltsmin6751590135714395974;'/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/ltsmin6751590135714395974;'/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 StigmergyCommit-PT-10b-LTLFireability-00 finished in 1495459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 20 out of 2148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2148/2148 places, 358654/358654 transitions.
Applied a total of 0 rules in 8788 ms. Remains 2148 /2148 variables (removed 0) and now considering 358654/358654 (removed 0) transitions.
// Phase 1: matrix 358654 rows 2148 cols
[2024-05-31 03:04:32] [INFO ] Computed 12 invariants in 17055 ms
[2024-05-31 03:05:03] [INFO ] Performed 842/2148 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 03:05:33] [INFO ] Performed 1765/2148 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-05-31 03:05:46] [INFO ] Implicit Places using invariants in 91416 ms returned []
Implicit Place search using SMT only with invariants took 91434 ms to find 0 implicit places.
[2024-05-31 03:05:48] [INFO ] Invariant cache hit.
[2024-05-31 03:06:18] [INFO ] Performed 49157/358654 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-31 03:06:48] [INFO ] Dead Transitions using invariants and state equation in 62105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162353 ms. Remains : 2148/2148 places, 358654/358654 transitions.
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s126 1) (EQ s277 1) (EQ s491 1) (EQ s705 1) (EQ s898 1) (EQ s1091 1) (EQ s1242 1) (EQ s1456 1) (EQ s1649 1) (EQ s1863 1) (EQ s2014 1)), p1:(OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 24340 steps with 122 reset in 10021 ms.
Product exploration timeout after 26650 steps with 135 reset in 10001 ms.
Computed a total of 451 stabilizing places and 473 stable transitions
Computed a total of 451 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 51 resets, run finished after 1992 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4799 steps, run timeout after 9006 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 4799 steps, saw 4305 distinct states, run finished after 9006 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 03:07:35] [INFO ] Invariant cache hit.
[2024-05-31 03:07:35] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 03:07:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
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:632)
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-31 03:08:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 03:08:00] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 2148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2148/2148 places, 358654/358654 transitions.
Graph (trivial) has 2127 edges and 2148 vertex of which 187 / 2148 are part of one of the 33 SCC in 19 ms
Free SCC test removed 154 places
Drop transitions removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Graph (complete) has 4911 edges and 1994 vertex of which 1983 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.907 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 1485 transitions
Trivial Post-agglo rules discarded 1485 transitions
Performed 1485 trivial Post agglomeration. Transition count delta: 1485
Iterating post reduction 0 with 1496 rules applied. Total rules applied 1498 place count 1983 transition count 356949
Reduce places removed 1485 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1518 rules applied. Total rules applied 3016 place count 498 transition count 356916
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 3027 place count 487 transition count 356916
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 3027 place count 487 transition count 356794
Deduced a syphon composed of 122 places in 468 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 3271 place count 365 transition count 356794
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3272 place count 365 transition count 356793
Performed 12 Post agglomeration using F-continuation condition.
Performed 18 Post agglomeration using F-continuation condition.
Performed 24 Post agglomeration using F-continuation condition.
Performed 30 Post agglomeration using F-continuation condition.
Performed 36 Post agglomeration using F-continuation condition.
Performed 42 Post agglomeration using F-continuation condition.
Performed 48 Post agglomeration using F-continuation condition.
Performed 54 Post agglomeration using F-continuation condition.
Performed 60 Post agglomeration using F-continuation condition.
Performed 66 Post agglomeration using F-continuation condition.
Performed 72 Post agglomeration using F-continuation condition.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 119 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 3428 place count 287 transition count 356715
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 3450 place count 287 transition count 356693
Discarding 57 places :
Symmetric choice reduction at 5 with 57 rule applications. Total rules 3507 place count 230 transition count 122479
Iterating global reduction 5 with 57 rules applied. Total rules applied 3564 place count 230 transition count 122479
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 3588 place count 230 transition count 122455
Discarding 33 places :
Symmetric choice reduction at 6 with 33 rule applications. Total rules 3621 place count 197 transition count 122422
Iterating global reduction 6 with 33 rules applied. Total rules applied 3654 place count 197 transition count 122422
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 3676 place count 175 transition count 122400
Iterating global reduction 6 with 22 rules applied. Total rules applied 3698 place count 175 transition count 122400
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 3709 place count 175 transition count 122389
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 26 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 3731 place count 164 transition count 122378
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 28 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 3737 place count 161 transition count 122386
Free-agglomeration rule applied 66 times.
Iterating global reduction 7 with 66 rules applied. Total rules applied 3803 place count 161 transition count 122320
Reduce places removed 66 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 69 rules applied. Total rules applied 3872 place count 95 transition count 122317
Renaming transitions due to excessive name length > 1024 char.
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 3883 place count 84 transition count 122306
Iterating global reduction 8 with 11 rules applied. Total rules applied 3894 place count 84 transition count 122306
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 3901 place count 84 transition count 122299
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 3908 place count 77 transition count 122299
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 3923 place count 77 transition count 122299
Applied a total of 3923 rules in 758222 ms. Remains 77 /2148 variables (removed 2071) and now considering 122299/358654 (removed 236355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 758232 ms. Remains : 77/2148 places, 122299/358654 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 20 out of 2148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2148/2148 places, 358654/358654 transitions.
Graph (trivial) has 2127 edges and 2148 vertex of which 187 / 2148 are part of one of the 33 SCC in 17 ms
Free SCC test removed 154 places
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1463 transitions
Trivial Post-agglo rules discarded 1463 transitions
Performed 1463 trivial Post agglomeration. Transition count delta: 1463
Iterating post reduction 0 with 1463 rules applied. Total rules applied 1464 place count 1993 transition count 357014
Reduce places removed 1463 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1496 rules applied. Total rules applied 2960 place count 530 transition count 356981
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 2971 place count 519 transition count 356981
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 2971 place count 519 transition count 356870
Deduced a syphon composed of 111 places in 438 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 3193 place count 408 transition count 356870
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 3203 place count 398 transition count 356860
Iterating global reduction 3 with 10 rules applied. Total rules applied 3213 place count 398 transition count 356860
Performed 11 Post agglomeration using F-continuation condition.
Performed 18 Post agglomeration using F-continuation condition.
Performed 25 Post agglomeration using F-continuation condition.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2729284 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16234220 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="StigmergyCommit-PT-10b"
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 StigmergyCommit-PT-10b, 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 r417-tall-171690555800143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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