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.r153-tall-171631151600358.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 DoubleExponent-PT-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151600358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 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 DoubleExponent-PT-100-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716429824971

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=DoubleExponent-PT-100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 02:03:46] [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-23 02:03:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:03:46] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-23 02:03:46] [INFO ] Transformed 5304 places.
[2024-05-23 02:03:46] [INFO ] Transformed 4998 transitions.
[2024-05-23 02:03:46] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 65 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 5300 transition count 4998
Applied a total of 4 rules in 1024 ms. Remains 5300 /5304 variables (removed 4) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:03:49] [INFO ] Invariants computation overflowed in 196 ms
[2024-05-23 02:03:51] [INFO ] Implicit Places using invariants in 2394 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:03:51] [INFO ] Invariants computation overflowed in 150 ms
[2024-05-23 02:03:52] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 3578 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:03:52] [INFO ] Invariants computation overflowed in 91 ms
[2024-05-23 02:03:55] [INFO ] Dead Transitions using invariants and state equation in 3238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5300/5304 places, 4998/4998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7855 ms. Remains : 5300/5304 places, 4998/4998 transitions.
Support contains 65 out of 5300 places after structural reductions.
[2024-05-23 02:03:56] [INFO ] Flatten gal took : 302 ms
[2024-05-23 02:03:56] [INFO ] Flatten gal took : 174 ms
[2024-05-23 02:03:57] [INFO ] Input system was already deterministic with 4998 transitions.
Support contains 56 out of 5300 places (down from 65) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 328 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 35) seen :0
Interrupted probabilistic random walk after 59012 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{31=1}
Probabilistic random walk after 59012 steps, saw 29511 distinct states, run finished after 3005 ms. (steps per millisecond=19 ) properties seen :1
Running SMT prover for 34 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:04:02] [INFO ] Invariants computation overflowed in 89 ms
[2024-05-23 02:04:27] [INFO ] After 19937ms SMT Verify possible using state equation in real domain returned unsat :0 sat :33
[2024-05-23 02:04:27] [INFO ] After 19946ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :33
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-23 02:04:27] [INFO ] After 25044ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :33
Fused 34 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 54 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1133 transitions
Trivial Post-agglo rules discarded 1133 transitions
Performed 1133 trivial Post agglomeration. Transition count delta: 1133
Iterating post reduction 0 with 1136 rules applied. Total rules applied 1137 place count 5297 transition count 3863
Reduce places removed 1133 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 1156 rules applied. Total rules applied 2293 place count 4164 transition count 3840
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 2316 place count 4141 transition count 3840
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 2316 place count 4141 transition count 3636
Deduced a syphon composed of 204 places in 222 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 2724 place count 3937 transition count 3636
Performed 885 Post agglomeration using F-continuation condition.Transition count delta: 885
Deduced a syphon composed of 885 places in 72 ms
Reduce places removed 885 places and 0 transitions.
Iterating global reduction 3 with 1770 rules applied. Total rules applied 4494 place count 3052 transition count 2751
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 62 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4696 place count 2951 transition count 2751
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 129 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 4874 place count 2862 transition count 2751
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4876 place count 2862 transition count 2749
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4878 place count 2860 transition count 2749
Free-agglomeration rule (complex) applied 405 times.
Iterating global reduction 4 with 405 rules applied. Total rules applied 5283 place count 2860 transition count 2344
Reduce places removed 405 places and 0 transitions.
Iterating post reduction 4 with 405 rules applied. Total rules applied 5688 place count 2455 transition count 2344
Partial Free-agglomeration rule applied 408 times.
Drop transitions removed 408 transitions
Iterating global reduction 5 with 408 rules applied. Total rules applied 6096 place count 2455 transition count 2344
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6097 place count 2454 transition count 2343
Applied a total of 6097 rules in 2474 ms. Remains 2454 /5300 variables (removed 2846) and now considering 2343/4998 (removed 2655) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2477 ms. Remains : 2454/5300 places, 2343/4998 transitions.
Incomplete random walk after 10000 steps, including 1292 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 74 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 34) seen :0
Interrupted probabilistic random walk after 83482 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83482 steps, saw 41756 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 34 properties.
// Phase 1: matrix 2343 rows 2454 cols
[2024-05-23 02:04:34] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:04:59] [INFO ] After 22332ms SMT Verify possible using state equation in real domain returned unsat :1 sat :32
[2024-05-23 02:04:59] [INFO ] State equation strengthened by 389 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:04:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:04:59] [INFO ] After 25053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 34 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 52 out of 2454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2454/2454 places, 2343/2343 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2454 transition count 2342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2453 transition count 2342
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 51 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2452 transition count 2342
Applied a total of 4 rules in 257 ms. Remains 2452 /2454 variables (removed 2) and now considering 2342/2343 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 2452/2454 places, 2342/2343 transitions.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Interrupted probabilistic random walk after 89142 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89142 steps, saw 44593 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 33 properties.
// Phase 1: matrix 2342 rows 2452 cols
[2024-05-23 02:05:03] [INFO ] Invariants computation overflowed in 68 ms
[2024-05-23 02:05:28] [INFO ] After 22438ms SMT Verify possible using state equation in real domain returned unsat :0 sat :14
[2024-05-23 02:05:28] [INFO ] State equation strengthened by 392 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:05:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:05:28] [INFO ] After 25059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 33 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 52 out of 2452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2452/2452 places, 2342/2342 transitions.
Applied a total of 0 rules in 122 ms. Remains 2452 /2452 variables (removed 0) and now considering 2342/2342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 2452/2452 places, 2342/2342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2452/2452 places, 2342/2342 transitions.
Applied a total of 0 rules in 139 ms. Remains 2452 /2452 variables (removed 0) and now considering 2342/2342 (removed 0) transitions.
// Phase 1: matrix 2342 rows 2452 cols
[2024-05-23 02:05:28] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:05:32] [INFO ] Implicit Places using invariants in 4243 ms returned []
// Phase 1: matrix 2342 rows 2452 cols
[2024-05-23 02:05:33] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:05:37] [INFO ] Implicit Places using invariants and state equation in 5005 ms returned []
Implicit Place search using SMT with State Equation took 9261 ms to find 0 implicit places.
[2024-05-23 02:05:38] [INFO ] Redundant transitions in 141 ms returned []
// Phase 1: matrix 2342 rows 2452 cols
[2024-05-23 02:05:38] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:05:39] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10787 ms. Remains : 2452/2452 places, 2342/2342 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.30 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 175 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 65 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 2 with 1804 rules applied. Total rules applied 4602 place count 2998 transition count 2696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 52 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4804 place count 2897 transition count 2696
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 49 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 4998 place count 2800 transition count 2696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4999 place count 2799 transition count 2695
Applied a total of 4999 rules in 1298 ms. Remains 2799 /5300 variables (removed 2501) and now considering 2695/4998 (removed 2303) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:05:40] [INFO ] Invariants computation overflowed in 63 ms
[2024-05-23 02:05:42] [INFO ] Implicit Places using invariants in 1411 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:05:42] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-23 02:05:44] [INFO ] Implicit Places using invariants and state equation in 2318 ms returned []
Implicit Place search using SMT with State Equation took 3731 ms to find 0 implicit places.
[2024-05-23 02:05:44] [INFO ] Redundant transitions in 129 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:05:44] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-23 02:05:46] [INFO ] Dead Transitions using invariants and state equation in 1291 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2799/5300 places, 2695/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6461 ms. Remains : 2799/5300 places, 2695/4998 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 150 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s172 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-00 finished in 6725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U p1)))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 802 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:05:47] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-23 02:05:49] [INFO ] Implicit Places using invariants in 2102 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:05:49] [INFO ] Invariants computation overflowed in 89 ms
[2024-05-23 02:05:50] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 3133 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:05:50] [INFO ] Invariants computation overflowed in 98 ms
[2024-05-23 02:05:53] [INFO ] Dead Transitions using invariants and state equation in 3159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7109 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s3309 1) (GEQ s3330 1)), p0:(AND (GEQ s3309 1) (GEQ s3330 1) (LT s752 1) (GEQ s3733 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3293 reset in 342 ms.
Product exploration explored 100000 steps with 3315 reset in 288 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, false]
Incomplete random walk after 10000 steps, including 329 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 57725 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57725 steps, saw 28870 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:05:59] [INFO ] Invariants computation overflowed in 90 ms
[2024-05-23 02:06:24] [INFO ] After 23968ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-23 02:06:24] [INFO ] After 23982ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-23 02:06:24] [INFO ] After 25055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2024-05-23 02:06:49] [INFO ] After 23877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 02:06:49] [INFO ] After 23878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-23 02:06:49] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1197 transitions
Trivial Post-agglo rules discarded 1197 transitions
Performed 1197 trivial Post agglomeration. Transition count delta: 1197
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1201 place count 5297 transition count 3799
Reduce places removed 1197 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2400 place count 4100 transition count 3797
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 197 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 66 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 3 with 1804 rules applied. Total rules applied 4606 place count 2996 transition count 2695
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 61 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4808 place count 2895 transition count 2695
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 55 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 4998 place count 2800 transition count 2695
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 3 with 398 rules applied. Total rules applied 5396 place count 2800 transition count 2297
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 3 with 398 rules applied. Total rules applied 5794 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 402 times.
Drop transitions removed 402 transitions
Iterating global reduction 4 with 402 rules applied. Total rules applied 6196 place count 2402 transition count 2297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6197 place count 2401 transition count 2296
Applied a total of 6197 rules in 1847 ms. Remains 2401 /5300 variables (removed 2899) and now considering 2296/4998 (removed 2702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1851 ms. Remains : 2401/5300 places, 2296/4998 transitions.
Incomplete random walk after 10000 steps, including 1292 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 107430 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107430 steps, saw 53758 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2296 rows 2401 cols
[2024-05-23 02:06:55] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:07:20] [INFO ] After 24310ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-23 02:07:20] [INFO ] State equation strengthened by 398 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:07:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:07:20] [INFO ] After 25048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 2296/2296 transitions.
Applied a total of 0 rules in 196 ms. Remains 2401 /2401 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 2401/2401 places, 2296/2296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 2296/2296 transitions.
Applied a total of 0 rules in 188 ms. Remains 2401 /2401 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2401 cols
[2024-05-23 02:07:20] [INFO ] Invariants computation overflowed in 66 ms
[2024-05-23 02:07:43] [INFO ] Implicit Places using invariants in 22484 ms returned []
// Phase 1: matrix 2296 rows 2401 cols
[2024-05-23 02:07:43] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-23 02:08:06] [INFO ] Implicit Places using invariants and state equation in 23398 ms returned []
Implicit Place search using SMT with State Equation took 45895 ms to find 0 implicit places.
[2024-05-23 02:08:06] [INFO ] Redundant transitions in 105 ms returned []
// Phase 1: matrix 2296 rows 2401 cols
[2024-05-23 02:08:06] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:08:08] [INFO ] Dead Transitions using invariants and state equation in 1584 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47787 ms. Remains : 2401/2401 places, 2296/2296 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, false]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, false]
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:08:09] [INFO ] Invariants computation overflowed in 115 ms
[2024-05-23 02:08:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 02:08:24] [INFO ] [Real]Absence check using state equation in 6799 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5299 transition count 3801
Reduce places removed 1196 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2394 place count 4103 transition count 3799
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3599
Deduced a syphon composed of 200 places in 199 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 76 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 3 with 1800 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 54 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 51 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 4988 place count 2805 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4989 place count 2804 transition count 2698
Applied a total of 4989 rules in 1346 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2804 cols
[2024-05-23 02:08:25] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-23 02:08:26] [INFO ] Implicit Places using invariants in 1410 ms returned []
// Phase 1: matrix 2698 rows 2804 cols
[2024-05-23 02:08:26] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:08:29] [INFO ] Implicit Places using invariants and state equation in 2265 ms returned []
Implicit Place search using SMT with State Equation took 3680 ms to find 0 implicit places.
[2024-05-23 02:08:29] [INFO ] Redundant transitions in 88 ms returned []
// Phase 1: matrix 2698 rows 2804 cols
[2024-05-23 02:08:29] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-23 02:08:30] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5300 places, 2698/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6403 ms. Remains : 2804/5300 places, 2698/4998 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8867 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 121 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, false]
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 794 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 792 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 780 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 89510 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89510 steps, saw 44766 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2698 rows 2804 cols
[2024-05-23 02:08:34] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:08:59] [INFO ] After 24434ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-23 02:08:59] [INFO ] State equation strengthened by 197 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:08:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:08:59] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2698/2698 transitions.
Graph (complete) has 8469 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2802 transition count 2696
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2802 transition count 2695
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2801 transition count 2695
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 1 with 397 rules applied. Total rules applied 402 place count 2801 transition count 2298
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 799 place count 2404 transition count 2298
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 401 times.
Drop transitions removed 401 transitions
Iterating global reduction 2 with 401 rules applied. Total rules applied 1200 place count 2404 transition count 2298
Applied a total of 1200 rules in 612 ms. Remains 2404 /2804 variables (removed 400) and now considering 2298/2698 (removed 400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 612 ms. Remains : 2404/2804 places, 2298/2698 transitions.
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 861 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 106587 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106587 steps, saw 53344 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2298 rows 2404 cols
[2024-05-23 02:09:04] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:09:29] [INFO ] After 24517ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-23 02:09:29] [INFO ] State equation strengthened by 398 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:09:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:09:29] [INFO ] After 25041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 2298/2298 transitions.
Applied a total of 0 rules in 193 ms. Remains 2404 /2404 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 2404/2404 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 2298/2298 transitions.
Applied a total of 0 rules in 187 ms. Remains 2404 /2404 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
// Phase 1: matrix 2298 rows 2404 cols
[2024-05-23 02:09:29] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:09:52] [INFO ] Implicit Places using invariants in 22793 ms returned []
// Phase 1: matrix 2298 rows 2404 cols
[2024-05-23 02:09:52] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:10:15] [INFO ] Implicit Places using invariants and state equation in 22930 ms returned []
Implicit Place search using SMT with State Equation took 45749 ms to find 0 implicit places.
[2024-05-23 02:10:15] [INFO ] Redundant transitions in 99 ms returned []
// Phase 1: matrix 2298 rows 2404 cols
[2024-05-23 02:10:15] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:10:16] [INFO ] Dead Transitions using invariants and state equation in 1502 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47548 ms. Remains : 2404/2404 places, 2298/2298 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 106 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, false]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, false]
// Phase 1: matrix 2698 rows 2804 cols
[2024-05-23 02:10:17] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-23 02:10:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 02:10:32] [INFO ] [Real]Absence check using state equation in 10534 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, false]
Stuttering criterion allowed to conclude after 47 steps with 5 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-01 finished in 286549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||X(G((!p1||F(p2))))) U p1))'
Support contains 6 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1191 transitions
Trivial Post-agglo rules discarded 1191 transitions
Performed 1191 trivial Post agglomeration. Transition count delta: 1191
Iterating post reduction 0 with 1191 rules applied. Total rules applied 1191 place count 5299 transition count 3806
Reduce places removed 1191 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1194 rules applied. Total rules applied 2385 place count 4108 transition count 3803
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2388 place count 4105 transition count 3803
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2388 place count 4105 transition count 3602
Deduced a syphon composed of 201 places in 171 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 65 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 62 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 47 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 4984 place count 2807 transition count 2701
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4985 place count 2807 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4986 place count 2806 transition count 2700
Applied a total of 4986 rules in 1339 ms. Remains 2806 /5300 variables (removed 2494) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2806 cols
[2024-05-23 02:10:34] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-23 02:10:35] [INFO ] Implicit Places using invariants in 1340 ms returned []
// Phase 1: matrix 2700 rows 2806 cols
[2024-05-23 02:10:35] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-23 02:10:37] [INFO ] Implicit Places using invariants and state equation in 2246 ms returned []
Implicit Place search using SMT with State Equation took 3586 ms to find 0 implicit places.
[2024-05-23 02:10:37] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 2700 rows 2806 cols
[2024-05-23 02:10:37] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-23 02:10:39] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2806/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6225 ms. Remains : 2806/5300 places, 2700/4998 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1127 1) (GEQ s1138 1)), p0:(AND (GEQ s1719 1) (GEQ s1730 1)), p2:(AND (GEQ s2363 1) (GEQ s2405 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 153 steps with 18 reset in 1 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-02 finished in 6427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1 U p2)))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1195 rules applied. Total rules applied 1195 place count 5299 transition count 3802
Reduce places removed 1195 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2391 place count 4104 transition count 3801
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2392 place count 4103 transition count 3801
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2392 place count 4103 transition count 3601
Deduced a syphon composed of 200 places in 179 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2792 place count 3903 transition count 3601
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 63 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 3 with 1804 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 57 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 53 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4990 place count 2804 transition count 2699
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4991 place count 2804 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4992 place count 2803 transition count 2698
Applied a total of 4992 rules in 1413 ms. Remains 2803 /5300 variables (removed 2497) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2803 cols
[2024-05-23 02:10:40] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-23 02:10:42] [INFO ] Implicit Places using invariants in 1433 ms returned []
// Phase 1: matrix 2698 rows 2803 cols
[2024-05-23 02:10:42] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:10:44] [INFO ] Implicit Places using invariants and state equation in 2334 ms returned []
Implicit Place search using SMT with State Equation took 3769 ms to find 0 implicit places.
[2024-05-23 02:10:44] [INFO ] Redundant transitions in 86 ms returned []
// Phase 1: matrix 2698 rows 2803 cols
[2024-05-23 02:10:44] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:10:45] [INFO ] Dead Transitions using invariants and state equation in 1288 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5300 places, 2698/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6566 ms. Remains : 2803/5300 places, 2698/4998 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2748 1) (GEQ s2758 1)), p2:(GEQ s916 1), p1:(LT s2225 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-03 finished in 6727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(p1||X(F((p2||G(p3))))))))'
Support contains 7 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1190 transitions
Trivial Post-agglo rules discarded 1190 transitions
Performed 1190 trivial Post agglomeration. Transition count delta: 1190
Iterating post reduction 0 with 1190 rules applied. Total rules applied 1190 place count 5299 transition count 3807
Reduce places removed 1190 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1194 rules applied. Total rules applied 2384 place count 4109 transition count 3803
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2388 place count 4105 transition count 3803
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2388 place count 4105 transition count 3602
Deduced a syphon composed of 201 places in 177 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 65 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 51 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 47 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4988 place count 2805 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4989 place count 2804 transition count 2700
Applied a total of 4989 rules in 1255 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:10:47] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-23 02:10:48] [INFO ] Implicit Places using invariants in 1456 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:10:48] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:10:51] [INFO ] Implicit Places using invariants and state equation in 2416 ms returned []
Implicit Place search using SMT with State Equation took 3873 ms to find 0 implicit places.
[2024-05-23 02:10:51] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:10:51] [INFO ] Invariants computation overflowed in 60 ms
[2024-05-23 02:10:52] [INFO ] Dead Transitions using invariants and state equation in 1325 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6546 ms. Remains : 2804/5300 places, 2700/4998 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1541 1), p1:(AND (GEQ s372 1) (GEQ s416 1)), p2:(AND (GEQ s632 1) (GEQ s639 1)), p3:(OR (LT s4 1) (LT s2764 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13911 reset in 370 ms.
Product exploration explored 100000 steps with 13853 reset in 353 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X p0), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 130 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 1403 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 790 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 801 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 809 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 86732 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86732 steps, saw 43375 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:10:57] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-23 02:11:22] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 02:11:47] [INFO ] After 24476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 02:11:47] [INFO ] State equation strengthened by 196 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-23 02:11:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:11:47] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8477 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2802 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2802 transition count 2697
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2801 transition count 2697
Free-agglomeration rule (complex) applied 395 times.
Iterating global reduction 1 with 395 rules applied. Total rules applied 400 place count 2801 transition count 2302
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 795 place count 2406 transition count 2302
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1194 place count 2406 transition count 2302
Applied a total of 1194 rules in 552 ms. Remains 2406 /2804 variables (removed 398) and now considering 2302/2700 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 552 ms. Remains : 2406/2804 places, 2302/2700 transitions.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 101166 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101166 steps, saw 50628 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2302 rows 2406 cols
[2024-05-23 02:11:51] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-23 02:11:57] [INFO ] After 4973ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-23 02:11:57] [INFO ] State equation strengthened by 397 read => feed constraints.
[2024-05-23 02:12:06] [INFO ] After 9120ms SMT Verify possible using 397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 02:12:06] [INFO ] After 14515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 02:12:31] [INFO ] After 24536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-23 02:12:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:12:31] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1340 ms.
Support contains 7 out of 2406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 167 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 163 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
// Phase 1: matrix 2302 rows 2406 cols
[2024-05-23 02:12:32] [INFO ] Invariants computation overflowed in 59 ms
[2024-05-23 02:12:44] [INFO ] Implicit Places using invariants in 11825 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2024-05-23 02:12:44] [INFO ] Invariants computation overflowed in 59 ms
[2024-05-23 02:12:57] [INFO ] Implicit Places using invariants and state equation in 12581 ms returned []
Implicit Place search using SMT with State Equation took 24407 ms to find 0 implicit places.
[2024-05-23 02:12:57] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2024-05-23 02:12:57] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-23 02:12:58] [INFO ] Dead Transitions using invariants and state equation in 1317 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25980 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X p0), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 118 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Applied a total of 0 rules in 135 ms. Remains 2804 /2804 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:12:59] [INFO ] Invariants computation overflowed in 63 ms
[2024-05-23 02:13:00] [INFO ] Implicit Places using invariants in 1461 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:13:00] [INFO ] Invariants computation overflowed in 60 ms
[2024-05-23 02:13:03] [INFO ] Implicit Places using invariants and state equation in 2414 ms returned []
Implicit Place search using SMT with State Equation took 3877 ms to find 0 implicit places.
[2024-05-23 02:13:03] [INFO ] Redundant transitions in 89 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:13:03] [INFO ] Invariants computation overflowed in 65 ms
[2024-05-23 02:13:04] [INFO ] Dead Transitions using invariants and state equation in 1285 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5400 ms. Remains : 2804/2804 places, 2700/2700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X p0), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 87 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 1396 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 814 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 787 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 820 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 800 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 89366 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89366 steps, saw 44693 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:13:08] [INFO ] Invariants computation overflowed in 57 ms
[2024-05-23 02:13:33] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 02:13:58] [INFO ] After 24445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 02:13:58] [INFO ] State equation strengthened by 196 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:13:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:13:58] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8477 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2802 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2802 transition count 2697
Deduced a syphon composed of 1 places in 51 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2801 transition count 2697
Free-agglomeration rule (complex) applied 395 times.
Iterating global reduction 1 with 395 rules applied. Total rules applied 400 place count 2801 transition count 2302
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 795 place count 2406 transition count 2302
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1194 place count 2406 transition count 2302
Applied a total of 1194 rules in 563 ms. Remains 2406 /2804 variables (removed 398) and now considering 2302/2700 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 563 ms. Remains : 2406/2804 places, 2302/2700 transitions.
Incomplete random walk after 10000 steps, including 1278 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 810 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 105654 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105654 steps, saw 52878 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2302 rows 2406 cols
[2024-05-23 02:14:02] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-23 02:14:08] [INFO ] After 5009ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-23 02:14:08] [INFO ] State equation strengthened by 397 read => feed constraints.
[2024-05-23 02:14:17] [INFO ] After 9240ms SMT Verify possible using 397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 02:14:17] [INFO ] After 14635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 02:14:42] [INFO ] After 24583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:14:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:14:42] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1317 ms.
Support contains 7 out of 2406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 157 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 158 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
// Phase 1: matrix 2302 rows 2406 cols
[2024-05-23 02:14:44] [INFO ] Invariants computation overflowed in 59 ms
[2024-05-23 02:14:55] [INFO ] Implicit Places using invariants in 11742 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2024-05-23 02:14:55] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-23 02:15:08] [INFO ] Implicit Places using invariants and state equation in 12575 ms returned []
Implicit Place search using SMT with State Equation took 24320 ms to find 0 implicit places.
[2024-05-23 02:15:08] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2024-05-23 02:15:08] [INFO ] Invariants computation overflowed in 56 ms
[2024-05-23 02:15:09] [INFO ] Dead Transitions using invariants and state equation in 1329 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25907 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X p0), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 13975 reset in 242 ms.
Product exploration explored 100000 steps with 13807 reset in 251 ms.
Built C files in :
/tmp/ltsmin7676396668801830104
[2024-05-23 02:15:10] [INFO ] Too many transitions (2700) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:15:10] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7676396668801830104
Running compilation step : cd /tmp/ltsmin7676396668801830104;'/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/ltsmin7676396668801830104;'/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/ltsmin7676396668801830104;'/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 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Applied a total of 0 rules in 141 ms. Remains 2804 /2804 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:15:14] [INFO ] Invariants computation overflowed in 62 ms
[2024-05-23 02:15:15] [INFO ] Implicit Places using invariants in 1450 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:15:15] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:15:17] [INFO ] Implicit Places using invariants and state equation in 2186 ms returned []
Implicit Place search using SMT with State Equation took 3650 ms to find 0 implicit places.
[2024-05-23 02:15:17] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:15:17] [INFO ] Invariants computation overflowed in 65 ms
[2024-05-23 02:15:19] [INFO ] Dead Transitions using invariants and state equation in 1305 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5199 ms. Remains : 2804/2804 places, 2700/2700 transitions.
Built C files in :
/tmp/ltsmin967164897441188067
[2024-05-23 02:15:19] [INFO ] Too many transitions (2700) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:15:19] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin967164897441188067
Running compilation step : cd /tmp/ltsmin967164897441188067;'/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/ltsmin967164897441188067;'/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/ltsmin967164897441188067;'/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-23 02:15:22] [INFO ] Flatten gal took : 94 ms
[2024-05-23 02:15:22] [INFO ] Flatten gal took : 97 ms
[2024-05-23 02:15:22] [INFO ] Time to serialize gal into /tmp/LTL15335558185486039897.gal : 25 ms
[2024-05-23 02:15:22] [INFO ] Time to serialize properties into /tmp/LTL1718918467904501796.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/LTL15335558185486039897.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14417550085690859353.hoa' '-atoms' '/tmp/LTL1718918467904501796.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...319
Loading property file /tmp/LTL1718918467904501796.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14417550085690859353.hoa
Detected timeout of ITS tools.
[2024-05-23 02:15:38] [INFO ] Flatten gal took : 157 ms
[2024-05-23 02:15:38] [INFO ] Flatten gal took : 91 ms
[2024-05-23 02:15:38] [INFO ] Time to serialize gal into /tmp/LTL8051534154329712086.gal : 17 ms
[2024-05-23 02:15:38] [INFO ] Time to serialize properties into /tmp/LTL10353950051294464236.ltl : 2 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/LTL8051534154329712086.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10353950051294464236.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(p3613<1)")&&((X(F(("((p2069>=1)&&(p2075>=1))")||(G("((p1005<1)||(p932<1))")))))||("((p1626>=1)&&(p1696>=1))")))))
Formula 0 simplified : F(!"(p3613<1)" | (!"((p1626>=1)&&(p1696>=1))" & XG(!"((p2069>=1)&&(p2075>=1))" & F!"((p1005<1)||(p932<1))")))
Detected timeout of ITS tools.
[2024-05-23 02:15:53] [INFO ] Flatten gal took : 86 ms
[2024-05-23 02:15:53] [INFO ] Applying decomposition
[2024-05-23 02:15:53] [INFO ] Flatten gal took : 90 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11505423462511104898.txt' '-o' '/tmp/graph11505423462511104898.bin' '-w' '/tmp/graph11505423462511104898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11505423462511104898.bin' '-l' '-1' '-v' '-w' '/tmp/graph11505423462511104898.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:15:53] [INFO ] Decomposing Gal with order
[2024-05-23 02:15:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:15:54] [INFO ] Removed a total of 2068 redundant transitions.
[2024-05-23 02:15:54] [INFO ] Flatten gal took : 557 ms
[2024-05-23 02:15:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 91 ms.
[2024-05-23 02:15:55] [INFO ] Time to serialize gal into /tmp/LTL8323363019980894314.gal : 51 ms
[2024-05-23 02:15:55] [INFO ] Time to serialize properties into /tmp/LTL6278316900679294605.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8323363019980894314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6278316900679294605.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(i11.i1.i1.u563.p3613<1)")&&((X(F(("((i5.i0.i1.u237.p2069>=1)&&(i5.i0.i3.u222.p2075>=1))")||(G("((i1.i1.i3.u1.p1005<1)||(i1.i1....228
Formula 0 simplified : F(!"(i11.i1.i1.u563.p3613<1)" | (!"((i3.u134.p1626>=1)&&(i3.u150.p1696>=1))" & XG(!"((i5.i0.i1.u237.p2069>=1)&&(i5.i0.i3.u222.p2075>...218
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9966411533791337124
[2024-05-23 02:16:10] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9966411533791337124
Running compilation step : cd /tmp/ltsmin9966411533791337124;'/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/ltsmin9966411533791337124;'/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/ltsmin9966411533791337124;'/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 DoubleExponent-PT-100-LTLFireability-04 finished in 327322 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(X(X(G(!p0))))) U p0))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 848 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:16:14] [INFO ] Invariants computation overflowed in 108 ms
[2024-05-23 02:16:16] [INFO ] Implicit Places using invariants in 2186 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:16:16] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-23 02:16:17] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 3244 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:16:17] [INFO ] Invariants computation overflowed in 111 ms
[2024-05-23 02:16:20] [INFO ] Dead Transitions using invariants and state equation in 3339 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7434 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), true, p0, p0, true]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s3342 1) (GEQ s3422 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3307 reset in 308 ms.
Product exploration explored 100000 steps with 3339 reset in 310 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), true]
False Knowledge obtained : []
Property proved to be false thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 1726 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-100-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLFireability-05 finished in 10454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 195 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 64 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4604 place count 2997 transition count 2695
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 58 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4806 place count 2896 transition count 2695
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 47 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5000 place count 2799 transition count 2695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5001 place count 2798 transition count 2694
Applied a total of 5001 rules in 1217 ms. Remains 2798 /5300 variables (removed 2502) and now considering 2694/4998 (removed 2304) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:16:24] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:16:26] [INFO ] Implicit Places using invariants in 1464 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:16:26] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:16:28] [INFO ] Implicit Places using invariants and state equation in 2192 ms returned []
Implicit Place search using SMT with State Equation took 3670 ms to find 0 implicit places.
[2024-05-23 02:16:28] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:16:28] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:16:29] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2798/5300 places, 2694/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6144 ms. Remains : 2798/5300 places, 2694/4998 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s452 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13897 reset in 203 ms.
Product exploration explored 100000 steps with 13893 reset in 219 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8871 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1412 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 821 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 114641 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114641 steps, saw 57332 distinct states, run finished after 3003 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:16:33] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:16:35] [INFO ] After 1525ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:16:35] [INFO ] State equation strengthened by 198 read => feed constraints.
[2024-05-23 02:16:44] [INFO ] After 9061ms SMT Verify possible using 198 Read/Feed constraints in real domain returned unsat :0 sat :0
[2024-05-23 02:16:44] [INFO ] After 10889ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Graph (complete) has 8471 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2796 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2796 transition count 2691
Deduced a syphon composed of 1 places in 47 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2795 transition count 2295
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2399 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 2 with 400 rules applied. Total rules applied 1197 place count 2399 transition count 2295
Applied a total of 1197 rules in 697 ms. Remains 2399 /2798 variables (removed 399) and now considering 2295/2694 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 697 ms. Remains : 2399/2798 places, 2295/2694 transitions.
Incomplete random walk after 10000 steps, including 1255 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 137059 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137059 steps, saw 68563 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:16:48] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:16:58] [INFO ] After 9169ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:16:58] [INFO ] State equation strengthened by 398 read => feed constraints.
[2024-05-23 02:17:07] [INFO ] After 9395ms SMT Verify possible using 398 Read/Feed constraints in real domain returned unsat :0 sat :0
[2024-05-23 02:17:07] [INFO ] After 18882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 218 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 208 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:17:07] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:17:31] [INFO ] Implicit Places using invariants in 23609 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:17:31] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:17:55] [INFO ] Implicit Places using invariants and state equation in 23746 ms returned []
Implicit Place search using SMT with State Equation took 47363 ms to find 0 implicit places.
[2024-05-23 02:17:55] [INFO ] Redundant transitions in 104 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:17:55] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:17:56] [INFO ] Dead Transitions using invariants and state equation in 1498 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49182 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 200 Pre rules applied. Total rules applied 0 place count 2399 transition count 2095
Deduced a syphon composed of 200 places in 89 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2199 transition count 2095
Applied a total of 400 rules in 351 ms. Remains 2199 /2399 variables (removed 200) and now considering 2095/2295 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2199 cols
[2024-05-23 02:17:57] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:17:58] [INFO ] After 1239ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:18:01] [INFO ] Deduced a trap composed of 5 places in 2351 ms of which 25 ms to minimize.
[2024-05-23 02:18:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2658 ms
[2024-05-23 02:18:01] [INFO ] After 3943ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:18:01] [INFO ] After 4193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:18:03] [INFO ] After 1225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:18:05] [INFO ] Deduced a trap composed of 5 places in 2254 ms of which 3 ms to minimize.
[2024-05-23 02:18:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2500 ms
[2024-05-23 02:18:05] [INFO ] After 3777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-23 02:18:05] [INFO ] After 4111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Applied a total of 0 rules in 135 ms. Remains 2798 /2798 variables (removed 0) and now considering 2694/2694 (removed 0) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:18:06] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-23 02:18:07] [INFO ] Implicit Places using invariants in 1415 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:18:07] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:18:09] [INFO ] Implicit Places using invariants and state equation in 2171 ms returned []
Implicit Place search using SMT with State Equation took 3588 ms to find 0 implicit places.
[2024-05-23 02:18:09] [INFO ] Redundant transitions in 88 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:18:10] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:18:11] [INFO ] Dead Transitions using invariants and state equation in 1237 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5067 ms. Remains : 2798/2798 places, 2694/2694 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8871 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1415 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 803 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 115279 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115279 steps, saw 57650 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:18:14] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:18:16] [INFO ] After 1570ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:18:16] [INFO ] State equation strengthened by 198 read => feed constraints.
[2024-05-23 02:18:25] [INFO ] After 9034ms SMT Verify possible using 198 Read/Feed constraints in real domain returned unsat :0 sat :0
[2024-05-23 02:18:25] [INFO ] After 10937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Graph (complete) has 8471 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2796 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2796 transition count 2691
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2795 transition count 2295
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2399 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 2 with 400 rules applied. Total rules applied 1197 place count 2399 transition count 2295
Applied a total of 1197 rules in 656 ms. Remains 2399 /2798 variables (removed 399) and now considering 2295/2694 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 ms. Remains : 2399/2798 places, 2295/2694 transitions.
Incomplete random walk after 10000 steps, including 1252 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 137877 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137877 steps, saw 68964 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:18:29] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:18:38] [INFO ] After 8992ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:18:38] [INFO ] State equation strengthened by 398 read => feed constraints.
[2024-05-23 02:18:48] [INFO ] After 9392ms SMT Verify possible using 398 Read/Feed constraints in real domain returned unsat :0 sat :0
[2024-05-23 02:18:48] [INFO ] After 18689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 193 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 204 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:18:48] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:19:11] [INFO ] Implicit Places using invariants in 22764 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:19:11] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:19:35] [INFO ] Implicit Places using invariants and state equation in 23907 ms returned []
Implicit Place search using SMT with State Equation took 46680 ms to find 0 implicit places.
[2024-05-23 02:19:35] [INFO ] Redundant transitions in 102 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:19:35] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:19:36] [INFO ] Dead Transitions using invariants and state equation in 1532 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48535 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 200 Pre rules applied. Total rules applied 0 place count 2399 transition count 2095
Deduced a syphon composed of 200 places in 95 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2199 transition count 2095
Applied a total of 400 rules in 364 ms. Remains 2199 /2399 variables (removed 200) and now considering 2095/2295 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2199 cols
[2024-05-23 02:19:37] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:19:38] [INFO ] After 1265ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:19:41] [INFO ] Deduced a trap composed of 5 places in 2385 ms of which 2 ms to minimize.
[2024-05-23 02:19:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2646 ms
[2024-05-23 02:19:41] [INFO ] After 3963ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:19:41] [INFO ] After 4234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:19:43] [INFO ] After 1219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:19:45] [INFO ] Deduced a trap composed of 5 places in 2257 ms of which 3 ms to minimize.
[2024-05-23 02:19:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2506 ms
[2024-05-23 02:19:45] [INFO ] After 3782ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-23 02:19:45] [INFO ] After 4125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13857 reset in 251 ms.
Product exploration explored 100000 steps with 13907 reset in 259 ms.
Built C files in :
/tmp/ltsmin17047776682555149565
[2024-05-23 02:19:46] [INFO ] Too many transitions (2694) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:19:46] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17047776682555149565
Running compilation step : cd /tmp/ltsmin17047776682555149565;'/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/ltsmin17047776682555149565;'/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/ltsmin17047776682555149565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Applied a total of 0 rules in 136 ms. Remains 2798 /2798 variables (removed 0) and now considering 2694/2694 (removed 0) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:19:49] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:19:51] [INFO ] Implicit Places using invariants in 1394 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:19:51] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:19:53] [INFO ] Implicit Places using invariants and state equation in 2260 ms returned []
Implicit Place search using SMT with State Equation took 3657 ms to find 0 implicit places.
[2024-05-23 02:19:53] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:19:53] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-23 02:19:54] [INFO ] Dead Transitions using invariants and state equation in 1265 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5149 ms. Remains : 2798/2798 places, 2694/2694 transitions.
Built C files in :
/tmp/ltsmin646786705299637454
[2024-05-23 02:19:55] [INFO ] Too many transitions (2694) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:19:55] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin646786705299637454
Running compilation step : cd /tmp/ltsmin646786705299637454;'/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/ltsmin646786705299637454;'/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/ltsmin646786705299637454;'/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-23 02:19:58] [INFO ] Flatten gal took : 80 ms
[2024-05-23 02:19:58] [INFO ] Flatten gal took : 76 ms
[2024-05-23 02:19:58] [INFO ] Time to serialize gal into /tmp/LTL12494178769854627622.gal : 14 ms
[2024-05-23 02:19:58] [INFO ] Time to serialize properties into /tmp/LTL2442817118477052877.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12494178769854627622.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13516394320580513206.hoa' '-atoms' '/tmp/LTL2442817118477052877.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...319
Loading property file /tmp/LTL2442817118477052877.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13516394320580513206.hoa
Detected timeout of ITS tools.
[2024-05-23 02:20:13] [INFO ] Flatten gal took : 72 ms
[2024-05-23 02:20:13] [INFO ] Flatten gal took : 75 ms
[2024-05-23 02:20:13] [INFO ] Time to serialize gal into /tmp/LTL12573006153944860664.gal : 13 ms
[2024-05-23 02:20:13] [INFO ] Time to serialize properties into /tmp/LTL9985516835330301555.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12573006153944860664.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9985516835330301555.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1760<1)"))))
Formula 0 simplified : FG!"(p1760<1)"
Detected timeout of ITS tools.
[2024-05-23 02:20:28] [INFO ] Flatten gal took : 74 ms
[2024-05-23 02:20:28] [INFO ] Applying decomposition
[2024-05-23 02:20:28] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6333424235924119373.txt' '-o' '/tmp/graph6333424235924119373.bin' '-w' '/tmp/graph6333424235924119373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6333424235924119373.bin' '-l' '-1' '-v' '-w' '/tmp/graph6333424235924119373.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:20:29] [INFO ] Decomposing Gal with order
[2024-05-23 02:20:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:20:29] [INFO ] Removed a total of 2061 redundant transitions.
[2024-05-23 02:20:29] [INFO ] Flatten gal took : 148 ms
[2024-05-23 02:20:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 52 ms.
[2024-05-23 02:20:29] [INFO ] Time to serialize gal into /tmp/LTL1922845984985822359.gal : 33 ms
[2024-05-23 02:20:29] [INFO ] Time to serialize properties into /tmp/LTL4728103064867166660.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1922845984985822359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4728103064867166660.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(i4.i0.i1.u158.p1760<1)"))))
Formula 0 simplified : FG!"(i4.i0.i1.u158.p1760<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin260671076895819587
[2024-05-23 02:20:44] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin260671076895819587
Running compilation step : cd /tmp/ltsmin260671076895819587;'/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/ltsmin260671076895819587;'/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/ltsmin260671076895819587;'/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 DoubleExponent-PT-100-LTLFireability-06 finished in 264093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((!(p1 U (X(p1) U X(p2)))||p0)))))'
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 833 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:20:48] [INFO ] Invariants computation overflowed in 95 ms
[2024-05-23 02:20:50] [INFO ] Implicit Places using invariants in 2224 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:20:50] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-23 02:20:51] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 3183 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:20:51] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-23 02:20:54] [INFO ] Dead Transitions using invariants and state equation in 3055 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7079 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2))), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s3936 1) (LT s4014 1)), p1:(AND (GEQ s3826 1) (GEQ s3896 1)), p2:(LT s2877 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3339 reset in 279 ms.
Product exploration explored 100000 steps with 3336 reset in 288 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 153 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 343 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 300 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 270 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 299 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 53141 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53141 steps, saw 26576 distinct states, run finished after 3003 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:21:02] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-23 02:21:27] [INFO ] After 23752ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2024-05-23 02:21:27] [INFO ] After 23756ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:6
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-23 02:21:27] [INFO ] After 25055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:6
[2024-05-23 02:21:52] [INFO ] After 23396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-23 02:21:52] [INFO ] After 23400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 02:21:52] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1200 place count 5297 transition count 3800
Reduce places removed 1196 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2397 place count 4101 transition count 3799
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2398 place count 4100 transition count 3799
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3599
Deduced a syphon composed of 200 places in 174 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3599
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 65 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 3 with 1810 rules applied. Total rules applied 4608 place count 2995 transition count 2694
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 59 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4810 place count 2894 transition count 2694
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 50 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 5004 place count 2797 transition count 2694
Free-agglomeration rule (complex) applied 395 times.
Iterating global reduction 3 with 395 rules applied. Total rules applied 5399 place count 2797 transition count 2299
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 5794 place count 2402 transition count 2299
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 4 with 400 rules applied. Total rules applied 6194 place count 2402 transition count 2299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6195 place count 2401 transition count 2298
Applied a total of 6195 rules in 1633 ms. Remains 2401 /5300 variables (removed 2899) and now considering 2298/4998 (removed 2700) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1635 ms. Remains : 2401/5300 places, 2298/4998 transitions.
Incomplete random walk after 10000 steps, including 1265 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 868 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 94663 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94663 steps, saw 47374 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2298 rows 2401 cols
[2024-05-23 02:21:57] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:22:23] [INFO ] After 25046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 02:22:48] [INFO ] After 24183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-23 02:22:48] [INFO ] State equation strengthened by 397 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-23 02:22:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:22:48] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 2298/2298 transitions.
Applied a total of 0 rules in 159 ms. Remains 2401 /2401 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 2401/2401 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 2298/2298 transitions.
Applied a total of 0 rules in 156 ms. Remains 2401 /2401 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
// Phase 1: matrix 2298 rows 2401 cols
[2024-05-23 02:22:48] [INFO ] Invariants computation overflowed in 62 ms
[2024-05-23 02:23:03] [INFO ] Implicit Places using invariants in 15110 ms returned []
// Phase 1: matrix 2298 rows 2401 cols
[2024-05-23 02:23:03] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:23:19] [INFO ] Implicit Places using invariants and state equation in 15678 ms returned []
Implicit Place search using SMT with State Equation took 30794 ms to find 0 implicit places.
[2024-05-23 02:23:19] [INFO ] Redundant transitions in 88 ms returned []
// Phase 1: matrix 2298 rows 2401 cols
[2024-05-23 02:23:19] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-23 02:23:20] [INFO ] Dead Transitions using invariants and state equation in 1387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32435 ms. Remains : 2401/2401 places, 2298/2298 transitions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 160 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 817 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:23:22] [INFO ] Invariants computation overflowed in 93 ms
[2024-05-23 02:23:24] [INFO ] Implicit Places using invariants in 2071 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:23:24] [INFO ] Invariants computation overflowed in 102 ms
[2024-05-23 02:23:25] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 3081 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:23:25] [INFO ] Invariants computation overflowed in 94 ms
[2024-05-23 02:23:28] [INFO ] Dead Transitions using invariants and state equation in 3035 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6949 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 148 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 327 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 289 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 285 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 53537 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53537 steps, saw 26778 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:23:34] [INFO ] Invariants computation overflowed in 87 ms
[2024-05-23 02:23:59] [INFO ] After 23687ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2024-05-23 02:23:59] [INFO ] After 23692ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:6
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-23 02:23:59] [INFO ] After 25049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:6
[2024-05-23 02:24:24] [INFO ] After 23404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-23 02:24:24] [INFO ] After 23404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-23 02:24:24] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1200 place count 5297 transition count 3800
Reduce places removed 1196 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2397 place count 4101 transition count 3799
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2398 place count 4100 transition count 3799
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3599
Deduced a syphon composed of 200 places in 194 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3599
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 72 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 3 with 1810 rules applied. Total rules applied 4608 place count 2995 transition count 2694
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 62 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4810 place count 2894 transition count 2694
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 54 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 5004 place count 2797 transition count 2694
Free-agglomeration rule (complex) applied 395 times.
Iterating global reduction 3 with 395 rules applied. Total rules applied 5399 place count 2797 transition count 2299
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 5794 place count 2402 transition count 2299
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 4 with 400 rules applied. Total rules applied 6194 place count 2402 transition count 2299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6195 place count 2401 transition count 2298
Applied a total of 6195 rules in 1697 ms. Remains 2401 /5300 variables (removed 2899) and now considering 2298/4998 (removed 2700) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1698 ms. Remains : 2401/5300 places, 2298/4998 transitions.
Incomplete random walk after 10000 steps, including 1328 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 888 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 94423 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94423 steps, saw 47255 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2298 rows 2401 cols
[2024-05-23 02:24:30] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:24:55] [INFO ] After 25042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 02:25:20] [INFO ] After 24198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-23 02:25:20] [INFO ] State equation strengthened by 397 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:25:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:25:20] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 2298/2298 transitions.
Applied a total of 0 rules in 157 ms. Remains 2401 /2401 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 2401/2401 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 2298/2298 transitions.
Applied a total of 0 rules in 157 ms. Remains 2401 /2401 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
// Phase 1: matrix 2298 rows 2401 cols
[2024-05-23 02:25:21] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:25:36] [INFO ] Implicit Places using invariants in 15042 ms returned []
// Phase 1: matrix 2298 rows 2401 cols
[2024-05-23 02:25:36] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:25:51] [INFO ] Implicit Places using invariants and state equation in 15852 ms returned []
Implicit Place search using SMT with State Equation took 30905 ms to find 0 implicit places.
[2024-05-23 02:25:52] [INFO ] Redundant transitions in 83 ms returned []
// Phase 1: matrix 2298 rows 2401 cols
[2024-05-23 02:25:52] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:25:53] [INFO ] Dead Transitions using invariants and state equation in 1373 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32544 ms. Remains : 2401/2401 places, 2298/2298 transitions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 143 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 3303 reset in 262 ms.
Product exploration explored 100000 steps with 3328 reset in 254 ms.
Built C files in :
/tmp/ltsmin8312611243063087065
[2024-05-23 02:25:54] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8312611243063087065
Running compilation step : cd /tmp/ltsmin8312611243063087065;'/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/ltsmin8312611243063087065;'/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/ltsmin8312611243063087065;'/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 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 772 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:25:58] [INFO ] Invariants computation overflowed in 93 ms
[2024-05-23 02:26:00] [INFO ] Implicit Places using invariants in 2170 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:26:00] [INFO ] Invariants computation overflowed in 93 ms
[2024-05-23 02:26:01] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 3138 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:26:01] [INFO ] Invariants computation overflowed in 91 ms
[2024-05-23 02:26:05] [INFO ] Dead Transitions using invariants and state equation in 3264 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7176 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Built C files in :
/tmp/ltsmin1732355604204715239
[2024-05-23 02:26:05] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1732355604204715239
Running compilation step : cd /tmp/ltsmin1732355604204715239;'/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/ltsmin1732355604204715239;'/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/ltsmin1732355604204715239;'/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-23 02:26:08] [INFO ] Flatten gal took : 104 ms
[2024-05-23 02:26:08] [INFO ] Flatten gal took : 107 ms
[2024-05-23 02:26:08] [INFO ] Time to serialize gal into /tmp/LTL14150283076059851911.gal : 18 ms
[2024-05-23 02:26:08] [INFO ] Time to serialize properties into /tmp/LTL12500289991727538931.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14150283076059851911.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9945123881558981050.hoa' '-atoms' '/tmp/LTL12500289991727538931.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...319
Loading property file /tmp/LTL12500289991727538931.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9945123881558981050.hoa
Detected timeout of ITS tools.
[2024-05-23 02:26:24] [INFO ] Flatten gal took : 103 ms
[2024-05-23 02:26:24] [INFO ] Flatten gal took : 129 ms
[2024-05-23 02:26:24] [INFO ] Time to serialize gal into /tmp/LTL9846021568407294451.gal : 21 ms
[2024-05-23 02:26:24] [INFO ] Time to serialize properties into /tmp/LTL5719700452137531329.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9846021568407294451.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5719700452137531329.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(X(G(((!(("((p4442>=1)&&(p4505>=1))")U((X("((p4442>=1)&&(p4505>=1))"))U(X("(p3589<1)")))))||("(p4541<1)"))||("(p4611<1)"))))))
Formula 0 simplified : XF(!"(p4541<1)" & !"(p4611<1)" & ("((p4442>=1)&&(p4505>=1))" U X("((p4442>=1)&&(p4505>=1))" U "(p3589<1)")))
Detected timeout of ITS tools.
[2024-05-23 02:26:40] [INFO ] Flatten gal took : 122 ms
[2024-05-23 02:26:40] [INFO ] Applying decomposition
[2024-05-23 02:26:40] [INFO ] Flatten gal took : 126 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10562638675245381357.txt' '-o' '/tmp/graph10562638675245381357.bin' '-w' '/tmp/graph10562638675245381357.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10562638675245381357.bin' '-l' '-1' '-v' '-w' '/tmp/graph10562638675245381357.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:26:40] [INFO ] Decomposing Gal with order
[2024-05-23 02:26:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:26:41] [INFO ] Removed a total of 1411 redundant transitions.
[2024-05-23 02:26:42] [INFO ] Flatten gal took : 248 ms
[2024-05-23 02:26:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 102 ms.
[2024-05-23 02:26:42] [INFO ] Time to serialize gal into /tmp/LTL12637403237392288126.gal : 119 ms
[2024-05-23 02:26:42] [INFO ] Time to serialize properties into /tmp/LTL14827374942608202603.ltl : 2 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/LTL12637403237392288126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14827374942608202603.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(X(G(((!(("((i21.i1.i1.i2.u1635.p4442>=1)&&(i21.i1.i1.i2.u1667.p4505>=1))")U((X("((i21.i1.i1.i2.u1635.p4442>=1)&&(i21.i1.i1.i2.u16...284
Formula 0 simplified : XF(!"(i22.i0.i0.i0.u1712.p4541<1)" & !"(i22.i0.i0.i3.u1716.p4611<1)" & ("((i21.i1.i1.i2.u1635.p4442>=1)&&(i21.i1.i1.i2.u1667.p4505>=...264
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12178649912813857522
[2024-05-23 02:26:57] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12178649912813857522
Running compilation step : cd /tmp/ltsmin12178649912813857522;'/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/ltsmin12178649912813857522;'/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/ltsmin12178649912813857522;'/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 DoubleExponent-PT-100-LTLFireability-07 finished in 372672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 768 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:01] [INFO ] Invariants computation overflowed in 102 ms
[2024-05-23 02:27:03] [INFO ] Implicit Places using invariants in 2045 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:03] [INFO ] Invariants computation overflowed in 93 ms
[2024-05-23 02:27:04] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 3093 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:04] [INFO ] Invariants computation overflowed in 89 ms
[2024-05-23 02:27:07] [INFO ] Dead Transitions using invariants and state equation in 3430 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7297 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s3034 1) (GEQ s4089 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-08 finished in 7906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 758 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:09] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-23 02:27:11] [INFO ] Implicit Places using invariants in 2055 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:11] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-23 02:27:12] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 3002 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:12] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-23 02:27:15] [INFO ] Dead Transitions using invariants and state equation in 3054 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6825 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2206 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-09 finished in 7291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 770 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:16] [INFO ] Invariants computation overflowed in 90 ms
[2024-05-23 02:27:18] [INFO ] Implicit Places using invariants in 2061 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:18] [INFO ] Invariants computation overflowed in 85 ms
[2024-05-23 02:27:19] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 3016 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:19] [INFO ] Invariants computation overflowed in 87 ms
[2024-05-23 02:27:22] [INFO ] Dead Transitions using invariants and state equation in 3056 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6866 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s4937 1) (LT s5015 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3313 reset in 239 ms.
Product exploration explored 100000 steps with 3290 reset in 254 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 329 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 67049 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67049 steps, saw 33530 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:27] [INFO ] Invariants computation overflowed in 93 ms
[2024-05-23 02:27:52] [INFO ] After 25041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 175 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 60 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 2 with 1810 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 55 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 51 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 5405 place count 2795 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 5802 place count 2398 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 3 with 400 rules applied. Total rules applied 6202 place count 2398 transition count 2295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6203 place count 2397 transition count 2294
Applied a total of 6203 rules in 1654 ms. Remains 2397 /5300 variables (removed 2903) and now considering 2294/4998 (removed 2704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1654 ms. Remains : 2397/5300 places, 2294/4998 transitions.
Incomplete random walk after 10000 steps, including 1273 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 873 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 137316 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137316 steps, saw 68696 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:27:57] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:28:10] [INFO ] After 13471ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 183 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 171 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:28:11] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:28:27] [INFO ] Implicit Places using invariants in 16121 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:28:27] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:28:44] [INFO ] Implicit Places using invariants and state equation in 16739 ms returned []
Implicit Place search using SMT with State Equation took 32882 ms to find 0 implicit places.
[2024-05-23 02:28:44] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:28:44] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-23 02:28:45] [INFO ] Dead Transitions using invariants and state equation in 1382 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34530 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 198 Pre rules applied. Total rules applied 0 place count 2397 transition count 2096
Deduced a syphon composed of 198 places in 76 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 2199 transition count 2096
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 397 place count 2199 transition count 2095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 398 place count 2198 transition count 2095
Applied a total of 398 rules in 464 ms. Remains 2198 /2397 variables (removed 199) and now considering 2095/2294 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2198 cols
[2024-05-23 02:28:46] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:28:58] [INFO ] After 12694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 774 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:29:00] [INFO ] Invariants computation overflowed in 94 ms
[2024-05-23 02:29:02] [INFO ] Implicit Places using invariants in 2044 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:29:02] [INFO ] Invariants computation overflowed in 87 ms
[2024-05-23 02:29:03] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 3011 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:29:03] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-23 02:29:06] [INFO ] Dead Transitions using invariants and state equation in 2992 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6800 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 67354 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67354 steps, saw 33683 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:29:10] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-23 02:29:35] [INFO ] After 25049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 184 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 61 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 2 with 1810 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 55 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 51 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 5405 place count 2795 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 5802 place count 2398 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 3 with 400 rules applied. Total rules applied 6202 place count 2398 transition count 2295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6203 place count 2397 transition count 2294
Applied a total of 6203 rules in 1607 ms. Remains 2397 /5300 variables (removed 2903) and now considering 2294/4998 (removed 2704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1608 ms. Remains : 2397/5300 places, 2294/4998 transitions.
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132187 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132187 steps, saw 66120 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:29:40] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 02:29:55] [INFO ] After 14396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 173 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 168 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:29:55] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:30:11] [INFO ] Implicit Places using invariants in 16167 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:30:11] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 02:30:28] [INFO ] Implicit Places using invariants and state equation in 17145 ms returned []
Implicit Place search using SMT with State Equation took 33320 ms to find 0 implicit places.
[2024-05-23 02:30:28] [INFO ] Redundant transitions in 89 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:30:28] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:30:30] [INFO ] Dead Transitions using invariants and state equation in 1427 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35020 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 198 Pre rules applied. Total rules applied 0 place count 2397 transition count 2096
Deduced a syphon composed of 198 places in 76 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 2199 transition count 2096
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 397 place count 2199 transition count 2095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 398 place count 2198 transition count 2095
Applied a total of 398 rules in 452 ms. Remains 2198 /2397 variables (removed 199) and now considering 2095/2294 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2198 cols
[2024-05-23 02:30:30] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-23 02:30:43] [INFO ] After 12874ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3291 reset in 386 ms.
Product exploration explored 100000 steps with 3334 reset in 393 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1197 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1197 rules applied. Total rules applied 1197 place count 5300 transition count 4998
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 1197 place count 5300 transition count 5198
Deduced a syphon composed of 1398 places in 246 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 1398 place count 5300 transition count 5198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1400 place count 5298 transition count 5196
Deduced a syphon composed of 1396 places in 241 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1402 place count 5298 transition count 5196
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: -200
Deduced a syphon composed of 2298 places in 148 ms
Iterating global reduction 1 with 902 rules applied. Total rules applied 2304 place count 5298 transition count 5396
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2305 place count 5297 transition count 5395
Deduced a syphon composed of 2297 places in 147 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2306 place count 5297 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -664
Deduced a syphon composed of 2398 places in 135 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2407 place count 5297 transition count 6059
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2508 place count 5196 transition count 5857
Deduced a syphon composed of 2297 places in 132 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2609 place count 5196 transition count 5857
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -627
Deduced a syphon composed of 2396 places in 141 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2708 place count 5196 transition count 6484
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 2807 place count 5097 transition count 6286
Deduced a syphon composed of 2297 places in 125 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2906 place count 5097 transition count 6286
Deduced a syphon composed of 2297 places in 133 ms
Applied a total of 2906 rules in 4510 ms. Remains 5097 /5300 variables (removed 203) and now considering 6286/4998 (removed -1288) transitions.
[2024-05-23 02:30:50] [INFO ] Redundant transitions in 430 ms returned []
// Phase 1: matrix 6286 rows 5097 cols
[2024-05-23 02:30:50] [INFO ] Invariants computation overflowed in 102 ms
[2024-05-23 02:30:54] [INFO ] Dead Transitions using invariants and state equation in 3855 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5097/5300 places, 6286/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8805 ms. Remains : 5097/5300 places, 6286/4998 transitions.
Built C files in :
/tmp/ltsmin3504153177401420505
[2024-05-23 02:30:54] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3504153177401420505
Running compilation step : cd /tmp/ltsmin3504153177401420505;'/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/ltsmin3504153177401420505;'/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/ltsmin3504153177401420505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 833 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:30:58] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-23 02:31:00] [INFO ] Implicit Places using invariants in 2152 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:31:00] [INFO ] Invariants computation overflowed in 95 ms
[2024-05-23 02:31:01] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 3124 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:31:01] [INFO ] Invariants computation overflowed in 94 ms
[2024-05-23 02:31:04] [INFO ] Dead Transitions using invariants and state equation in 3249 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7208 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Built C files in :
/tmp/ltsmin15163532706134451601
[2024-05-23 02:31:04] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15163532706134451601
Running compilation step : cd /tmp/ltsmin15163532706134451601;'/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/ltsmin15163532706134451601;'/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/ltsmin15163532706134451601;'/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-23 02:31:07] [INFO ] Flatten gal took : 119 ms
[2024-05-23 02:31:08] [INFO ] Flatten gal took : 123 ms
[2024-05-23 02:31:08] [INFO ] Time to serialize gal into /tmp/LTL10986946551317764478.gal : 19 ms
[2024-05-23 02:31:08] [INFO ] Time to serialize properties into /tmp/LTL2602619406372648480.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/LTL10986946551317764478.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3293026596351746534.hoa' '-atoms' '/tmp/LTL2602619406372648480.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2602619406372648480.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3293026596351746534.hoa
Detected timeout of ITS tools.
[2024-05-23 02:31:24] [INFO ] Flatten gal took : 111 ms
[2024-05-23 02:31:24] [INFO ] Flatten gal took : 122 ms
[2024-05-23 02:31:24] [INFO ] Time to serialize gal into /tmp/LTL6118250575759518701.gal : 19 ms
[2024-05-23 02:31:24] [INFO ] Time to serialize properties into /tmp/LTL4481536716076354526.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6118250575759518701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4481536716076354526.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((p672<1)||(p742<1))")))))
Formula 0 simplified : XXF!"((p672<1)||(p742<1))"
Detected timeout of ITS tools.
[2024-05-23 02:31:39] [INFO ] Flatten gal took : 97 ms
[2024-05-23 02:31:39] [INFO ] Applying decomposition
[2024-05-23 02:31:39] [INFO ] Flatten gal took : 102 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11543229594556131448.txt' '-o' '/tmp/graph11543229594556131448.bin' '-w' '/tmp/graph11543229594556131448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11543229594556131448.bin' '-l' '-1' '-v' '-w' '/tmp/graph11543229594556131448.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:31:39] [INFO ] Decomposing Gal with order
[2024-05-23 02:31:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:31:41] [INFO ] Removed a total of 1399 redundant transitions.
[2024-05-23 02:31:41] [INFO ] Flatten gal took : 192 ms
[2024-05-23 02:31:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 56 ms.
[2024-05-23 02:31:41] [INFO ] Time to serialize gal into /tmp/LTL4026358441345792034.gal : 40 ms
[2024-05-23 02:31:41] [INFO ] Time to serialize properties into /tmp/LTL14543897976303287983.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4026358441345792034.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14543897976303287983.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i29.i0.i2.i6.u2058.p672<1)||(i29.i0.i2.i6.u2125.p742<1))")))))
Formula 0 simplified : XXF!"((i29.i0.i2.i6.u2058.p672<1)||(i29.i0.i2.i6.u2125.p742<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15910650484330931297
[2024-05-23 02:31:56] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15910650484330931297
Running compilation step : cd /tmp/ltsmin15910650484330931297;'/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/ltsmin15910650484330931297;'/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/ltsmin15910650484330931297;'/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 DoubleExponent-PT-100-LTLFireability-10 finished in 283785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||G(F(p2))||p0))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1193 transitions
Trivial Post-agglo rules discarded 1193 transitions
Performed 1193 trivial Post agglomeration. Transition count delta: 1193
Iterating post reduction 0 with 1193 rules applied. Total rules applied 1193 place count 5299 transition count 3804
Reduce places removed 1193 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1195 rules applied. Total rules applied 2388 place count 4106 transition count 3802
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2390 place count 4104 transition count 3802
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2390 place count 4104 transition count 3602
Deduced a syphon composed of 200 places in 174 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 65 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 56 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 51 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4986 place count 2806 transition count 2701
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 4988 place count 2806 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4989 place count 2805 transition count 2700
Applied a total of 4989 rules in 1348 ms. Remains 2805 /5300 variables (removed 2495) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2805 cols
[2024-05-23 02:32:00] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-23 02:32:02] [INFO ] Implicit Places using invariants in 1461 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2024-05-23 02:32:02] [INFO ] Invariants computation overflowed in 56 ms
[2024-05-23 02:32:04] [INFO ] Implicit Places using invariants and state equation in 2430 ms returned []
Implicit Place search using SMT with State Equation took 3892 ms to find 0 implicit places.
[2024-05-23 02:32:04] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2024-05-23 02:32:04] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-23 02:32:06] [INFO ] Dead Transitions using invariants and state equation in 1302 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6657 ms. Remains : 2805/5300 places, 2700/4998 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s152 1), p2:(GEQ s101 1), p0:(OR (LT s2029 1) (LT s2087 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13945 reset in 176 ms.
Product exploration explored 100000 steps with 13882 reset in 200 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1362 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 808 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 99630 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99630 steps, saw 49826 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2700 rows 2805 cols
[2024-05-23 02:32:10] [INFO ] Invariants computation overflowed in 54 ms
[2024-05-23 02:32:35] [INFO ] After 25044ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:33:00] [INFO ] After 24642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:33:00] [INFO ] State equation strengthened by 197 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-23 02:33:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:33:00] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Graph (complete) has 8475 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2803 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2803 transition count 2697
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2802 transition count 2697
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 1 with 400 rules applied. Total rules applied 405 place count 2802 transition count 2297
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 805 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1204 place count 2402 transition count 2297
Applied a total of 1204 rules in 649 ms. Remains 2402 /2805 variables (removed 403) and now considering 2297/2700 (removed 403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 649 ms. Remains : 2402/2805 places, 2297/2700 transitions.
Incomplete random walk after 10000 steps, including 1254 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 118013 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118013 steps, saw 59057 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2297 rows 2402 cols
[2024-05-23 02:33:04] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-23 02:33:29] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:33:54] [INFO ] After 24689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:33:54] [INFO ] State equation strengthened by 397 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-23 02:33:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:33:54] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 187 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 187 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2402 cols
[2024-05-23 02:33:54] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-23 02:34:16] [INFO ] Implicit Places using invariants in 22028 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2024-05-23 02:34:16] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:34:39] [INFO ] Implicit Places using invariants and state equation in 22890 ms returned []
Implicit Place search using SMT with State Equation took 44935 ms to find 0 implicit places.
[2024-05-23 02:34:39] [INFO ] Redundant transitions in 100 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2024-05-23 02:34:39] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:34:41] [INFO ] Dead Transitions using invariants and state equation in 1519 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46764 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Applied a total of 0 rules in 131 ms. Remains 2805 /2805 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2805 cols
[2024-05-23 02:34:41] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-23 02:34:43] [INFO ] Implicit Places using invariants in 1386 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2024-05-23 02:34:43] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:34:45] [INFO ] Implicit Places using invariants and state equation in 2172 ms returned []
Implicit Place search using SMT with State Equation took 3588 ms to find 0 implicit places.
[2024-05-23 02:34:45] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2024-05-23 02:34:45] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:34:46] [INFO ] Dead Transitions using invariants and state equation in 1268 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5099 ms. Remains : 2805/2805 places, 2700/2700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1395 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 92876 steps, run timeout after 3003 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92876 steps, saw 46458 distinct states, run finished after 3003 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2700 rows 2805 cols
[2024-05-23 02:34:50] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:35:15] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:35:40] [INFO ] After 24642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:35:40] [INFO ] State equation strengthened by 197 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:35:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:35:40] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Graph (complete) has 8475 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2803 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2803 transition count 2697
Deduced a syphon composed of 1 places in 47 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2802 transition count 2697
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 1 with 400 rules applied. Total rules applied 405 place count 2802 transition count 2297
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 805 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1204 place count 2402 transition count 2297
Applied a total of 1204 rules in 645 ms. Remains 2402 /2805 variables (removed 403) and now considering 2297/2700 (removed 403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 645 ms. Remains : 2402/2805 places, 2297/2700 transitions.
Incomplete random walk after 10000 steps, including 1257 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 115451 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115451 steps, saw 57778 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2297 rows 2402 cols
[2024-05-23 02:35:44] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:36:09] [INFO ] After 25029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:36:34] [INFO ] After 24671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:36:34] [INFO ] State equation strengthened by 397 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:36:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:36:34] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 192 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 189 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2402 cols
[2024-05-23 02:36:34] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-23 02:36:56] [INFO ] Implicit Places using invariants in 22235 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2024-05-23 02:36:56] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:37:19] [INFO ] Implicit Places using invariants and state equation in 22959 ms returned []
Implicit Place search using SMT with State Equation took 45229 ms to find 0 implicit places.
[2024-05-23 02:37:19] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2024-05-23 02:37:20] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:37:21] [INFO ] Dead Transitions using invariants and state equation in 1530 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47068 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 13882 reset in 172 ms.
Product exploration explored 100000 steps with 13873 reset in 182 ms.
Built C files in :
/tmp/ltsmin4901284133986450340
[2024-05-23 02:37:22] [INFO ] Too many transitions (2700) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:37:22] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4901284133986450340
Running compilation step : cd /tmp/ltsmin4901284133986450340;'/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/ltsmin4901284133986450340;'/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/ltsmin4901284133986450340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Applied a total of 0 rules in 129 ms. Remains 2805 /2805 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2805 cols
[2024-05-23 02:37:25] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-23 02:37:26] [INFO ] Implicit Places using invariants in 1427 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2024-05-23 02:37:26] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:37:29] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 3633 ms to find 0 implicit places.
[2024-05-23 02:37:29] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2024-05-23 02:37:29] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-23 02:37:30] [INFO ] Dead Transitions using invariants and state equation in 1302 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5174 ms. Remains : 2805/2805 places, 2700/2700 transitions.
Built C files in :
/tmp/ltsmin3582390521251580914
[2024-05-23 02:37:30] [INFO ] Too many transitions (2700) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:37:30] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3582390521251580914
Running compilation step : cd /tmp/ltsmin3582390521251580914;'/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/ltsmin3582390521251580914;'/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/ltsmin3582390521251580914;'/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-23 02:37:33] [INFO ] Flatten gal took : 79 ms
[2024-05-23 02:37:33] [INFO ] Flatten gal took : 69 ms
[2024-05-23 02:37:33] [INFO ] Time to serialize gal into /tmp/LTL6598556550130163899.gal : 11 ms
[2024-05-23 02:37:33] [INFO ] Time to serialize properties into /tmp/LTL5965629416601725743.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/LTL6598556550130163899.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15580414971896097162.hoa' '-atoms' '/tmp/LTL5965629416601725743.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5965629416601725743.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15580414971896097162.hoa
Detected timeout of ITS tools.
[2024-05-23 02:37:49] [INFO ] Flatten gal took : 65 ms
[2024-05-23 02:37:49] [INFO ] Flatten gal took : 67 ms
[2024-05-23 02:37:49] [INFO ] Time to serialize gal into /tmp/LTL14765270991517750342.gal : 11 ms
[2024-05-23 02:37:49] [INFO ] Time to serialize properties into /tmp/LTL4557424142173624287.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14765270991517750342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4557424142173624287.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p4454<1)||(p4549<1))")||((G("(p1251<1)"))||(G(F("(p1165>=1)"))))))))
Formula 0 simplified : G(F!"(p1251<1)" & FG(!"((p4454<1)||(p4549<1))" & !"(p1165>=1)"))
Detected timeout of ITS tools.
[2024-05-23 02:38:04] [INFO ] Flatten gal took : 75 ms
[2024-05-23 02:38:04] [INFO ] Applying decomposition
[2024-05-23 02:38:04] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1429372621128990085.txt' '-o' '/tmp/graph1429372621128990085.bin' '-w' '/tmp/graph1429372621128990085.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1429372621128990085.bin' '-l' '-1' '-v' '-w' '/tmp/graph1429372621128990085.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:38:04] [INFO ] Decomposing Gal with order
[2024-05-23 02:38:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:38:04] [INFO ] Removed a total of 2106 redundant transitions.
[2024-05-23 02:38:04] [INFO ] Flatten gal took : 122 ms
[2024-05-23 02:38:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 41 ms.
[2024-05-23 02:38:04] [INFO ] Time to serialize gal into /tmp/LTL5588839868322056237.gal : 27 ms
[2024-05-23 02:38:04] [INFO ] Time to serialize properties into /tmp/LTL6529199183727425773.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5588839868322056237.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6529199183727425773.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i15.u760.p4454<1)||(i15.u761.p4549<1))")||((G("(i1.i1.i2.u55.p1251<1)"))||(G(F("(i1.i0.i2.u37.p1165>=1)"))))))))
Formula 0 simplified : G(F!"(i1.i1.i2.u55.p1251<1)" & FG(!"((i15.u760.p4454<1)||(i15.u761.p4549<1))" & !"(i1.i0.i2.u37.p1165>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5586780771473685882
[2024-05-23 02:38:20] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5586780771473685882
Running compilation step : cd /tmp/ltsmin5586780771473685882;'/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/ltsmin5586780771473685882;'/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/ltsmin5586780771473685882;'/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 DoubleExponent-PT-100-LTLFireability-11 finished in 383620 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((X(F((p1 U (p2||G(p1)))))||p0))))'
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 775 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:38:23] [INFO ] Invariants computation overflowed in 95 ms
[2024-05-23 02:38:25] [INFO ] Implicit Places using invariants in 2074 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:38:26] [INFO ] Invariants computation overflowed in 85 ms
[2024-05-23 02:38:26] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 3059 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:38:27] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-23 02:38:29] [INFO ] Dead Transitions using invariants and state equation in 3029 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6879 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s4859 1) (LT s4886 1)), p2:(AND (LT s4539 1) (GEQ s3208 1) (GEQ s3237 1)), p1:(AND (GEQ s3208 1) (GEQ s3237 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3311 reset in 240 ms.
Product exploration explored 100000 steps with 3332 reset in 246 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), true, (X (X p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 79 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 328 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 264 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 290 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 62012 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62012 steps, saw 31010 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:38:35] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-23 02:39:00] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 02:39:25] [INFO ] After 24238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 02:39:25] [INFO ] After 24239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-23 02:39:25] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1200 place count 5297 transition count 3800
Reduce places removed 1196 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2398 place count 4101 transition count 3798
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2400 place count 4099 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2400 place count 4099 transition count 3598
Deduced a syphon composed of 200 places in 178 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2800 place count 3899 transition count 3598
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 64 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 3 with 1810 rules applied. Total rules applied 4610 place count 2994 transition count 2693
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 56 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4812 place count 2893 transition count 2693
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 52 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 5006 place count 2796 transition count 2693
Free-agglomeration rule (complex) applied 391 times.
Iterating global reduction 3 with 391 rules applied. Total rules applied 5397 place count 2796 transition count 2302
Reduce places removed 391 places and 0 transitions.
Iterating post reduction 3 with 391 rules applied. Total rules applied 5788 place count 2405 transition count 2302
Partial Free-agglomeration rule applied 404 times.
Drop transitions removed 404 transitions
Iterating global reduction 4 with 404 rules applied. Total rules applied 6192 place count 2405 transition count 2302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6193 place count 2404 transition count 2301
Applied a total of 6193 rules in 1523 ms. Remains 2404 /5300 variables (removed 2896) and now considering 2301/4998 (removed 2697) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1523 ms. Remains : 2404/5300 places, 2301/4998 transitions.
Incomplete random walk after 10000 steps, including 1307 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 89485 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89485 steps, saw 44767 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2301 rows 2404 cols
[2024-05-23 02:39:30] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:39:36] [INFO ] After 6710ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-23 02:40:01] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 2301/2301 transitions.
Applied a total of 0 rules in 125 ms. Remains 2404 /2404 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 2404/2404 places, 2301/2301 transitions.
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 102555 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102555 steps, saw 51294 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2301 rows 2404 cols
[2024-05-23 02:40:05] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:40:24] [INFO ] After 19481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 2301/2301 transitions.
Applied a total of 0 rules in 134 ms. Remains 2404 /2404 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 2404/2404 places, 2301/2301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 2301/2301 transitions.
Applied a total of 0 rules in 127 ms. Remains 2404 /2404 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
// Phase 1: matrix 2301 rows 2404 cols
[2024-05-23 02:40:24] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:40:33] [INFO ] Implicit Places using invariants in 8274 ms returned []
// Phase 1: matrix 2301 rows 2404 cols
[2024-05-23 02:40:33] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:40:42] [INFO ] Implicit Places using invariants and state equation in 9002 ms returned []
Implicit Place search using SMT with State Equation took 17304 ms to find 0 implicit places.
[2024-05-23 02:40:42] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2301 rows 2404 cols
[2024-05-23 02:40:42] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:40:43] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18784 ms. Remains : 2404/2404 places, 2301/2301 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), true, (X (X p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1195 rules applied. Total rules applied 1195 place count 5299 transition count 3802
Reduce places removed 1195 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2392 place count 4104 transition count 3800
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2394 place count 4102 transition count 3800
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2394 place count 4102 transition count 3600
Deduced a syphon composed of 200 places in 176 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2794 place count 3902 transition count 3600
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 61 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 4600 place count 2999 transition count 2697
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 55 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4802 place count 2898 transition count 2697
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 50 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4996 place count 2801 transition count 2697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4997 place count 2800 transition count 2696
Applied a total of 4997 rules in 1339 ms. Remains 2800 /5300 variables (removed 2500) and now considering 2696/4998 (removed 2302) transitions.
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:40:45] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:40:46] [INFO ] Implicit Places using invariants in 1396 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:40:46] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:40:48] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 3574 ms to find 0 implicit places.
[2024-05-23 02:40:48] [INFO ] Redundant transitions in 83 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:40:48] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:40:50] [INFO ] Dead Transitions using invariants and state equation in 1295 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/5300 places, 2696/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6305 ms. Remains : 2800/5300 places, 2696/4998 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 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 54 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 1395 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 800 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 90234 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90234 steps, saw 45131 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:40:53] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:41:18] [INFO ] After 25042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2696/2696 transitions.
Graph (complete) has 8475 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2798 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2798 transition count 2693
Deduced a syphon composed of 1 places in 43 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2797 transition count 2693
Free-agglomeration rule (complex) applied 390 times.
Iterating global reduction 1 with 390 rules applied. Total rules applied 395 place count 2797 transition count 2303
Reduce places removed 390 places and 0 transitions.
Iterating post reduction 1 with 390 rules applied. Total rules applied 785 place count 2407 transition count 2303
Partial Free-agglomeration rule applied 403 times.
Drop transitions removed 403 transitions
Iterating global reduction 2 with 403 rules applied. Total rules applied 1188 place count 2407 transition count 2303
Applied a total of 1188 rules in 524 ms. Remains 2407 /2800 variables (removed 393) and now considering 2303/2696 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 2407/2800 places, 2303/2696 transitions.
Incomplete random walk after 10000 steps, including 1291 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 107612 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107612 steps, saw 53848 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2303 rows 2407 cols
[2024-05-23 02:41:22] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 02:41:47] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2407/2407 places, 2303/2303 transitions.
Applied a total of 0 rules in 129 ms. Remains 2407 /2407 variables (removed 0) and now considering 2303/2303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 2407/2407 places, 2303/2303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2407/2407 places, 2303/2303 transitions.
Applied a total of 0 rules in 126 ms. Remains 2407 /2407 variables (removed 0) and now considering 2303/2303 (removed 0) transitions.
// Phase 1: matrix 2303 rows 2407 cols
[2024-05-23 02:41:47] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:41:55] [INFO ] Implicit Places using invariants in 8382 ms returned []
// Phase 1: matrix 2303 rows 2407 cols
[2024-05-23 02:41:56] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 02:42:04] [INFO ] Implicit Places using invariants and state equation in 8982 ms returned []
Implicit Place search using SMT with State Equation took 17386 ms to find 0 implicit places.
[2024-05-23 02:42:05] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2303 rows 2407 cols
[2024-05-23 02:42:05] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:42:06] [INFO ] Dead Transitions using invariants and state equation in 1270 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18867 ms. Remains : 2407/2407 places, 2303/2303 transitions.
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 200 Pre rules applied. Total rules applied 0 place count 2407 transition count 2103
Deduced a syphon composed of 200 places in 47 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2207 transition count 2103
Applied a total of 400 rules in 233 ms. Remains 2207 /2407 variables (removed 200) and now considering 2103/2303 (removed 200) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2103 rows 2207 cols
[2024-05-23 02:42:06] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:45:51] [INFO ] After 225035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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 65 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 13886 reset in 170 ms.
Product exploration explored 100000 steps with 13905 reset in 179 ms.
Built C files in :
/tmp/ltsmin17892427920286555748
[2024-05-23 02:45:52] [INFO ] Too many transitions (2696) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:45:52] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17892427920286555748
Running compilation step : cd /tmp/ltsmin17892427920286555748;'/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/ltsmin17892427920286555748;'/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/ltsmin17892427920286555748;'/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 5 out of 2800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2800/2800 places, 2696/2696 transitions.
Applied a total of 0 rules in 133 ms. Remains 2800 /2800 variables (removed 0) and now considering 2696/2696 (removed 0) transitions.
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:45:55] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:45:57] [INFO ] Implicit Places using invariants in 1379 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:45:57] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:45:59] [INFO ] Implicit Places using invariants and state equation in 2171 ms returned []
Implicit Place search using SMT with State Equation took 3564 ms to find 0 implicit places.
[2024-05-23 02:45:59] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:45:59] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:46:00] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4976 ms. Remains : 2800/2800 places, 2696/2696 transitions.
Built C files in :
/tmp/ltsmin18288831503176832547
[2024-05-23 02:46:00] [INFO ] Too many transitions (2696) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:46:00] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18288831503176832547
Running compilation step : cd /tmp/ltsmin18288831503176832547;'/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/ltsmin18288831503176832547;'/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/ltsmin18288831503176832547;'/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-23 02:46:03] [INFO ] Flatten gal took : 67 ms
[2024-05-23 02:46:03] [INFO ] Flatten gal took : 67 ms
[2024-05-23 02:46:03] [INFO ] Time to serialize gal into /tmp/LTL6977946300544524407.gal : 11 ms
[2024-05-23 02:46:03] [INFO ] Time to serialize properties into /tmp/LTL11486061624720551094.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/LTL6977946300544524407.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14625301306533536559.hoa' '-atoms' '/tmp/LTL11486061624720551094.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...319
Loading property file /tmp/LTL11486061624720551094.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14625301306533536559.hoa
Detected timeout of ITS tools.
[2024-05-23 02:46:19] [INFO ] Flatten gal took : 65 ms
[2024-05-23 02:46:19] [INFO ] Flatten gal took : 67 ms
[2024-05-23 02:46:19] [INFO ] Time to serialize gal into /tmp/LTL12144242630396842056.gal : 12 ms
[2024-05-23 02:46:19] [INFO ] Time to serialize properties into /tmp/LTL17832669832974052912.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12144242630396842056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17832669832974052912.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p601<1)||(p626<1))")||(X(F(("((p3887>=1)&&(p3912>=1))")U(("(((p5084<1)&&(p3887>=1))&&(p3912>=1))")||(G("((p3887>=1)&&(p3912...171
Formula 0 simplified : XF(!"((p601<1)||(p626<1))" & XG(!"((p3887>=1)&&(p3912>=1))" M !"(((p5084<1)&&(p3887>=1))&&(p3912>=1))"))
Detected timeout of ITS tools.
[2024-05-23 02:46:34] [INFO ] Flatten gal took : 66 ms
[2024-05-23 02:46:34] [INFO ] Applying decomposition
[2024-05-23 02:46:34] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3057405286525394769.txt' '-o' '/tmp/graph3057405286525394769.bin' '-w' '/tmp/graph3057405286525394769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3057405286525394769.bin' '-l' '-1' '-v' '-w' '/tmp/graph3057405286525394769.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:46:34] [INFO ] Decomposing Gal with order
[2024-05-23 02:46:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:46:34] [INFO ] Removed a total of 2086 redundant transitions.
[2024-05-23 02:46:34] [INFO ] Flatten gal took : 121 ms
[2024-05-23 02:46:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 40 ms.
[2024-05-23 02:46:34] [INFO ] Time to serialize gal into /tmp/LTL991168656772341064.gal : 25 ms
[2024-05-23 02:46:34] [INFO ] Time to serialize properties into /tmp/LTL13340285045812292922.ltl : 2 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/LTL991168656772341064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13340285045812292922.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i19.i0.i1.u948.p601<1)||(i19.i0.i2.u954.p626<1))")||(X(F(("((i13.u626.p3887>=1)&&(i13.u632.p3912>=1))")U(("(((i18.u886.p508...264
Formula 0 simplified : XF(!"((i19.i0.i1.u948.p601<1)||(i19.i0.i2.u954.p626<1))" & XG(!"((i13.u626.p3887>=1)&&(i13.u632.p3912>=1))" M !"(((i18.u886.p5084<1)...202
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17631101772102681493
[2024-05-23 02:46:49] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17631101772102681493
Running compilation step : cd /tmp/ltsmin17631101772102681493;'/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/ltsmin17631101772102681493;'/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/ltsmin17631101772102681493;'/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 DoubleExponent-PT-100-LTLFireability-12 finished in 509919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1200 place count 5299 transition count 3797
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2400 place count 4099 transition count 3797
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 2400 place count 4099 transition count 3598
Deduced a syphon composed of 199 places in 175 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 65 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 2 with 1800 rules applied. Total rules applied 4598 place count 3000 transition count 2698
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 57 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4800 place count 2899 transition count 2698
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 46 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 4992 place count 2803 transition count 2698
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4993 place count 2802 transition count 2697
Applied a total of 4993 rules in 1188 ms. Remains 2802 /5300 variables (removed 2498) and now considering 2697/4998 (removed 2301) transitions.
// Phase 1: matrix 2697 rows 2802 cols
[2024-05-23 02:46:54] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:46:55] [INFO ] Implicit Places using invariants in 1395 ms returned []
// Phase 1: matrix 2697 rows 2802 cols
[2024-05-23 02:46:55] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:46:57] [INFO ] Implicit Places using invariants and state equation in 2191 ms returned []
Implicit Place search using SMT with State Equation took 3600 ms to find 0 implicit places.
[2024-05-23 02:46:57] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 2697 rows 2802 cols
[2024-05-23 02:46:57] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:46:59] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2802/5300 places, 2697/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6136 ms. Remains : 2802/5300 places, 2697/4998 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2038 1) (LT s1670 1)), p1:(LT s526 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-13 finished in 6300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((G(p1) U (p2&&G(p1))))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 771 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:47:00] [INFO ] Invariants computation overflowed in 94 ms
[2024-05-23 02:47:02] [INFO ] Implicit Places using invariants in 2074 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:47:02] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-23 02:47:03] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 3060 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:47:03] [INFO ] Invariants computation overflowed in 87 ms
[2024-05-23 02:47:06] [INFO ] Dead Transitions using invariants and state equation in 3066 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6917 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s4553 1), p2:(GEQ s3494 1), p1:(AND (GEQ s4812 1) (GEQ s4890 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-14 finished in 7476 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(p0)||(F(p1) U p0)))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 770 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:47:07] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-23 02:47:09] [INFO ] Implicit Places using invariants in 2066 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:47:09] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-23 02:47:10] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 3007 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:47:10] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-23 02:47:13] [INFO ] Dead Transitions using invariants and state equation in 3034 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6820 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s1964 1), p1:(AND (GEQ s1603 1) (GEQ s1624 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-15 finished in 7328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(p1||X(F((p2||G(p3))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((!(p1 U (X(p1) U X(p2)))||p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : DoubleExponent-PT-100-LTLFireability-10
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5299 transition count 3799
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3599
Deduced a syphon composed of 200 places in 178 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 64 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4602 place count 2998 transition count 2696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 55 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4804 place count 2897 transition count 2696
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 52 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 4998 place count 2800 transition count 2696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4999 place count 2799 transition count 2695
Applied a total of 4999 rules in 1282 ms. Remains 2799 /5300 variables (removed 2501) and now considering 2695/4998 (removed 2303) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:47:15] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:47:17] [INFO ] Implicit Places using invariants in 1478 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:47:17] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:47:19] [INFO ] Implicit Places using invariants and state equation in 2177 ms returned []
Implicit Place search using SMT with State Equation took 3681 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:47:19] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:47:20] [INFO ] Dead Transitions using invariants and state equation in 1280 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2799/5300 places, 2695/4998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6247 ms. Remains : 2799/5300 places, 2695/4998 transitions.
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s2606 1) (LT s2646 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13910 reset in 167 ms.
Product exploration explored 100000 steps with 14013 reset in 197 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1368 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 116078 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116078 steps, saw 58057 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:47:24] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-23 02:47:35] [INFO ] After 10415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Graph (complete) has 8478 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2797 transition count 2693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2797 transition count 2692
Deduced a syphon composed of 1 places in 44 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2796 transition count 2296
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2400 transition count 2296
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1196 place count 2400 transition count 2296
Applied a total of 1196 rules in 591 ms. Remains 2400 /2799 variables (removed 399) and now considering 2296/2695 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 2400/2799 places, 2296/2695 transitions.
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 138036 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 138036 steps, saw 69043 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2296 rows 2400 cols
[2024-05-23 02:47:38] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:48:03] [INFO ] After 25065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 187 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 167 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2400 cols
[2024-05-23 02:48:04] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:48:20] [INFO ] Implicit Places using invariants in 16015 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2024-05-23 02:48:20] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:48:36] [INFO ] Implicit Places using invariants and state equation in 16765 ms returned []
Implicit Place search using SMT with State Equation took 32796 ms to find 0 implicit places.
[2024-05-23 02:48:37] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2024-05-23 02:48:37] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:48:38] [INFO ] Dead Transitions using invariants and state equation in 1400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34455 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2400 transition count 2097
Deduced a syphon composed of 199 places in 77 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2201 transition count 2097
Applied a total of 398 rules in 302 ms. Remains 2201 /2400 variables (removed 199) and now considering 2097/2296 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2201 cols
[2024-05-23 02:48:38] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:48:50] [INFO ] After 11577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Applied a total of 0 rules in 113 ms. Remains 2799 /2799 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:48:51] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-23 02:48:52] [INFO ] Implicit Places using invariants in 1397 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:48:52] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:48:54] [INFO ] Implicit Places using invariants and state equation in 2129 ms returned []
Implicit Place search using SMT with State Equation took 3556 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:48:54] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:48:55] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4867 ms. Remains : 2799/2799 places, 2695/2695 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1388 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 803 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 112641 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112641 steps, saw 56334 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:48:59] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-23 02:49:09] [INFO ] After 10500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Graph (complete) has 8478 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2797 transition count 2693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2797 transition count 2692
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2796 transition count 2296
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2400 transition count 2296
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1196 place count 2400 transition count 2296
Applied a total of 1196 rules in 622 ms. Remains 2400 /2799 variables (removed 399) and now considering 2296/2695 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 2400/2799 places, 2296/2695 transitions.
Incomplete random walk after 10000 steps, including 1264 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 137481 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137481 steps, saw 68778 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2296 rows 2400 cols
[2024-05-23 02:49:13] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:49:38] [INFO ] After 25044ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 180 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 165 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2400 cols
[2024-05-23 02:49:38] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:49:54] [INFO ] Implicit Places using invariants in 15603 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2024-05-23 02:49:54] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:50:11] [INFO ] Implicit Places using invariants and state equation in 17198 ms returned []
Implicit Place search using SMT with State Equation took 32804 ms to find 0 implicit places.
[2024-05-23 02:50:11] [INFO ] Redundant transitions in 88 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2024-05-23 02:50:11] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:50:13] [INFO ] Dead Transitions using invariants and state equation in 1400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34473 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2400 transition count 2097
Deduced a syphon composed of 199 places in 90 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2201 transition count 2097
Applied a total of 398 rules in 334 ms. Remains 2201 /2400 variables (removed 199) and now considering 2097/2296 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2201 cols
[2024-05-23 02:50:13] [INFO ] Invariants computation overflowed in 54 ms
[2024-05-23 02:50:25] [INFO ] After 12150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13926 reset in 252 ms.
Product exploration explored 100000 steps with 13951 reset in 253 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Applied a total of 0 rules in 139 ms. Remains 2799 /2799 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
[2024-05-23 02:50:27] [INFO ] Redundant transitions in 84 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:50:27] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-23 02:50:28] [INFO ] Dead Transitions using invariants and state equation in 1312 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1546 ms. Remains : 2799/2799 places, 2695/2695 transitions.
Built C files in :
/tmp/ltsmin15607994327576937770
[2024-05-23 02:50:28] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15607994327576937770
Running compilation step : cd /tmp/ltsmin15607994327576937770;'/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/ltsmin15607994327576937770;'/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/ltsmin15607994327576937770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Applied a total of 0 rules in 124 ms. Remains 2799 /2799 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:50:32] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-23 02:50:33] [INFO ] Implicit Places using invariants in 1352 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:50:33] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:50:35] [INFO ] Implicit Places using invariants and state equation in 2333 ms returned []
Implicit Place search using SMT with State Equation took 3685 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:50:35] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:50:37] [INFO ] Dead Transitions using invariants and state equation in 1273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5087 ms. Remains : 2799/2799 places, 2695/2695 transitions.
Built C files in :
/tmp/ltsmin1346477153564857621
[2024-05-23 02:50:37] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1346477153564857621
Running compilation step : cd /tmp/ltsmin1346477153564857621;'/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/ltsmin1346477153564857621;'/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/ltsmin1346477153564857621;'/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-23 02:50:40] [INFO ] Flatten gal took : 70 ms
[2024-05-23 02:50:40] [INFO ] Flatten gal took : 66 ms
[2024-05-23 02:50:40] [INFO ] Time to serialize gal into /tmp/LTL6139098761332903302.gal : 10 ms
[2024-05-23 02:50:40] [INFO ] Time to serialize properties into /tmp/LTL14197863866885981025.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/LTL6139098761332903302.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11175186736122871223.hoa' '-atoms' '/tmp/LTL14197863866885981025.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...319
Loading property file /tmp/LTL14197863866885981025.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11175186736122871223.hoa
Detected timeout of ITS tools.
[2024-05-23 02:50:55] [INFO ] Flatten gal took : 78 ms
[2024-05-23 02:50:55] [INFO ] Flatten gal took : 65 ms
[2024-05-23 02:50:55] [INFO ] Time to serialize gal into /tmp/LTL6802076956322780801.gal : 10 ms
[2024-05-23 02:50:55] [INFO ] Time to serialize properties into /tmp/LTL17196684101794098852.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6802076956322780801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17196684101794098852.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((p672<1)||(p742<1))")))))
Formula 0 simplified : XXF!"((p672<1)||(p742<1))"
Detected timeout of ITS tools.
[2024-05-23 02:51:10] [INFO ] Flatten gal took : 69 ms
[2024-05-23 02:51:10] [INFO ] Applying decomposition
[2024-05-23 02:51:10] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12982020971033406342.txt' '-o' '/tmp/graph12982020971033406342.bin' '-w' '/tmp/graph12982020971033406342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12982020971033406342.bin' '-l' '-1' '-v' '-w' '/tmp/graph12982020971033406342.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:51:11] [INFO ] Decomposing Gal with order
[2024-05-23 02:51:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:51:11] [INFO ] Removed a total of 2087 redundant transitions.
[2024-05-23 02:51:11] [INFO ] Flatten gal took : 128 ms
[2024-05-23 02:51:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 42 ms.
[2024-05-23 02:51:11] [INFO ] Time to serialize gal into /tmp/LTL7399977958278196867.gal : 26 ms
[2024-05-23 02:51:11] [INFO ] Time to serialize properties into /tmp/LTL18424373055764891705.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7399977958278196867.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18424373055764891705.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i19.u953.p672<1)||(i19.u975.p742<1))")))))
Formula 0 simplified : XXF!"((i19.u953.p672<1)||(i19.u975.p742<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2335728210815829769
[2024-05-23 02:51:26] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2335728210815829769
Running compilation step : cd /tmp/ltsmin2335728210815829769;'/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/ltsmin2335728210815829769;'/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/ltsmin2335728210815829769;'/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 DoubleExponent-PT-100-LTLFireability-10 finished in 255201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||G(F(p2))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F((p1 U (p2||G(p1)))))||p0))))'
Found a Lengthening insensitive property : DoubleExponent-PT-100-LTLFireability-12
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1195 rules applied. Total rules applied 1195 place count 5299 transition count 3802
Reduce places removed 1195 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2392 place count 4104 transition count 3800
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2394 place count 4102 transition count 3800
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2394 place count 4102 transition count 3600
Deduced a syphon composed of 200 places in 180 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2794 place count 3902 transition count 3600
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 77 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 4600 place count 2999 transition count 2697
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 50 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4802 place count 2898 transition count 2697
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 46 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4996 place count 2801 transition count 2697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4997 place count 2800 transition count 2696
Applied a total of 4997 rules in 1232 ms. Remains 2800 /5300 variables (removed 2500) and now considering 2696/4998 (removed 2302) transitions.
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:51:31] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:51:32] [INFO ] Implicit Places using invariants in 1478 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:51:32] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:51:34] [INFO ] Implicit Places using invariants and state equation in 2307 ms returned []
Implicit Place search using SMT with State Equation took 3789 ms to find 0 implicit places.
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:51:34] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:51:36] [INFO ] Dead Transitions using invariants and state equation in 1282 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2800/5300 places, 2696/4998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6305 ms. Remains : 2800/5300 places, 2696/4998 transitions.
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2570 1) (LT s2583 1)), p2:(AND (LT s2396 1) (GEQ s1694 1) (GEQ s1707 1)), p1:(AND (GEQ s1694 1) (GEQ s1707 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13892 reset in 258 ms.
Product exploration explored 100000 steps with 13877 reset in 243 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), true, (X (X p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 99 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1359 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 818 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 812 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 102172 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102172 steps, saw 51091 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:51:40] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:52:05] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 02:52:30] [INFO ] After 24551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:52:30] [INFO ] State equation strengthened by 198 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
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-23 02:52:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:52:30] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2696/2696 transitions.
Graph (complete) has 8475 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2798 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2798 transition count 2693
Deduced a syphon composed of 1 places in 44 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2797 transition count 2693
Free-agglomeration rule (complex) applied 390 times.
Iterating global reduction 1 with 390 rules applied. Total rules applied 395 place count 2797 transition count 2303
Reduce places removed 390 places and 0 transitions.
Iterating post reduction 1 with 390 rules applied. Total rules applied 785 place count 2407 transition count 2303
Partial Free-agglomeration rule applied 403 times.
Drop transitions removed 403 transitions
Iterating global reduction 2 with 403 rules applied. Total rules applied 1188 place count 2407 transition count 2303
Applied a total of 1188 rules in 525 ms. Remains 2407 /2800 variables (removed 393) and now considering 2303/2696 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 2407/2800 places, 2303/2696 transitions.
Incomplete random walk after 10000 steps, including 1243 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 113974 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113974 steps, saw 57034 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2303 rows 2407 cols
[2024-05-23 02:52:34] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:52:59] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 02:53:24] [INFO ] After 24650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:53:24] [INFO ] State equation strengthened by 398 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
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-23 02:53:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:53:24] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2407/2407 places, 2303/2303 transitions.
Applied a total of 0 rules in 136 ms. Remains 2407 /2407 variables (removed 0) and now considering 2303/2303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 2407/2407 places, 2303/2303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2407/2407 places, 2303/2303 transitions.
Applied a total of 0 rules in 132 ms. Remains 2407 /2407 variables (removed 0) and now considering 2303/2303 (removed 0) transitions.
// Phase 1: matrix 2303 rows 2407 cols
[2024-05-23 02:53:25] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-23 02:53:33] [INFO ] Implicit Places using invariants in 8406 ms returned []
// Phase 1: matrix 2303 rows 2407 cols
[2024-05-23 02:53:33] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:53:42] [INFO ] Implicit Places using invariants and state equation in 8945 ms returned []
Implicit Place search using SMT with State Equation took 17366 ms to find 0 implicit places.
[2024-05-23 02:53:42] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2303 rows 2407 cols
[2024-05-23 02:53:42] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:53:43] [INFO ] Dead Transitions using invariants and state equation in 1281 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18874 ms. Remains : 2407/2407 places, 2303/2303 transitions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), true, (X (X p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 2800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2800/2800 places, 2696/2696 transitions.
Applied a total of 0 rules in 129 ms. Remains 2800 /2800 variables (removed 0) and now considering 2696/2696 (removed 0) transitions.
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:53:44] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-23 02:53:45] [INFO ] Implicit Places using invariants in 1391 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:53:45] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:53:48] [INFO ] Implicit Places using invariants and state equation in 2353 ms returned []
Implicit Place search using SMT with State Equation took 3745 ms to find 0 implicit places.
[2024-05-23 02:53:48] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:53:48] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:53:49] [INFO ] Dead Transitions using invariants and state equation in 1212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5179 ms. Remains : 2800/2800 places, 2696/2696 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1396 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 810 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 808 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 88217 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88217 steps, saw 44114 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:53:53] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:54:18] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 02:54:43] [INFO ] After 24558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:54:43] [INFO ] State equation strengthened by 198 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
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-23 02:54:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:54:43] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2696/2696 transitions.
Graph (complete) has 8475 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2798 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2798 transition count 2693
Deduced a syphon composed of 1 places in 50 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2797 transition count 2693
Free-agglomeration rule (complex) applied 390 times.
Iterating global reduction 1 with 390 rules applied. Total rules applied 395 place count 2797 transition count 2303
Reduce places removed 390 places and 0 transitions.
Iterating post reduction 1 with 390 rules applied. Total rules applied 785 place count 2407 transition count 2303
Partial Free-agglomeration rule applied 403 times.
Drop transitions removed 403 transitions
Iterating global reduction 2 with 403 rules applied. Total rules applied 1188 place count 2407 transition count 2303
Applied a total of 1188 rules in 530 ms. Remains 2407 /2800 variables (removed 393) and now considering 2303/2696 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 530 ms. Remains : 2407/2800 places, 2303/2696 transitions.
Incomplete random walk after 10000 steps, including 1255 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 867 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 112007 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112007 steps, saw 56053 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2303 rows 2407 cols
[2024-05-23 02:54:47] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:55:12] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 02:55:37] [INFO ] After 24612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:55:37] [INFO ] State equation strengthened by 398 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
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-23 02:55:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:55:37] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2407/2407 places, 2303/2303 transitions.
Applied a total of 0 rules in 136 ms. Remains 2407 /2407 variables (removed 0) and now considering 2303/2303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 2407/2407 places, 2303/2303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2407/2407 places, 2303/2303 transitions.
Applied a total of 0 rules in 131 ms. Remains 2407 /2407 variables (removed 0) and now considering 2303/2303 (removed 0) transitions.
// Phase 1: matrix 2303 rows 2407 cols
[2024-05-23 02:55:37] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:55:46] [INFO ] Implicit Places using invariants in 8412 ms returned []
// Phase 1: matrix 2303 rows 2407 cols
[2024-05-23 02:55:46] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 02:55:55] [INFO ] Implicit Places using invariants and state equation in 9114 ms returned []
Implicit Place search using SMT with State Equation took 17547 ms to find 0 implicit places.
[2024-05-23 02:55:55] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2303 rows 2407 cols
[2024-05-23 02:55:55] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-23 02:55:56] [INFO ] Dead Transitions using invariants and state equation in 1287 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19067 ms. Remains : 2407/2407 places, 2303/2303 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 13758 reset in 199 ms.
Product exploration explored 100000 steps with 13990 reset in 212 ms.
Built C files in :
/tmp/ltsmin2965886457145470789
[2024-05-23 02:55:57] [INFO ] Too many transitions (2696) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:55:57] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2965886457145470789
Running compilation step : cd /tmp/ltsmin2965886457145470789;'/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/ltsmin2965886457145470789;'/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/ltsmin2965886457145470789;'/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 5 out of 2800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2800/2800 places, 2696/2696 transitions.
Applied a total of 0 rules in 128 ms. Remains 2800 /2800 variables (removed 0) and now considering 2696/2696 (removed 0) transitions.
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:56:00] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:56:01] [INFO ] Implicit Places using invariants in 1403 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:56:02] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:56:04] [INFO ] Implicit Places using invariants and state equation in 2170 ms returned []
Implicit Place search using SMT with State Equation took 3605 ms to find 0 implicit places.
[2024-05-23 02:56:04] [INFO ] Redundant transitions in 84 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2024-05-23 02:56:04] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:56:05] [INFO ] Dead Transitions using invariants and state equation in 1309 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5132 ms. Remains : 2800/2800 places, 2696/2696 transitions.
Built C files in :
/tmp/ltsmin10621572413764957222
[2024-05-23 02:56:05] [INFO ] Too many transitions (2696) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:56:05] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10621572413764957222
Running compilation step : cd /tmp/ltsmin10621572413764957222;'/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/ltsmin10621572413764957222;'/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/ltsmin10621572413764957222;'/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-23 02:56:08] [INFO ] Flatten gal took : 73 ms
[2024-05-23 02:56:08] [INFO ] Flatten gal took : 75 ms
[2024-05-23 02:56:08] [INFO ] Time to serialize gal into /tmp/LTL77925681480088137.gal : 12 ms
[2024-05-23 02:56:08] [INFO ] Time to serialize properties into /tmp/LTL9297139251518216651.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL77925681480088137.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10202652214669874924.hoa' '-atoms' '/tmp/LTL9297139251518216651.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL9297139251518216651.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10202652214669874924.hoa
Detected timeout of ITS tools.
[2024-05-23 02:56:24] [INFO ] Flatten gal took : 66 ms
[2024-05-23 02:56:24] [INFO ] Flatten gal took : 68 ms
[2024-05-23 02:56:24] [INFO ] Time to serialize gal into /tmp/LTL12786364535123794638.gal : 11 ms
[2024-05-23 02:56:24] [INFO ] Time to serialize properties into /tmp/LTL12042522220807977693.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12786364535123794638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12042522220807977693.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p601<1)||(p626<1))")||(X(F(("((p3887>=1)&&(p3912>=1))")U(("(((p5084<1)&&(p3887>=1))&&(p3912>=1))")||(G("((p3887>=1)&&(p3912...171
Formula 0 simplified : XF(!"((p601<1)||(p626<1))" & XG(!"((p3887>=1)&&(p3912>=1))" M !"(((p5084<1)&&(p3887>=1))&&(p3912>=1))"))
Detected timeout of ITS tools.
[2024-05-23 02:56:39] [INFO ] Flatten gal took : 69 ms
[2024-05-23 02:56:39] [INFO ] Applying decomposition
[2024-05-23 02:56:39] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10333385391430071083.txt' '-o' '/tmp/graph10333385391430071083.bin' '-w' '/tmp/graph10333385391430071083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10333385391430071083.bin' '-l' '-1' '-v' '-w' '/tmp/graph10333385391430071083.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:56:39] [INFO ] Decomposing Gal with order
[2024-05-23 02:56:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:56:39] [INFO ] Removed a total of 2092 redundant transitions.
[2024-05-23 02:56:39] [INFO ] Flatten gal took : 126 ms
[2024-05-23 02:56:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 43 ms.
[2024-05-23 02:56:40] [INFO ] Time to serialize gal into /tmp/LTL12428557513188124151.gal : 27 ms
[2024-05-23 02:56:40] [INFO ] Time to serialize properties into /tmp/LTL11694634918161193262.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12428557513188124151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11694634918161193262.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i18.i0.i1.u942.p601<1)||(i18.i0.i1.u948.p626<1))")||(X(F(("((i11.u630.p3887>=1)&&(i11.u636.p3912>=1))")U(("(((i17.u886.p508...264
Formula 0 simplified : XF(!"((i18.i0.i1.u942.p601<1)||(i18.i0.i1.u948.p626<1))" & XG(!"((i11.u630.p3887>=1)&&(i11.u636.p3912>=1))" M !"(((i17.u886.p5084<1)...202
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14704934617027663688
[2024-05-23 02:56:55] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14704934617027663688
Running compilation step : cd /tmp/ltsmin14704934617027663688;'/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/ltsmin14704934617027663688;'/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/ltsmin14704934617027663688;'/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 DoubleExponent-PT-100-LTLFireability-12 finished in 328433 ms.
[2024-05-23 02:56:58] [INFO ] Flatten gal took : 110 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17278989111295331281
[2024-05-23 02:56:58] [INFO ] Too many transitions (4998) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:56:58] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17278989111295331281
Running compilation step : cd /tmp/ltsmin17278989111295331281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 02:56:58] [INFO ] Applying decomposition
[2024-05-23 02:56:58] [INFO ] Flatten gal took : 115 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17608207612954066404.txt' '-o' '/tmp/graph17608207612954066404.bin' '-w' '/tmp/graph17608207612954066404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17608207612954066404.bin' '-l' '-1' '-v' '-w' '/tmp/graph17608207612954066404.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:56:58] [INFO ] Decomposing Gal with order
[2024-05-23 02:56:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:57:00] [INFO ] Removed a total of 1410 redundant transitions.
[2024-05-23 02:57:00] [INFO ] Flatten gal took : 223 ms
[2024-05-23 02:57:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 62 ms.
[2024-05-23 02:57:00] [INFO ] Time to serialize gal into /tmp/LTLFireability1830804544802016040.gal : 84 ms
[2024-05-23 02:57:00] [INFO ] Time to serialize properties into /tmp/LTLFireability3303586753591609486.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1830804544802016040.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3303586753591609486.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 6 LTL properties
Checking formula 0 : !((G(("(i15.u1242.p3613<1)")&&(("((i2.i1.i1.i3.u328.p1626>=1)&&(i2.i1.i1.i2.u331.p1696>=1))")||(X(F(("((i5.i1.i0.i0.u512.p2069>=1)&&(i...237
Formula 0 simplified : F(!"(i15.u1242.p3613<1)" | (!"((i2.i1.i1.i3.u328.p1626>=1)&&(i2.i1.i1.i2.u331.p1696>=1))" & XG(!"((i5.i1.i0.i0.u512.p2069>=1)&&(i5.i...227
Compilation finished in 17534 ms.
Running link step : cd /tmp/ltsmin17278989111295331281;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 172 ms.
Running LTSmin : cd /tmp/ltsmin17278989111295331281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)&&((LTLAPp1==true)||X(<>(((LTLAPp2==true)||[]((LTLAPp3==true))))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7133668 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16032200 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="DoubleExponent-PT-100"
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 DoubleExponent-PT-100, 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 r153-tall-171631151600358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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