Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110000219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 13:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 13:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 3.5M May 10 09:33 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-200-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652651385280

Running Version 202205111006
[2022-05-15 21:49:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 21:49:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:49:46] [INFO ] Load time of PNML (sax parser for PT used): 379 ms
[2022-05-15 21:49:46] [INFO ] Transformed 10604 places.
[2022-05-15 21:49:46] [INFO ] Transformed 9998 transitions.
[2022-05-15 21:49:46] [INFO ] Parsed PT model containing 10604 places and 9998 transitions in 526 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-200-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 10604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10604/10604 places, 9998/9998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 10600 transition count 9998
Applied a total of 4 rules in 3774 ms. Remains 10600 /10604 variables (removed 4) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:49:54] [INFO ] Invariants computation overflowed in 337 ms
[2022-05-15 21:49:56] [INFO ] Implicit Places using invariants in 2588 ms returned []
Implicit Place search using SMT only with invariants took 2615 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:49:57] [INFO ] Invariants computation overflowed in 311 ms
[2022-05-15 21:49:57] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10600/10604 places, 9998/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10604 places, 9998/9998 transitions.
Support contains 44 out of 10600 places after structural reductions.
[2022-05-15 21:50:00] [INFO ] Flatten gal took : 503 ms
[2022-05-15 21:50:00] [INFO ] Flatten gal took : 328 ms
[2022-05-15 21:50:01] [INFO ] Input system was already deterministic with 9998 transitions.
Incomplete random walk after 10000 steps, including 335 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 27768 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{5=1}
Probabilistic random walk after 27768 steps, saw 13889 distinct states, run finished after 3002 ms. (steps per millisecond=9 ) properties seen :1
Running SMT prover for 22 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:50:09] [INFO ] Invariants computation overflowed in 260 ms
[2022-05-15 21:50:13] [INFO ] After 4066ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-15 21:50:38] [INFO ] After 18227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2022-05-15 21:50:38] [INFO ] After 18244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-15 21:50:38] [INFO ] After 25082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 43 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.39 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 2360 transitions
Trivial Post-agglo rules discarded 2360 transitions
Performed 2360 trivial Post agglomeration. Transition count delta: 2360
Iterating post reduction 0 with 2363 rules applied. Total rules applied 2364 place count 10597 transition count 7636
Reduce places removed 2360 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 2372 rules applied. Total rules applied 4736 place count 8237 transition count 7624
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 4748 place count 8225 transition count 7624
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4748 place count 8225 transition count 7224
Deduced a syphon composed of 400 places in 765 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5548 place count 7825 transition count 7224
Performed 1782 Post agglomeration using F-continuation condition.Transition count delta: 1782
Deduced a syphon composed of 1782 places in 367 ms
Reduce places removed 1782 places and 0 transitions.
Iterating global reduction 3 with 3564 rules applied. Total rules applied 9112 place count 6043 transition count 5442
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 245 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9314 place count 5942 transition count 5442
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 268 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9516 place count 5841 transition count 5442
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 289 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9718 place count 5740 transition count 5442
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 211 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 9900 place count 5649 transition count 5442
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9901 place count 5649 transition count 5441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9902 place count 5648 transition count 5441
Free-agglomeration rule (complex) applied 811 times.
Iterating global reduction 4 with 811 rules applied. Total rules applied 10713 place count 5648 transition count 4630
Reduce places removed 811 places and 0 transitions.
Iterating post reduction 4 with 811 rules applied. Total rules applied 11524 place count 4837 transition count 4630
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 798 times.
Drop transitions removed 798 transitions
Iterating global reduction 5 with 798 rules applied. Total rules applied 12322 place count 4837 transition count 4630
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 12323 place count 4836 transition count 4629
Applied a total of 12323 rules in 9916 ms. Remains 4836 /10600 variables (removed 5764) and now considering 4629/9998 (removed 5369) transitions.
Finished structural reductions, in 1 iterations. Remains : 4836/10600 places, 4629/9998 transitions.
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) 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 22) seen :0
Interrupted probabilistic random walk after 56748 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56748 steps, saw 28385 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 4629 rows 4836 cols
[2022-05-15 21:50:52] [INFO ] Invariants computation overflowed in 99 ms
[2022-05-15 21:50:54] [INFO ] After 2080ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-15 21:51:19] [INFO ] After 21853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2022-05-15 21:51:19] [INFO ] State equation strengthened by 787 read => feed constraints.
[2022-05-15 21:51:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 21:51:19] [INFO ] After 25090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 43 out of 4836 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4836/4836 places, 4629/4629 transitions.
Applied a total of 0 rules in 669 ms. Remains 4836 /4836 variables (removed 0) and now considering 4629/4629 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4836/4836 places, 4629/4629 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4836/4836 places, 4629/4629 transitions.
Applied a total of 0 rules in 690 ms. Remains 4836 /4836 variables (removed 0) and now considering 4629/4629 (removed 0) transitions.
// Phase 1: matrix 4629 rows 4836 cols
[2022-05-15 21:51:21] [INFO ] Invariants computation overflowed in 104 ms
[2022-05-15 21:51:51] [INFO ] Performed 1855/4836 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 21:52:21] [INFO ] Performed 4765/4836 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 21:52:22] [INFO ] Implicit Places using invariants in 61103 ms returned []
// Phase 1: matrix 4629 rows 4836 cols
[2022-05-15 21:52:22] [INFO ] Invariants computation overflowed in 97 ms
[2022-05-15 21:52:23] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 62193 ms to find 0 implicit places.
[2022-05-15 21:52:23] [INFO ] Redundant transitions in 542 ms returned []
// Phase 1: matrix 4629 rows 4836 cols
[2022-05-15 21:52:24] [INFO ] Invariants computation overflowed in 102 ms
[2022-05-15 21:52:28] [INFO ] Dead Transitions using invariants and state equation in 4338 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4836/4836 places, 4629/4629 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.52 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(X(F(p0)))))||G(X(X(p1)))))'
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3370 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:52:32] [INFO ] Invariants computation overflowed in 253 ms
[2022-05-15 21:52:33] [INFO ] Implicit Places using invariants in 1057 ms returned []
Implicit Place search using SMT only with invariants took 1059 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:52:33] [INFO ] Invariants computation overflowed in 263 ms
[2022-05-15 21:52:34] [INFO ] Dead Transitions using invariants and state equation in 1173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-200-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (LEQ 1 s5553) (LEQ s10182 s2453)), p1:(LEQ s8076 s7103)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 2655 ms.
Product exploration explored 100000 steps with 25000 reset in 2507 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.24 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 338 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 27034 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 27034 steps, saw 13522 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:52:48] [INFO ] Invariants computation overflowed in 223 ms
[2022-05-15 21:52:50] [INFO ] After 1545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 21:53:15] [INFO ] After 23402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 21:53:15] [INFO ] After 23412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-15 21:53:15] [INFO ] After 25044ms 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 10600 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 2399 transitions
Trivial Post-agglo rules discarded 2399 transitions
Performed 2399 trivial Post agglomeration. Transition count delta: 2399
Iterating post reduction 0 with 2402 rules applied. Total rules applied 2403 place count 10597 transition count 7597
Reduce places removed 2399 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4803 place count 8198 transition count 7596
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4804 place count 8197 transition count 7596
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4804 place count 8197 transition count 7195
Deduced a syphon composed of 401 places in 707 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5606 place count 7796 transition count 7195
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: 1799
Deduced a syphon composed of 1799 places in 281 ms
Reduce places removed 1799 places and 0 transitions.
Iterating global reduction 3 with 3598 rules applied. Total rules applied 9204 place count 5997 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 220 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9406 place count 5896 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 212 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9608 place count 5795 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 211 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9810 place count 5694 transition count 5396
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 195 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 10000 place count 5599 transition count 5396
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 3 with 797 rules applied. Total rules applied 10797 place count 5599 transition count 4599
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 3 with 797 rules applied. Total rules applied 11594 place count 4802 transition count 4599
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 800 times.
Drop transitions removed 800 transitions
Iterating global reduction 4 with 800 rules applied. Total rules applied 12394 place count 4802 transition count 4599
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12395 place count 4801 transition count 4598
Applied a total of 12395 rules in 7687 ms. Remains 4801 /10600 variables (removed 5799) and now considering 4598/9998 (removed 5400) transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/10600 places, 4598/9998 transitions.
Incomplete random walk after 10000 steps, including 1272 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 68888 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68888 steps, saw 34462 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 4598 rows 4801 cols
[2022-05-15 21:53:27] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 21:53:27] [INFO ] After 586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 21:53:52] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 4801 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4801/4801 places, 4598/4598 transitions.
Applied a total of 0 rules in 694 ms. Remains 4801 /4801 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/4801 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4801/4801 places, 4598/4598 transitions.
Applied a total of 0 rules in 669 ms. Remains 4801 /4801 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4801 cols
[2022-05-15 21:53:54] [INFO ] Invariants computation overflowed in 83 ms
[2022-05-15 21:54:24] [INFO ] Performed 1754/4801 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 21:54:54] [INFO ] Performed 4303/4801 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 21:54:57] [INFO ] Implicit Places using invariants in 63500 ms returned []
// Phase 1: matrix 4598 rows 4801 cols
[2022-05-15 21:54:57] [INFO ] Invariants computation overflowed in 88 ms
[2022-05-15 21:54:58] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 64444 ms to find 0 implicit places.
[2022-05-15 21:54:58] [INFO ] Redundant transitions in 470 ms returned []
// Phase 1: matrix 4598 rows 4801 cols
[2022-05-15 21:54:59] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 21:55:02] [INFO ] Dead Transitions using invariants and state equation in 3770 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/4801 places, 4598/4598 transitions.
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3424 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:55:07] [INFO ] Invariants computation overflowed in 238 ms
[2022-05-15 21:55:08] [INFO ] Implicit Places using invariants in 1112 ms returned []
Implicit Place search using SMT only with invariants took 1113 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:55:08] [INFO ] Invariants computation overflowed in 223 ms
[2022-05-15 21:55:09] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.31 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 26444 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26444 steps, saw 13231 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:55:18] [INFO ] Invariants computation overflowed in 253 ms
[2022-05-15 21:55:19] [INFO ] After 1428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 21:55:44] [INFO ] After 23446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 21:55:44] [INFO ] After 23458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-15 21:55:44] [INFO ] After 25055ms 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 10600 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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 2399 transitions
Trivial Post-agglo rules discarded 2399 transitions
Performed 2399 trivial Post agglomeration. Transition count delta: 2399
Iterating post reduction 0 with 2402 rules applied. Total rules applied 2403 place count 10597 transition count 7597
Reduce places removed 2399 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4803 place count 8198 transition count 7596
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4804 place count 8197 transition count 7596
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4804 place count 8197 transition count 7195
Deduced a syphon composed of 401 places in 730 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5606 place count 7796 transition count 7195
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: 1799
Deduced a syphon composed of 1799 places in 280 ms
Reduce places removed 1799 places and 0 transitions.
Iterating global reduction 3 with 3598 rules applied. Total rules applied 9204 place count 5997 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 225 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9406 place count 5896 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 223 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9608 place count 5795 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 203 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9810 place count 5694 transition count 5396
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 192 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 10000 place count 5599 transition count 5396
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 3 with 797 rules applied. Total rules applied 10797 place count 5599 transition count 4599
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 3 with 797 rules applied. Total rules applied 11594 place count 4802 transition count 4599
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 800 times.
Drop transitions removed 800 transitions
Iterating global reduction 4 with 800 rules applied. Total rules applied 12394 place count 4802 transition count 4599
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12395 place count 4801 transition count 4598
Applied a total of 12395 rules in 7337 ms. Remains 4801 /10600 variables (removed 5799) and now considering 4598/9998 (removed 5400) transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/10600 places, 4598/9998 transitions.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 53725 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53725 steps, saw 26874 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 4598 rows 4801 cols
[2022-05-15 21:55:56] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 21:55:56] [INFO ] After 608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 21:56:21] [INFO ] After 24284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 21:56:21] [INFO ] State equation strengthened by 797 read => feed constraints.
[2022-05-15 21:56:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 21:56:21] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 4801 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4801/4801 places, 4598/4598 transitions.
Applied a total of 0 rules in 668 ms. Remains 4801 /4801 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/4801 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4801/4801 places, 4598/4598 transitions.
Applied a total of 0 rules in 661 ms. Remains 4801 /4801 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4801 cols
[2022-05-15 21:56:23] [INFO ] Invariants computation overflowed in 94 ms
[2022-05-15 21:56:53] [INFO ] Performed 1733/4801 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 21:57:23] [INFO ] Performed 4195/4801 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 21:57:27] [INFO ] Implicit Places using invariants in 64660 ms returned []
// Phase 1: matrix 4598 rows 4801 cols
[2022-05-15 21:57:27] [INFO ] Invariants computation overflowed in 88 ms
[2022-05-15 21:57:28] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 65675 ms to find 0 implicit places.
[2022-05-15 21:57:29] [INFO ] Redundant transitions in 411 ms returned []
// Phase 1: matrix 4598 rows 4801 cols
[2022-05-15 21:57:29] [INFO ] Invariants computation overflowed in 92 ms
[2022-05-15 21:57:33] [INFO ] Dead Transitions using invariants and state equation in 4013 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/4801 places, 4598/4598 transitions.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 2521 ms.
Product exploration explored 100000 steps with 25000 reset in 2447 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2398 place count 10600 transition count 9998
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 402 Pre rules applied. Total rules applied 2398 place count 10600 transition count 10398
Deduced a syphon composed of 2800 places in 1011 ms
Iterating global reduction 1 with 402 rules applied. Total rules applied 2800 place count 10600 transition count 10398
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2802 place count 10598 transition count 10396
Deduced a syphon composed of 2798 places in 870 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 2804 place count 10598 transition count 10396
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: -398
Deduced a syphon composed of 4594 places in 614 ms
Iterating global reduction 1 with 1796 rules applied. Total rules applied 4600 place count 10598 transition count 10794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4601 place count 10597 transition count 10793
Deduced a syphon composed of 4593 places in 562 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4602 place count 10597 transition count 10793
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -651
Deduced a syphon composed of 4694 places in 599 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4703 place count 10597 transition count 11444
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 4804 place count 10496 transition count 11242
Deduced a syphon composed of 4593 places in 539 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4905 place count 10496 transition count 11242
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -649
Deduced a syphon composed of 4694 places in 584 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5006 place count 10496 transition count 11891
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5107 place count 10395 transition count 11689
Deduced a syphon composed of 4593 places in 538 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5208 place count 10395 transition count 11689
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -658
Deduced a syphon composed of 4694 places in 582 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5309 place count 10395 transition count 12347
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5410 place count 10294 transition count 12145
Deduced a syphon composed of 4593 places in 551 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5511 place count 10294 transition count 12145
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -623
Deduced a syphon composed of 4690 places in 581 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 5608 place count 10294 transition count 12768
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 5705 place count 10197 transition count 12574
Deduced a syphon composed of 4593 places in 554 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 5802 place count 10197 transition count 12574
Deduced a syphon composed of 4593 places in 577 ms
Applied a total of 5802 rules in 22561 ms. Remains 10197 /10600 variables (removed 403) and now considering 12574/9998 (removed -2576) transitions.
// Phase 1: matrix 12574 rows 10197 cols
[2022-05-15 21:58:02] [INFO ] Invariants computation overflowed in 223 ms
[2022-05-15 21:58:03] [INFO ] Dead Transitions using invariants and state equation in 1010 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10197/10600 places, 12574/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 10197/10600 places, 12574/9998 transitions.
Product exploration timeout after 58510 steps with 14627 reset in 10002 ms.
Product exploration timeout after 60190 steps with 15047 reset in 10002 ms.
Built C files in :
/tmp/ltsmin10560275194801041410
[2022-05-15 21:58:23] [INFO ] Built C files in 161ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10560275194801041410
Running compilation step : cd /tmp/ltsmin10560275194801041410;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10560275194801041410;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10560275194801041410;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3581 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:58:30] [INFO ] Invariants computation overflowed in 337 ms
[2022-05-15 21:58:32] [INFO ] Implicit Places using invariants in 2220 ms returned []
Implicit Place search using SMT only with invariants took 2229 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:58:32] [INFO ] Invariants computation overflowed in 241 ms
[2022-05-15 21:58:34] [INFO ] Dead Transitions using invariants and state equation in 2136 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Built C files in :
/tmp/ltsmin1606677358426966507
[2022-05-15 21:58:36] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1606677358426966507
Running compilation step : cd /tmp/ltsmin1606677358426966507;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1606677358426966507;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1606677358426966507;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:58:46] [INFO ] Flatten gal took : 545 ms
[2022-05-15 21:58:47] [INFO ] Flatten gal took : 307 ms
[2022-05-15 21:58:47] [INFO ] Time to serialize gal into /tmp/LTL7233953416698916945.gal : 63 ms
[2022-05-15 21:58:47] [INFO ] Time to serialize properties into /tmp/LTL9497154559277249340.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7233953416698916945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9497154559277249340.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7233953...266
Read 1 LTL properties
Checking formula 0 : !(((X(X(F(X(F("((p5456>=1)||(p9622<=p2666))"))))))||(G(X(X("(p7727<=p6851)"))))))
Formula 0 simplified : !(XXFXF"((p5456>=1)||(p9622<=p2666))" | GXX"(p7727<=p6851)")
Detected timeout of ITS tools.
[2022-05-15 21:59:02] [INFO ] Flatten gal took : 320 ms
[2022-05-15 21:59:02] [INFO ] Applying decomposition
[2022-05-15 21:59:02] [INFO ] Flatten gal took : 320 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9651390680000554646.txt' '-o' '/tmp/graph9651390680000554646.bin' '-w' '/tmp/graph9651390680000554646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9651390680000554646.bin' '-l' '-1' '-v' '-w' '/tmp/graph9651390680000554646.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:59:04] [INFO ] Decomposing Gal with order
[2022-05-15 21:59:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:59:11] [INFO ] Removed a total of 2839 redundant transitions.
[2022-05-15 21:59:11] [INFO ] Flatten gal took : 1156 ms
[2022-05-15 21:59:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 216 ms.
[2022-05-15 21:59:13] [INFO ] Time to serialize gal into /tmp/LTL12844322293581430168.gal : 139 ms
[2022-05-15 21:59:13] [INFO ] Time to serialize properties into /tmp/LTL781356748951676198.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12844322293581430168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL781356748951676198.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1284432...266
Read 1 LTL properties
Checking formula 0 : !(((X(X(F(X(F("((gi4.gi0.gi1.gi0.gi1.gi1.gi4.gu2365.p5456>=1)||(gu1056.p9622<=gu1056.p2666))"))))))||(G(X(X("(gu3429.p7727<=gu3429.p68...165
Formula 0 simplified : !(XXFXF"((gi4.gi0.gi1.gi0.gi1.gi1.gi4.gu2365.p5456>=1)||(gu1056.p9622<=gu1056.p2666))" | GXX"(gu3429.p7727<=gu3429.p6851)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16337762995520439277
[2022-05-15 21:59:28] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16337762995520439277
Running compilation step : cd /tmp/ltsmin16337762995520439277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16337762995520439277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16337762995520439277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-200-LTLCardinality-00 finished in 423210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(p0)))))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2395 transitions
Trivial Post-agglo rules discarded 2395 transitions
Performed 2395 trivial Post agglomeration. Transition count delta: 2395
Iterating post reduction 0 with 2395 rules applied. Total rules applied 2395 place count 10599 transition count 7602
Reduce places removed 2395 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2397 rules applied. Total rules applied 4792 place count 8204 transition count 7600
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4794 place count 8202 transition count 7600
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 4794 place count 8202 transition count 7201
Deduced a syphon composed of 399 places in 759 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 5592 place count 7803 transition count 7201
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 287 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 3 with 3604 rules applied. Total rules applied 9196 place count 6001 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 262 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9398 place count 5900 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 238 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9600 place count 5799 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 218 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9802 place count 5698 transition count 5399
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 206 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 9990 place count 5604 transition count 5399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9991 place count 5603 transition count 5398
Applied a total of 9991 rules in 6114 ms. Remains 5603 /10600 variables (removed 4997) and now considering 5398/9998 (removed 4600) transitions.
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 21:59:38] [INFO ] Invariants computation overflowed in 127 ms
[2022-05-15 21:59:42] [INFO ] Implicit Places using invariants in 3869 ms returned []
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 21:59:42] [INFO ] Invariants computation overflowed in 126 ms
[2022-05-15 21:59:43] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 5048 ms to find 0 implicit places.
[2022-05-15 21:59:43] [INFO ] Redundant transitions in 353 ms returned []
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 21:59:43] [INFO ] Invariants computation overflowed in 130 ms
[2022-05-15 21:59:46] [INFO ] Dead Transitions using invariants and state equation in 3444 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5603/10600 places, 5398/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/10600 places, 5398/9998 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ s625 s3670) (LEQ s4131 s3978))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13899 reset in 317 ms.
Product exploration explored 100000 steps with 13789 reset in 298 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17771 edges and 5603 vertex of which 5601 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 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 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1380 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 790 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 51094 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51094 steps, saw 25555 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 21:59:51] [INFO ] Invariants computation overflowed in 127 ms
[2022-05-15 21:59:52] [INFO ] After 520ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 22:00:17] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5603/5603 places, 5398/5398 transitions.
Graph (complete) has 16971 edges and 5603 vertex of which 5601 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 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 5601 transition count 5396
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 5601 transition count 5395
Deduced a syphon composed of 1 places in 185 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5600 transition count 5395
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 1 with 797 rules applied. Total rules applied 802 place count 5600 transition count 4598
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 1 with 797 rules applied. Total rules applied 1599 place count 4803 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 800 times.
Drop transitions removed 800 transitions
Iterating global reduction 2 with 800 rules applied. Total rules applied 2399 place count 4803 transition count 4598
Applied a total of 2399 rules in 3029 ms. Remains 4803 /5603 variables (removed 800) and now considering 4598/5398 (removed 800) transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/5603 places, 4598/5398 transitions.
Incomplete random walk after 10000 steps, including 1230 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 61019 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61019 steps, saw 30527 distinct states, run finished after 3003 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:00:23] [INFO ] Invariants computation overflowed in 88 ms
[2022-05-15 22:00:24] [INFO ] After 463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 22:00:49] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4803/4803 places, 4598/4598 transitions.
Applied a total of 0 rules in 1139 ms. Remains 4803 /4803 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/4803 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4803/4803 places, 4598/4598 transitions.
Applied a total of 0 rules in 1055 ms. Remains 4803 /4803 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:00:51] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-15 22:01:22] [INFO ] Performed 1097/4803 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:01:52] [INFO ] Performed 2030/4803 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:02:22] [INFO ] Performed 3026/4803 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:02:53] [INFO ] Performed 4335/4803 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:02:53] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:02:53] [INFO ] Implicit Places using invariants in 121485 ms returned []
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:02:53] [INFO ] Invariants computation overflowed in 89 ms
[2022-05-15 22:02:54] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 122464 ms to find 0 implicit places.
[2022-05-15 22:02:54] [INFO ] Redundant transitions in 598 ms returned []
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:02:54] [INFO ] Invariants computation overflowed in 85 ms
[2022-05-15 22:02:59] [INFO ] Dead Transitions using invariants and state equation in 4842 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/4803 places, 4598/4598 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 5398/5398 transitions.
Applied a total of 0 rules in 489 ms. Remains 5603 /5603 variables (removed 0) and now considering 5398/5398 (removed 0) transitions.
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 22:03:01] [INFO ] Invariants computation overflowed in 133 ms
[2022-05-15 22:03:04] [INFO ] Implicit Places using invariants in 3993 ms returned []
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 22:03:05] [INFO ] Invariants computation overflowed in 141 ms
[2022-05-15 22:03:05] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 5066 ms to find 0 implicit places.
[2022-05-15 22:03:06] [INFO ] Redundant transitions in 358 ms returned []
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 22:03:06] [INFO ] Invariants computation overflowed in 131 ms
[2022-05-15 22:03:10] [INFO ] Dead Transitions using invariants and state equation in 3779 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5603 places, 5398/5398 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17771 edges and 5603 vertex of which 5601 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 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 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 50888 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 50888 steps, saw 25452 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 22:03:14] [INFO ] Invariants computation overflowed in 124 ms
[2022-05-15 22:03:14] [INFO ] After 599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 22:03:39] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5603/5603 places, 5398/5398 transitions.
Graph (complete) has 16971 edges and 5603 vertex of which 5601 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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 5601 transition count 5396
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 5601 transition count 5395
Deduced a syphon composed of 1 places in 194 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5600 transition count 5395
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 1 with 797 rules applied. Total rules applied 802 place count 5600 transition count 4598
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 1 with 797 rules applied. Total rules applied 1599 place count 4803 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 800 times.
Drop transitions removed 800 transitions
Iterating global reduction 2 with 800 rules applied. Total rules applied 2399 place count 4803 transition count 4598
Applied a total of 2399 rules in 3216 ms. Remains 4803 /5603 variables (removed 800) and now considering 4598/5398 (removed 800) transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/5603 places, 4598/5398 transitions.
Incomplete random walk after 10000 steps, including 1300 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 59607 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59607 steps, saw 29829 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:03:46] [INFO ] Invariants computation overflowed in 89 ms
[2022-05-15 22:03:47] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 22:04:12] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4803/4803 places, 4598/4598 transitions.
Applied a total of 0 rules in 1159 ms. Remains 4803 /4803 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/4803 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4803/4803 places, 4598/4598 transitions.
Applied a total of 0 rules in 1144 ms. Remains 4803 /4803 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:04:14] [INFO ] Invariants computation overflowed in 85 ms
[2022-05-15 22:04:45] [INFO ] Performed 1097/4803 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:05:15] [INFO ] Performed 2035/4803 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:05:45] [INFO ] Performed 3050/4803 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:06:15] [INFO ] Performed 4411/4803 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:06:15] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:06:15] [INFO ] Implicit Places using invariants in 121000 ms returned []
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:06:15] [INFO ] Invariants computation overflowed in 74 ms
[2022-05-15 22:06:16] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 122013 ms to find 0 implicit places.
[2022-05-15 22:06:17] [INFO ] Redundant transitions in 593 ms returned []
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:06:17] [INFO ] Invariants computation overflowed in 87 ms
[2022-05-15 22:06:21] [INFO ] Dead Transitions using invariants and state equation in 4658 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/4803 places, 4598/4598 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13880 reset in 265 ms.
Product exploration explored 100000 steps with 13850 reset in 282 ms.
Built C files in :
/tmp/ltsmin16039488037163498233
[2022-05-15 22:06:23] [INFO ] Too many transitions (5398) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:06:23] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16039488037163498233
Running compilation step : cd /tmp/ltsmin16039488037163498233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16039488037163498233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16039488037163498233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 5398/5398 transitions.
Applied a total of 0 rules in 488 ms. Remains 5603 /5603 variables (removed 0) and now considering 5398/5398 (removed 0) transitions.
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 22:06:27] [INFO ] Invariants computation overflowed in 131 ms
[2022-05-15 22:06:31] [INFO ] Implicit Places using invariants in 4353 ms returned []
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 22:06:31] [INFO ] Invariants computation overflowed in 138 ms
[2022-05-15 22:06:32] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 5541 ms to find 0 implicit places.
[2022-05-15 22:06:32] [INFO ] Redundant transitions in 356 ms returned []
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 22:06:33] [INFO ] Invariants computation overflowed in 127 ms
[2022-05-15 22:06:37] [INFO ] Dead Transitions using invariants and state equation in 4767 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5603 places, 5398/5398 transitions.
Built C files in :
/tmp/ltsmin13635401620964725309
[2022-05-15 22:06:37] [INFO ] Too many transitions (5398) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:06:38] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13635401620964725309
Running compilation step : cd /tmp/ltsmin13635401620964725309;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13635401620964725309;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13635401620964725309;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 22:06:42] [INFO ] Flatten gal took : 456 ms
[2022-05-15 22:06:42] [INFO ] Flatten gal took : 218 ms
[2022-05-15 22:06:42] [INFO ] Time to serialize gal into /tmp/LTL17828438130121470098.gal : 18 ms
[2022-05-15 22:06:42] [INFO ] Time to serialize properties into /tmp/LTL15623436198306589734.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17828438130121470098.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15623436198306589734.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1782843...268
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X("((p1516<=p6709)||(p7486<=p7234))"))))))
Formula 0 simplified : !XFGX"((p1516<=p6709)||(p7486<=p7234))"
Detected timeout of ITS tools.
[2022-05-15 22:06:57] [INFO ] Flatten gal took : 209 ms
[2022-05-15 22:06:57] [INFO ] Applying decomposition
[2022-05-15 22:06:58] [INFO ] Flatten gal took : 263 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16527498072939779489.txt' '-o' '/tmp/graph16527498072939779489.bin' '-w' '/tmp/graph16527498072939779489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16527498072939779489.bin' '-l' '-1' '-v' '-w' '/tmp/graph16527498072939779489.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:06:58] [INFO ] Decomposing Gal with order
[2022-05-15 22:06:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:07:00] [INFO ] Removed a total of 4462 redundant transitions.
[2022-05-15 22:07:00] [INFO ] Flatten gal took : 398 ms
[2022-05-15 22:07:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 255 ms.
[2022-05-15 22:07:01] [INFO ] Time to serialize gal into /tmp/LTL13518175713707187126.gal : 171 ms
[2022-05-15 22:07:01] [INFO ] Time to serialize properties into /tmp/LTL16800331209217326077.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13518175713707187126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16800331209217326077.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1351817...268
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X("((gu1438.p1516<=gu1438.p6709)||(gu1557.p7486<=gu1557.p7234))"))))))
Formula 0 simplified : !XFGX"((gu1438.p1516<=gu1438.p6709)||(gu1557.p7486<=gu1557.p7234))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12743794245836456021
[2022-05-15 22:07:16] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12743794245836456021
Running compilation step : cd /tmp/ltsmin12743794245836456021;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12743794245836456021;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12743794245836456021;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-200-LTLCardinality-01 finished in 467742 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(G((F(p0)&&p1))))||p2)))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2394 transitions
Trivial Post-agglo rules discarded 2394 transitions
Performed 2394 trivial Post agglomeration. Transition count delta: 2394
Iterating post reduction 0 with 2394 rules applied. Total rules applied 2394 place count 10599 transition count 7603
Reduce places removed 2394 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2396 rules applied. Total rules applied 4790 place count 8205 transition count 7601
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4792 place count 8203 transition count 7601
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4792 place count 8203 transition count 7201
Deduced a syphon composed of 400 places in 776 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5592 place count 7803 transition count 7201
Performed 1801 Post agglomeration using F-continuation condition.Transition count delta: 1801
Deduced a syphon composed of 1801 places in 391 ms
Reduce places removed 1801 places and 0 transitions.
Iterating global reduction 3 with 3602 rules applied. Total rules applied 9194 place count 6002 transition count 5400
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 239 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9396 place count 5901 transition count 5400
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 228 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9598 place count 5800 transition count 5400
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 263 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9800 place count 5699 transition count 5400
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 204 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9990 place count 5604 transition count 5400
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 9992 place count 5604 transition count 5400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9993 place count 5603 transition count 5399
Applied a total of 9993 rules in 6832 ms. Remains 5603 /10600 variables (removed 4997) and now considering 5399/9998 (removed 4599) transitions.
// Phase 1: matrix 5399 rows 5603 cols
[2022-05-15 22:07:26] [INFO ] Invariants computation overflowed in 108 ms
[2022-05-15 22:07:34] [INFO ] Implicit Places using invariants in 7430 ms returned []
// Phase 1: matrix 5399 rows 5603 cols
[2022-05-15 22:07:34] [INFO ] Invariants computation overflowed in 225 ms
[2022-05-15 22:07:36] [INFO ] Implicit Places using invariants and state equation in 2258 ms returned []
Implicit Place search using SMT with State Equation took 9722 ms to find 0 implicit places.
[2022-05-15 22:07:36] [INFO ] Redundant transitions in 351 ms returned []
// Phase 1: matrix 5399 rows 5603 cols
[2022-05-15 22:07:36] [INFO ] Invariants computation overflowed in 110 ms
[2022-05-15 22:07:40] [INFO ] Dead Transitions using invariants and state equation in 3578 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5603/10600 places, 5399/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/10600 places, 5399/9998 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT 1 s386), p1:(LEQ 2 s4693), p0:(LEQ s3387 s664)], 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 13823 reset in 492 ms.
Product exploration explored 100000 steps with 13912 reset in 511 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17778 edges and 5603 vertex of which 5601 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 387 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 1379 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 802 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 43496 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{0=1}
Probabilistic random walk after 43496 steps, saw 21757 distinct states, run finished after 3002 ms. (steps per millisecond=14 ) properties seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 5399 rows 5603 cols
[2022-05-15 22:07:46] [INFO ] Invariants computation overflowed in 109 ms
[2022-05-15 22:07:47] [INFO ] After 777ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 22:08:12] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5603/5603 places, 5399/5399 transitions.
Graph (complete) has 16980 edges and 5603 vertex of which 5601 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 5601 transition count 5397
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 5601 transition count 5396
Deduced a syphon composed of 1 places in 199 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5600 transition count 5396
Free-agglomeration rule (complex) applied 799 times.
Iterating global reduction 1 with 799 rules applied. Total rules applied 804 place count 5600 transition count 4597
Reduce places removed 799 places and 0 transitions.
Iterating post reduction 1 with 799 rules applied. Total rules applied 1603 place count 4801 transition count 4597
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 799 times.
Drop transitions removed 799 transitions
Iterating global reduction 2 with 799 rules applied. Total rules applied 2402 place count 4801 transition count 4597
Applied a total of 2402 rules in 3451 ms. Remains 4801 /5603 variables (removed 802) and now considering 4597/5399 (removed 802) transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/5603 places, 4597/5399 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 50739 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 50739 steps, saw 25391 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 4597 rows 4801 cols
[2022-05-15 22:08:20] [INFO ] Invariants computation overflowed in 76 ms
[2022-05-15 22:08:20] [INFO ] After 618ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 22:08:45] [INFO ] After 24164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 22:08:46] [INFO ] State equation strengthened by 797 read => feed constraints.
[2022-05-15 22:08:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:08:46] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4801 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4801/4801 places, 4597/4597 transitions.
Applied a total of 0 rules in 1041 ms. Remains 4801 /4801 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/4801 places, 4597/4597 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4801/4801 places, 4597/4597 transitions.
Applied a total of 0 rules in 1103 ms. Remains 4801 /4801 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
// Phase 1: matrix 4597 rows 4801 cols
[2022-05-15 22:08:48] [INFO ] Invariants computation overflowed in 79 ms
[2022-05-15 22:09:18] [INFO ] Performed 1096/4801 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:09:49] [INFO ] Performed 2029/4801 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:10:19] [INFO ] Performed 3027/4801 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:10:49] [INFO ] Performed 4333/4801 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:10:49] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:10:49] [INFO ] Implicit Places using invariants in 121045 ms returned []
// Phase 1: matrix 4597 rows 4801 cols
[2022-05-15 22:10:49] [INFO ] Invariants computation overflowed in 75 ms
[2022-05-15 22:10:50] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 122014 ms to find 0 implicit places.
[2022-05-15 22:10:50] [INFO ] Redundant transitions in 607 ms returned []
// Phase 1: matrix 4597 rows 4801 cols
[2022-05-15 22:10:50] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 22:10:55] [INFO ] Dead Transitions using invariants and state equation in 4627 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/4801 places, 4597/4597 transitions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 11 factoid took 381 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 5399/5399 transitions.
Applied a total of 0 rules in 482 ms. Remains 5603 /5603 variables (removed 0) and now considering 5399/5399 (removed 0) transitions.
// Phase 1: matrix 5399 rows 5603 cols
[2022-05-15 22:10:57] [INFO ] Invariants computation overflowed in 115 ms
[2022-05-15 22:11:00] [INFO ] Implicit Places using invariants in 3782 ms returned []
// Phase 1: matrix 5399 rows 5603 cols
[2022-05-15 22:11:01] [INFO ] Invariants computation overflowed in 106 ms
[2022-05-15 22:11:02] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 4841 ms to find 0 implicit places.
[2022-05-15 22:11:02] [INFO ] Redundant transitions in 345 ms returned []
// Phase 1: matrix 5399 rows 5603 cols
[2022-05-15 22:11:02] [INFO ] Invariants computation overflowed in 111 ms
[2022-05-15 22:11:05] [INFO ] Dead Transitions using invariants and state equation in 3437 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5603 places, 5399/5399 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17778 edges and 5603 vertex of which 5601 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 386 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 1379 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 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 824 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 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 10000 steps, including 800 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 774 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 44575 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{0=1}
Probabilistic random walk after 44575 steps, saw 22293 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 5399 rows 5603 cols
[2022-05-15 22:11:11] [INFO ] Invariants computation overflowed in 106 ms
[2022-05-15 22:11:11] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 22:11:36] [INFO ] After 24020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 22:11:36] [INFO ] State equation strengthened by 397 read => feed constraints.
[2022-05-15 22:11:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:11:36] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5603/5603 places, 5399/5399 transitions.
Graph (complete) has 16980 edges and 5603 vertex of which 5601 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 5601 transition count 5397
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 5601 transition count 5396
Deduced a syphon composed of 1 places in 186 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5600 transition count 5396
Free-agglomeration rule (complex) applied 799 times.
Iterating global reduction 1 with 799 rules applied. Total rules applied 804 place count 5600 transition count 4597
Reduce places removed 799 places and 0 transitions.
Iterating post reduction 1 with 799 rules applied. Total rules applied 1603 place count 4801 transition count 4597
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 799 times.
Drop transitions removed 799 transitions
Iterating global reduction 2 with 799 rules applied. Total rules applied 2402 place count 4801 transition count 4597
Applied a total of 2402 rules in 2973 ms. Remains 4801 /5603 variables (removed 802) and now considering 4597/5399 (removed 802) transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/5603 places, 4597/5399 transitions.
Incomplete random walk after 10000 steps, including 1300 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 50705 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 50705 steps, saw 25375 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 4597 rows 4801 cols
[2022-05-15 22:11:43] [INFO ] Invariants computation overflowed in 77 ms
[2022-05-15 22:11:44] [INFO ] After 689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 22:12:09] [INFO ] After 24115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 22:12:09] [INFO ] State equation strengthened by 797 read => feed constraints.
[2022-05-15 22:12:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:12:09] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4801 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4801/4801 places, 4597/4597 transitions.
Applied a total of 0 rules in 1044 ms. Remains 4801 /4801 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/4801 places, 4597/4597 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4801/4801 places, 4597/4597 transitions.
Applied a total of 0 rules in 1207 ms. Remains 4801 /4801 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
// Phase 1: matrix 4597 rows 4801 cols
[2022-05-15 22:12:12] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 22:12:42] [INFO ] Performed 1101/4801 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:13:12] [INFO ] Performed 2034/4801 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:13:42] [INFO ] Performed 3051/4801 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:14:13] [INFO ] Performed 4360/4801 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:14:13] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:14:13] [INFO ] Implicit Places using invariants in 121066 ms returned []
// Phase 1: matrix 4597 rows 4801 cols
[2022-05-15 22:14:13] [INFO ] Invariants computation overflowed in 88 ms
[2022-05-15 22:14:13] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 121985 ms to find 0 implicit places.
[2022-05-15 22:14:14] [INFO ] Redundant transitions in 608 ms returned []
// Phase 1: matrix 4597 rows 4801 cols
[2022-05-15 22:14:14] [INFO ] Invariants computation overflowed in 83 ms
[2022-05-15 22:14:19] [INFO ] Dead Transitions using invariants and state equation in 4857 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/4801 places, 4597/4597 transitions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 11 factoid took 427 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 13945 reset in 282 ms.
Product exploration explored 100000 steps with 13929 reset in 279 ms.
Built C files in :
/tmp/ltsmin3414854491704232474
[2022-05-15 22:14:21] [INFO ] Too many transitions (5399) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:14:21] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3414854491704232474
Running compilation step : cd /tmp/ltsmin3414854491704232474;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3414854491704232474;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3414854491704232474;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 5399/5399 transitions.
Applied a total of 0 rules in 492 ms. Remains 5603 /5603 variables (removed 0) and now considering 5399/5399 (removed 0) transitions.
// Phase 1: matrix 5399 rows 5603 cols
[2022-05-15 22:14:25] [INFO ] Invariants computation overflowed in 123 ms
[2022-05-15 22:14:29] [INFO ] Implicit Places using invariants in 4072 ms returned []
// Phase 1: matrix 5399 rows 5603 cols
[2022-05-15 22:14:29] [INFO ] Invariants computation overflowed in 115 ms
[2022-05-15 22:14:30] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 5226 ms to find 0 implicit places.
[2022-05-15 22:14:30] [INFO ] Redundant transitions in 347 ms returned []
// Phase 1: matrix 5399 rows 5603 cols
[2022-05-15 22:14:30] [INFO ] Invariants computation overflowed in 121 ms
[2022-05-15 22:14:34] [INFO ] Dead Transitions using invariants and state equation in 3695 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5603 places, 5399/5399 transitions.
Built C files in :
/tmp/ltsmin12528802612023697092
[2022-05-15 22:14:34] [INFO ] Too many transitions (5399) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:14:34] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12528802612023697092
Running compilation step : cd /tmp/ltsmin12528802612023697092;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12528802612023697092;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12528802612023697092;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 22:14:38] [INFO ] Flatten gal took : 194 ms
[2022-05-15 22:14:38] [INFO ] Flatten gal took : 199 ms
[2022-05-15 22:14:38] [INFO ] Time to serialize gal into /tmp/LTL5931812146133560245.gal : 20 ms
[2022-05-15 22:14:38] [INFO ] Time to serialize properties into /tmp/LTL3274881346085295261.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5931812146133560245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3274881346085295261.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5931812...266
Read 1 LTL properties
Checking formula 0 : !((G((G(F(G((F("(p6220<=p1581)"))&&("(p8450>=2)")))))||("(p111<1)"))))
Formula 0 simplified : !G("(p111<1)" | GFG("(p8450>=2)" & F"(p6220<=p1581)"))
Detected timeout of ITS tools.
[2022-05-15 22:14:53] [INFO ] Flatten gal took : 188 ms
[2022-05-15 22:14:53] [INFO ] Applying decomposition
[2022-05-15 22:14:54] [INFO ] Flatten gal took : 196 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10018395870648884183.txt' '-o' '/tmp/graph10018395870648884183.bin' '-w' '/tmp/graph10018395870648884183.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10018395870648884183.bin' '-l' '-1' '-v' '-w' '/tmp/graph10018395870648884183.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:14:54] [INFO ] Decomposing Gal with order
[2022-05-15 22:14:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:14:55] [INFO ] Removed a total of 4465 redundant transitions.
[2022-05-15 22:14:56] [INFO ] Flatten gal took : 367 ms
[2022-05-15 22:14:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 213 ms.
[2022-05-15 22:14:56] [INFO ] Time to serialize gal into /tmp/LTL4898549052491851244.gal : 45 ms
[2022-05-15 22:14:56] [INFO ] Time to serialize properties into /tmp/LTL2970788210087227303.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4898549052491851244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2970788210087227303.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4898549...266
Read 1 LTL properties
Checking formula 0 : !((G((G(F(G((F("(gu261.p6220<=gu261.p1581)"))&&("(gi0.gi1.gi0.gi0.gi1.gu1834.p8450>=2)")))))||("(gi7.gu159.p111<1)"))))
Formula 0 simplified : !G("(gi7.gu159.p111<1)" | GFG("(gi0.gi1.gi0.gi0.gi1.gu1834.p8450>=2)" & F"(gu261.p6220<=gu261.p1581)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8353350220041589734
[2022-05-15 22:15:11] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8353350220041589734
Running compilation step : cd /tmp/ltsmin8353350220041589734;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin8353350220041589734;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin8353350220041589734;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-200-LTLCardinality-02 finished in 475149 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p0 U p1)||F(X((G((X(p2)&&p3))||p2))))))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2394 transitions
Trivial Post-agglo rules discarded 2394 transitions
Performed 2394 trivial Post agglomeration. Transition count delta: 2394
Iterating post reduction 0 with 2394 rules applied. Total rules applied 2394 place count 10599 transition count 7603
Reduce places removed 2394 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2396 rules applied. Total rules applied 4790 place count 8205 transition count 7601
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4792 place count 8203 transition count 7601
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4792 place count 8203 transition count 7200
Deduced a syphon composed of 401 places in 792 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5594 place count 7802 transition count 7200
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: 1799
Deduced a syphon composed of 1799 places in 294 ms
Reduce places removed 1799 places and 0 transitions.
Iterating global reduction 3 with 3598 rules applied. Total rules applied 9192 place count 6003 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 235 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9394 place count 5902 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 220 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9596 place count 5801 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 263 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9798 place count 5700 transition count 5401
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 191 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9988 place count 5605 transition count 5401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9989 place count 5604 transition count 5400
Applied a total of 9989 rules in 6332 ms. Remains 5604 /10600 variables (removed 4996) and now considering 5400/9998 (removed 4598) transitions.
// Phase 1: matrix 5400 rows 5604 cols
[2022-05-15 22:15:21] [INFO ] Invariants computation overflowed in 113 ms
[2022-05-15 22:15:25] [INFO ] Implicit Places using invariants in 3988 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2022-05-15 22:15:25] [INFO ] Invariants computation overflowed in 111 ms
[2022-05-15 22:15:26] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 5112 ms to find 0 implicit places.
[2022-05-15 22:15:26] [INFO ] Redundant transitions in 351 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2022-05-15 22:15:26] [INFO ] Invariants computation overflowed in 117 ms
[2022-05-15 22:15:30] [INFO ] Dead Transitions using invariants and state equation in 3628 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5604/10600 places, 5400/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5604/10600 places, 5400/9998 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-200-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s572), p2:(LEQ 2 s1831)], 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 13860 reset in 364 ms.
Product exploration explored 100000 steps with 13878 reset in 330 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17775 edges and 5604 vertex of which 5602 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 1404 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 810 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 784 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 47216 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47216 steps, saw 23613 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5400 rows 5604 cols
[2022-05-15 22:15:35] [INFO ] Invariants computation overflowed in 110 ms
[2022-05-15 22:16:00] [INFO ] After 24286ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 22:16:00] [INFO ] State equation strengthened by 397 read => feed constraints.
[2022-05-15 22:16:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:16:00] [INFO ] After 25057ms 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 2 out of 5604 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5604/5604 places, 5400/5400 transitions.
Graph (complete) has 16977 edges and 5604 vertex of which 5602 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.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 5602 transition count 5396
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 5600 transition count 5396
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 5600 transition count 5395
Deduced a syphon composed of 1 places in 194 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 5599 transition count 5395
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 195 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 5596 transition count 5392
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 2 with 797 rules applied. Total rules applied 812 place count 5596 transition count 4595
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 2 with 797 rules applied. Total rules applied 1609 place count 4799 transition count 4595
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 798 times.
Drop transitions removed 798 transitions
Iterating global reduction 3 with 798 rules applied. Total rules applied 2407 place count 4799 transition count 4595
Applied a total of 2407 rules in 3829 ms. Remains 4799 /5604 variables (removed 805) and now considering 4595/5400 (removed 805) transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/5604 places, 4595/5400 transitions.
Incomplete random walk after 10000 steps, including 1260 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 55742 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55742 steps, saw 27883 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4595 rows 4799 cols
[2022-05-15 22:16:08] [INFO ] Invariants computation overflowed in 86 ms
[2022-05-15 22:16:33] [INFO ] After 24351ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 22:16:33] [INFO ] State equation strengthened by 798 read => feed constraints.
[2022-05-15 22:16:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:16:33] [INFO ] After 25075ms 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 2 out of 4799 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4799/4799 places, 4595/4595 transitions.
Applied a total of 0 rules in 1194 ms. Remains 4799 /4799 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/4799 places, 4595/4595 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4799/4799 places, 4595/4595 transitions.
Applied a total of 0 rules in 1168 ms. Remains 4799 /4799 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
// Phase 1: matrix 4595 rows 4799 cols
[2022-05-15 22:16:35] [INFO ] Invariants computation overflowed in 94 ms
[2022-05-15 22:17:06] [INFO ] Performed 1076/4799 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:17:36] [INFO ] Performed 2003/4799 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:18:06] [INFO ] Performed 2993/4799 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:18:36] [INFO ] Performed 4269/4799 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:18:36] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:18:36] [INFO ] Implicit Places using invariants in 121248 ms returned []
// Phase 1: matrix 4595 rows 4799 cols
[2022-05-15 22:18:37] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 22:18:37] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 122257 ms to find 0 implicit places.
[2022-05-15 22:18:38] [INFO ] Redundant transitions in 596 ms returned []
// Phase 1: matrix 4595 rows 4799 cols
[2022-05-15 22:18:38] [INFO ] Invariants computation overflowed in 85 ms
[2022-05-15 22:18:43] [INFO ] Dead Transitions using invariants and state equation in 4907 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/4799 places, 4595/4595 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 73 ms :[(AND p1 (NOT p2)), (NOT p2)]
Support contains 2 out of 5604 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 5604/5604 places, 5400/5400 transitions.
Applied a total of 0 rules in 492 ms. Remains 5604 /5604 variables (removed 0) and now considering 5400/5400 (removed 0) transitions.
// Phase 1: matrix 5400 rows 5604 cols
[2022-05-15 22:18:45] [INFO ] Invariants computation overflowed in 105 ms
[2022-05-15 22:18:48] [INFO ] Implicit Places using invariants in 3952 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2022-05-15 22:18:48] [INFO ] Invariants computation overflowed in 118 ms
[2022-05-15 22:18:49] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 4983 ms to find 0 implicit places.
[2022-05-15 22:18:50] [INFO ] Redundant transitions in 350 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2022-05-15 22:18:50] [INFO ] Invariants computation overflowed in 108 ms
[2022-05-15 22:18:53] [INFO ] Dead Transitions using invariants and state equation in 3688 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5604/5604 places, 5400/5400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17775 edges and 5604 vertex of which 5602 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 47067 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47067 steps, saw 23540 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5400 rows 5604 cols
[2022-05-15 22:18:58] [INFO ] Invariants computation overflowed in 113 ms
[2022-05-15 22:19:23] [INFO ] After 25047ms 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 2 out of 5604 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5604/5604 places, 5400/5400 transitions.
Graph (complete) has 16977 edges and 5604 vertex of which 5602 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 5602 transition count 5396
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 5600 transition count 5396
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 5600 transition count 5395
Deduced a syphon composed of 1 places in 214 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 5599 transition count 5395
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 186 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 5596 transition count 5392
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 2 with 797 rules applied. Total rules applied 812 place count 5596 transition count 4595
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 2 with 797 rules applied. Total rules applied 1609 place count 4799 transition count 4595
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 798 times.
Drop transitions removed 798 transitions
Iterating global reduction 3 with 798 rules applied. Total rules applied 2407 place count 4799 transition count 4595
Applied a total of 2407 rules in 3622 ms. Remains 4799 /5604 variables (removed 805) and now considering 4595/5400 (removed 805) transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/5604 places, 4595/5400 transitions.
Incomplete random walk after 10000 steps, including 1291 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 55949 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55949 steps, saw 27984 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4595 rows 4799 cols
[2022-05-15 22:19:30] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 22:19:55] [INFO ] After 24358ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 22:19:55] [INFO ] State equation strengthened by 798 read => feed constraints.
[2022-05-15 22:19:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:19:55] [INFO ] After 25079ms 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 2 out of 4799 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4799/4799 places, 4595/4595 transitions.
Applied a total of 0 rules in 1064 ms. Remains 4799 /4799 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/4799 places, 4595/4595 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4799/4799 places, 4595/4595 transitions.
Applied a total of 0 rules in 1116 ms. Remains 4799 /4799 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
// Phase 1: matrix 4595 rows 4799 cols
[2022-05-15 22:19:58] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-15 22:20:28] [INFO ] Performed 1076/4799 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:20:58] [INFO ] Performed 2008/4799 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:21:29] [INFO ] Performed 3026/4799 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:21:59] [INFO ] Performed 4352/4799 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:21:59] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:21:59] [INFO ] Implicit Places using invariants in 121000 ms returned []
// Phase 1: matrix 4595 rows 4799 cols
[2022-05-15 22:21:59] [INFO ] Invariants computation overflowed in 79 ms
[2022-05-15 22:22:00] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 121961 ms to find 0 implicit places.
[2022-05-15 22:22:00] [INFO ] Redundant transitions in 602 ms returned []
// Phase 1: matrix 4595 rows 4799 cols
[2022-05-15 22:22:00] [INFO ] Invariants computation overflowed in 78 ms
[2022-05-15 22:22:05] [INFO ] Dead Transitions using invariants and state equation in 4718 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/4799 places, 4595/4595 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 13856 reset in 299 ms.
Product exploration explored 100000 steps with 13924 reset in 267 ms.
Built C files in :
/tmp/ltsmin9831719317933886966
[2022-05-15 22:22:06] [INFO ] Too many transitions (5400) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:22:07] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9831719317933886966
Running compilation step : cd /tmp/ltsmin9831719317933886966;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9831719317933886966;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9831719317933886966;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 5604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5604/5604 places, 5400/5400 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 5604 transition count 5398
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5602 transition count 5398
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 211 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 5599 transition count 5395
Applied a total of 10 rules in 1075 ms. Remains 5599 /5604 variables (removed 5) and now considering 5395/5400 (removed 5) transitions.
// Phase 1: matrix 5395 rows 5599 cols
[2022-05-15 22:22:11] [INFO ] Invariants computation overflowed in 148 ms
[2022-05-15 22:22:15] [INFO ] Implicit Places using invariants in 4527 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2022-05-15 22:22:15] [INFO ] Invariants computation overflowed in 167 ms
[2022-05-15 22:22:16] [INFO ] Implicit Places using invariants and state equation in 1227 ms returned []
Implicit Place search using SMT with State Equation took 5757 ms to find 0 implicit places.
[2022-05-15 22:22:17] [INFO ] Redundant transitions in 352 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2022-05-15 22:22:17] [INFO ] Invariants computation overflowed in 164 ms
[2022-05-15 22:22:20] [INFO ] Dead Transitions using invariants and state equation in 3603 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5599/5604 places, 5395/5400 transitions.
Finished structural reductions, in 1 iterations. Remains : 5599/5604 places, 5395/5400 transitions.
Built C files in :
/tmp/ltsmin13734668214520043375
[2022-05-15 22:22:21] [INFO ] Too many transitions (5395) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:22:21] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13734668214520043375
Running compilation step : cd /tmp/ltsmin13734668214520043375;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13734668214520043375;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13734668214520043375;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 22:22:24] [INFO ] Flatten gal took : 175 ms
[2022-05-15 22:22:25] [INFO ] Flatten gal took : 181 ms
[2022-05-15 22:22:25] [INFO ] Time to serialize gal into /tmp/LTL11933370420575277915.gal : 29 ms
[2022-05-15 22:22:25] [INFO ] Time to serialize properties into /tmp/LTL14777276701323328232.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11933370420575277915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14777276701323328232.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1193337...268
Read 1 LTL properties
Checking formula 0 : !((G((!(("(p8933<=p2804)")U("(p1428>=3)")))||(F(X((G((X("(p3575>=2)"))&&("(p10025<=p1499)")))||("(p3575>=2)")))))))
Formula 0 simplified : !G(!("(p8933<=p2804)" U "(p1428>=3)") | FX("(p3575>=2)" | G("(p10025<=p1499)" & X"(p3575>=2)")))
Detected timeout of ITS tools.
[2022-05-15 22:22:40] [INFO ] Flatten gal took : 169 ms
[2022-05-15 22:22:40] [INFO ] Applying decomposition
[2022-05-15 22:22:40] [INFO ] Flatten gal took : 212 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10929111338545633957.txt' '-o' '/tmp/graph10929111338545633957.bin' '-w' '/tmp/graph10929111338545633957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10929111338545633957.bin' '-l' '-1' '-v' '-w' '/tmp/graph10929111338545633957.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:22:41] [INFO ] Decomposing Gal with order
[2022-05-15 22:22:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:22:42] [INFO ] Removed a total of 4391 redundant transitions.
[2022-05-15 22:22:42] [INFO ] Flatten gal took : 364 ms
[2022-05-15 22:22:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 213 ms.
[2022-05-15 22:22:43] [INFO ] Time to serialize gal into /tmp/LTL17468000768219306371.gal : 35 ms
[2022-05-15 22:22:43] [INFO ] Time to serialize properties into /tmp/LTL11017053651683025367.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17468000768219306371.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11017053651683025367.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1746800...268
Read 1 LTL properties
Checking formula 0 : !((G((!(("(gu1934.p8933<=gu1934.p2804)")U("(gi1.gi1.gi0.gi0.gi1.gi4.gu220.p1428>=3)")))||(F(X((G((X("(gi0.gu745.p3575>=2)"))&&("(gu237...212
Formula 0 simplified : !G(!("(gu1934.p8933<=gu1934.p2804)" U "(gi1.gi1.gi0.gi0.gi1.gi4.gu220.p1428>=3)") | FX("(gi0.gu745.p3575>=2)" | G("(gu237.p10025<=gu...195
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7394185236800029764
[2022-05-15 22:22:58] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7394185236800029764
Running compilation step : cd /tmp/ltsmin7394185236800029764;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7394185236800029764;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7394185236800029764;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-200-LTLCardinality-03 finished in 466556 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))||p1)))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3645 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:23:05] [INFO ] Invariants computation overflowed in 241 ms
[2022-05-15 22:23:06] [INFO ] Implicit Places using invariants in 1048 ms returned []
Implicit Place search using SMT only with invariants took 1051 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:23:06] [INFO ] Invariants computation overflowed in 335 ms
[2022-05-15 22:23:07] [INFO ] Dead Transitions using invariants and state equation in 1138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s7496 s5268), p0:(LEQ s4630 s10218)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3315 reset in 678 ms.
Product exploration explored 100000 steps with 3286 reset in 734 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 327 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 295 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 296 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 26378 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26378 steps, saw 13197 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:23:17] [INFO ] Invariants computation overflowed in 274 ms
[2022-05-15 22:23:18] [INFO ] After 1143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:23:44] [INFO ] After 23611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 22:23:44] [INFO ] After 23615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-15 22:23:44] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 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 2397 transitions
Trivial Post-agglo rules discarded 2397 transitions
Performed 2397 trivial Post agglomeration. Transition count delta: 2397
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2401 place count 10597 transition count 7599
Reduce places removed 2397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2398 rules applied. Total rules applied 4799 place count 8200 transition count 7598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4800 place count 8199 transition count 7598
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4800 place count 8199 transition count 7198
Deduced a syphon composed of 400 places in 724 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5600 place count 7799 transition count 7198
Performed 1803 Post agglomeration using F-continuation condition.Transition count delta: 1803
Deduced a syphon composed of 1803 places in 284 ms
Reduce places removed 1803 places and 0 transitions.
Iterating global reduction 3 with 3606 rules applied. Total rules applied 9206 place count 5996 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 260 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9408 place count 5895 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 211 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9610 place count 5794 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 202 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9812 place count 5693 transition count 5395
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 192 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 10002 place count 5598 transition count 5395
Free-agglomeration rule (complex) applied 798 times.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10800 place count 5598 transition count 4597
Reduce places removed 798 places and 0 transitions.
Iterating post reduction 3 with 798 rules applied. Total rules applied 11598 place count 4800 transition count 4597
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 801 times.
Drop transitions removed 801 transitions
Iterating global reduction 4 with 801 rules applied. Total rules applied 12399 place count 4800 transition count 4597
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12400 place count 4799 transition count 4596
Applied a total of 12400 rules in 8452 ms. Remains 4799 /10600 variables (removed 5801) and now considering 4596/9998 (removed 5402) transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/10600 places, 4596/9998 transitions.
Incomplete random walk after 10000 steps, including 1300 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 57491 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57491 steps, saw 28756 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:23:56] [INFO ] Invariants computation overflowed in 66 ms
[2022-05-15 22:23:56] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:24:21] [INFO ] After 24351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 22:24:22] [INFO ] State equation strengthened by 798 read => feed constraints.
[2022-05-15 22:24:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:24:22] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4799 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 1042 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/4799 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 1040 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:24:24] [INFO ] Invariants computation overflowed in 60 ms
[2022-05-15 22:24:54] [INFO ] Performed 1072/4799 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:25:24] [INFO ] Performed 2004/4799 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:25:55] [INFO ] Performed 3018/4799 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:26:25] [INFO ] Performed 4324/4799 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:26:25] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:26:25] [INFO ] Implicit Places using invariants in 121128 ms returned []
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:26:25] [INFO ] Invariants computation overflowed in 68 ms
[2022-05-15 22:26:26] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 122089 ms to find 0 implicit places.
[2022-05-15 22:26:26] [INFO ] Redundant transitions in 605 ms returned []
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:26:26] [INFO ] Invariants computation overflowed in 60 ms
[2022-05-15 22:26:31] [INFO ] Dead Transitions using invariants and state equation in 4634 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/4799 places, 4596/4596 transitions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 194 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3234 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:26:35] [INFO ] Invariants computation overflowed in 236 ms
[2022-05-15 22:26:36] [INFO ] Implicit Places using invariants in 1062 ms returned []
Implicit Place search using SMT only with invariants took 1069 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:26:37] [INFO ] Invariants computation overflowed in 234 ms
[2022-05-15 22:26:37] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 336 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 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 264 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 27233 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 27233 steps, saw 13622 distinct states, run finished after 3003 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:26:46] [INFO ] Invariants computation overflowed in 233 ms
[2022-05-15 22:26:47] [INFO ] After 1159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:27:12] [INFO ] After 23655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 22:27:12] [INFO ] After 23662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-15 22:27:12] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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 2397 transitions
Trivial Post-agglo rules discarded 2397 transitions
Performed 2397 trivial Post agglomeration. Transition count delta: 2397
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2401 place count 10597 transition count 7599
Reduce places removed 2397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2398 rules applied. Total rules applied 4799 place count 8200 transition count 7598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4800 place count 8199 transition count 7598
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4800 place count 8199 transition count 7198
Deduced a syphon composed of 400 places in 749 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5600 place count 7799 transition count 7198
Performed 1803 Post agglomeration using F-continuation condition.Transition count delta: 1803
Deduced a syphon composed of 1803 places in 325 ms
Reduce places removed 1803 places and 0 transitions.
Iterating global reduction 3 with 3606 rules applied. Total rules applied 9206 place count 5996 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 222 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9408 place count 5895 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 233 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9610 place count 5794 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 196 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9812 place count 5693 transition count 5395
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 198 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 10002 place count 5598 transition count 5395
Free-agglomeration rule (complex) applied 798 times.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10800 place count 5598 transition count 4597
Reduce places removed 798 places and 0 transitions.
Iterating post reduction 3 with 798 rules applied. Total rules applied 11598 place count 4800 transition count 4597
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 801 times.
Drop transitions removed 801 transitions
Iterating global reduction 4 with 801 rules applied. Total rules applied 12399 place count 4800 transition count 4597
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12400 place count 4799 transition count 4596
Applied a total of 12400 rules in 8527 ms. Remains 4799 /10600 variables (removed 5801) and now considering 4596/9998 (removed 5402) transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/10600 places, 4596/9998 transitions.
Incomplete random walk after 10000 steps, including 1310 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 54891 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54891 steps, saw 27460 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:27:24] [INFO ] Invariants computation overflowed in 54 ms
[2022-05-15 22:27:25] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:27:50] [INFO ] After 24401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 22:27:50] [INFO ] State equation strengthened by 798 read => feed constraints.
[2022-05-15 22:27:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:27:50] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4799 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 1088 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/4799 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 1199 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:27:52] [INFO ] Invariants computation overflowed in 62 ms
[2022-05-15 22:28:23] [INFO ] Performed 1067/4799 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:28:53] [INFO ] Performed 2003/4799 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:29:23] [INFO ] Performed 3018/4799 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:29:53] [INFO ] Performed 4325/4799 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:29:53] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:29:53] [INFO ] Implicit Places using invariants in 121009 ms returned []
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:29:53] [INFO ] Invariants computation overflowed in 56 ms
[2022-05-15 22:29:54] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 122010 ms to find 0 implicit places.
[2022-05-15 22:29:55] [INFO ] Redundant transitions in 605 ms returned []
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:29:55] [INFO ] Invariants computation overflowed in 68 ms
[2022-05-15 22:30:00] [INFO ] Dead Transitions using invariants and state equation in 4986 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/4799 places, 4596/4596 transitions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 178 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 3315 reset in 377 ms.
Product exploration explored 100000 steps with 3309 reset in 637 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Performed 2396 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2396 rules applied. Total rules applied 2396 place count 10600 transition count 9998
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 401 Pre rules applied. Total rules applied 2396 place count 10600 transition count 10398
Deduced a syphon composed of 2797 places in 889 ms
Iterating global reduction 1 with 401 rules applied. Total rules applied 2797 place count 10600 transition count 10398
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2799 place count 10598 transition count 10396
Deduced a syphon composed of 2795 places in 858 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 2801 place count 10598 transition count 10396
Performed 1800 Post agglomeration using F-continuation condition.Transition count delta: -400
Deduced a syphon composed of 4595 places in 564 ms
Iterating global reduction 1 with 1800 rules applied. Total rules applied 4601 place count 10598 transition count 10796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4602 place count 10597 transition count 10795
Deduced a syphon composed of 4594 places in 561 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4603 place count 10597 transition count 10795
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -656
Deduced a syphon composed of 4695 places in 547 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4704 place count 10597 transition count 11451
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 4805 place count 10496 transition count 11249
Deduced a syphon composed of 4594 places in 531 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4906 place count 10496 transition count 11249
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -645
Deduced a syphon composed of 4695 places in 544 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5007 place count 10496 transition count 11894
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5108 place count 10395 transition count 11692
Deduced a syphon composed of 4594 places in 544 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5209 place count 10395 transition count 11692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -663
Deduced a syphon composed of 4695 places in 538 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5310 place count 10395 transition count 12355
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5411 place count 10294 transition count 12153
Deduced a syphon composed of 4594 places in 514 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5512 place count 10294 transition count 12153
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -623
Deduced a syphon composed of 4691 places in 553 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 5609 place count 10294 transition count 12776
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 5706 place count 10197 transition count 12582
Deduced a syphon composed of 4594 places in 516 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 5803 place count 10197 transition count 12582
Deduced a syphon composed of 4594 places in 515 ms
Applied a total of 5803 rules in 20806 ms. Remains 10197 /10600 variables (removed 403) and now considering 12582/9998 (removed -2584) transitions.
// Phase 1: matrix 12582 rows 10197 cols
[2022-05-15 22:30:23] [INFO ] Invariants computation overflowed in 231 ms
[2022-05-15 22:30:24] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10197/10600 places, 12582/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 10197/10600 places, 12582/9998 transitions.
Product exploration explored 100000 steps with 3263 reset in 398 ms.
Product exploration explored 100000 steps with 3312 reset in 395 ms.
Built C files in :
/tmp/ltsmin2044195682070067043
[2022-05-15 22:30:25] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2044195682070067043
Running compilation step : cd /tmp/ltsmin2044195682070067043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2044195682070067043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2044195682070067043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3244 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:30:32] [INFO ] Invariants computation overflowed in 231 ms
[2022-05-15 22:30:32] [INFO ] Implicit Places using invariants in 1137 ms returned []
Implicit Place search using SMT only with invariants took 1138 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:30:33] [INFO ] Invariants computation overflowed in 241 ms
[2022-05-15 22:30:33] [INFO ] Dead Transitions using invariants and state equation in 1060 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Built C files in :
/tmp/ltsmin3833725255126105548
[2022-05-15 22:30:35] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3833725255126105548
Running compilation step : cd /tmp/ltsmin3833725255126105548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3833725255126105548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3833725255126105548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 22:30:42] [INFO ] Flatten gal took : 285 ms
[2022-05-15 22:30:42] [INFO ] Flatten gal took : 294 ms
[2022-05-15 22:30:42] [INFO ] Time to serialize gal into /tmp/LTL4049283920642790673.gal : 40 ms
[2022-05-15 22:30:42] [INFO ] Time to serialize properties into /tmp/LTL5132053266542269231.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4049283920642790673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5132053266542269231.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4049283...266
Read 1 LTL properties
Checking formula 0 : !((G((G(X("(p4625<=p9655)")))||("(p7204<=p52)"))))
Formula 0 simplified : !G("(p7204<=p52)" | GX"(p4625<=p9655)")
Detected timeout of ITS tools.
[2022-05-15 22:30:58] [INFO ] Flatten gal took : 282 ms
[2022-05-15 22:30:58] [INFO ] Applying decomposition
[2022-05-15 22:30:58] [INFO ] Flatten gal took : 301 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12503609945639588312.txt' '-o' '/tmp/graph12503609945639588312.bin' '-w' '/tmp/graph12503609945639588312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12503609945639588312.bin' '-l' '-1' '-v' '-w' '/tmp/graph12503609945639588312.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:30:59] [INFO ] Decomposing Gal with order
[2022-05-15 22:31:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:31:05] [INFO ] Removed a total of 2849 redundant transitions.
[2022-05-15 22:31:06] [INFO ] Flatten gal took : 512 ms
[2022-05-15 22:31:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 326 ms.
[2022-05-15 22:31:08] [INFO ] Time to serialize gal into /tmp/LTL14224672908692938828.gal : 93 ms
[2022-05-15 22:31:08] [INFO ] Time to serialize properties into /tmp/LTL10220347796467983240.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14224672908692938828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10220347796467983240.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1422467...268
Read 1 LTL properties
Checking formula 0 : !((G((G(X("(gu4359.p4625<=gu4359.p9655)")))||("(gu3196.p7204<=gu3196.p52)"))))
Formula 0 simplified : !G("(gu3196.p7204<=gu3196.p52)" | GX"(gu4359.p4625<=gu4359.p9655)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15386859011554055208
[2022-05-15 22:31:23] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15386859011554055208
Running compilation step : cd /tmp/ltsmin15386859011554055208;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin15386859011554055208;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin15386859011554055208;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-200-LTLCardinality-04 finished in 505498 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3434 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:31:30] [INFO ] Invariants computation overflowed in 354 ms
[2022-05-15 22:31:31] [INFO ] Implicit Places using invariants in 1085 ms returned []
Implicit Place search using SMT only with invariants took 1087 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:31:31] [INFO ] Invariants computation overflowed in 260 ms
[2022-05-15 22:31:32] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LEQ s2952 s3388) (LEQ s2449 s2265))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3889 ms.
Product exploration explored 100000 steps with 33333 reset in 3874 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 50 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-200-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-200-LTLCardinality-06 finished in 15189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(p0)))))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3358 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:31:45] [INFO ] Invariants computation overflowed in 259 ms
[2022-05-15 22:31:46] [INFO ] Implicit Places using invariants in 1053 ms returned []
Implicit Place search using SMT only with invariants took 1054 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:31:46] [INFO ] Invariants computation overflowed in 239 ms
[2022-05-15 22:31:47] [INFO ] Dead Transitions using invariants and state equation in 1194 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s6760 s3129)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3844 ms.
Product exploration explored 100000 steps with 33333 reset in 3844 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 50 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-200-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-200-LTLCardinality-09 finished in 15135 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G(X(G(X((p0 U p1)))))||p2)))))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2397 transitions
Trivial Post-agglo rules discarded 2397 transitions
Performed 2397 trivial Post agglomeration. Transition count delta: 2397
Iterating post reduction 0 with 2397 rules applied. Total rules applied 2397 place count 10599 transition count 7600
Reduce places removed 2397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2398 rules applied. Total rules applied 4795 place count 8202 transition count 7599
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4796 place count 8201 transition count 7599
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4796 place count 8201 transition count 7199
Deduced a syphon composed of 400 places in 790 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5596 place count 7801 transition count 7199
Performed 1801 Post agglomeration using F-continuation condition.Transition count delta: 1801
Deduced a syphon composed of 1801 places in 294 ms
Reduce places removed 1801 places and 0 transitions.
Iterating global reduction 3 with 3602 rules applied. Total rules applied 9198 place count 6000 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 308 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9400 place count 5899 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 213 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9602 place count 5798 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 215 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9804 place count 5697 transition count 5398
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 213 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 9992 place count 5603 transition count 5398
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 9994 place count 5603 transition count 5398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9995 place count 5602 transition count 5397
Applied a total of 9995 rules in 6562 ms. Remains 5602 /10600 variables (removed 4998) and now considering 5397/9998 (removed 4601) transitions.
// Phase 1: matrix 5397 rows 5602 cols
[2022-05-15 22:32:03] [INFO ] Invariants computation overflowed in 118 ms
[2022-05-15 22:32:07] [INFO ] Implicit Places using invariants in 4083 ms returned []
// Phase 1: matrix 5397 rows 5602 cols
[2022-05-15 22:32:08] [INFO ] Invariants computation overflowed in 102 ms
[2022-05-15 22:32:09] [INFO ] Implicit Places using invariants and state equation in 1132 ms returned []
Implicit Place search using SMT with State Equation took 5223 ms to find 0 implicit places.
[2022-05-15 22:32:09] [INFO ] Redundant transitions in 355 ms returned []
// Phase 1: matrix 5397 rows 5602 cols
[2022-05-15 22:32:09] [INFO ] Invariants computation overflowed in 112 ms
[2022-05-15 22:32:13] [INFO ] Dead Transitions using invariants and state equation in 3732 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5602/10600 places, 5397/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5602/10600 places, 5397/9998 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-200-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 1 s5173), p1:(GT 2 s914), p0:(LEQ s2306 s220)], 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 13855 reset in 306 ms.
Product exploration explored 100000 steps with 13847 reset in 406 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17775 edges and 5602 vertex of which 5600 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1404 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 795 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 809 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 805 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 44999 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 44999 steps, saw 22506 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5397 rows 5602 cols
[2022-05-15 22:32:18] [INFO ] Invariants computation overflowed in 119 ms
[2022-05-15 22:32:19] [INFO ] After 737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 22:32:44] [INFO ] After 24114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 22:32:44] [INFO ] State equation strengthened by 397 read => feed constraints.
[2022-05-15 22:32:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:32:44] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5602/5602 places, 5397/5397 transitions.
Graph (complete) has 16977 edges and 5602 vertex of which 5600 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 5600 transition count 5395
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 5600 transition count 5394
Deduced a syphon composed of 1 places in 188 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5599 transition count 5394
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 5599 transition count 5393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 5598 transition count 5393
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 2 with 797 rules applied. Total rules applied 804 place count 5598 transition count 4596
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 2 with 797 rules applied. Total rules applied 1601 place count 4801 transition count 4596
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 798 times.
Drop transitions removed 798 transitions
Iterating global reduction 3 with 798 rules applied. Total rules applied 2399 place count 4801 transition count 4596
Applied a total of 2399 rules in 3430 ms. Remains 4801 /5602 variables (removed 801) and now considering 4596/5397 (removed 801) transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/5602 places, 4596/5397 transitions.
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 820 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 52692 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52692 steps, saw 26357 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 4596 rows 4801 cols
[2022-05-15 22:32:52] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 22:32:52] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 22:33:17] [INFO ] After 24227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 22:33:17] [INFO ] State equation strengthened by 796 read => feed constraints.
[2022-05-15 22:33:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:33:17] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4801 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4801/4801 places, 4596/4596 transitions.
Applied a total of 0 rules in 1079 ms. Remains 4801 /4801 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/4801 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4801/4801 places, 4596/4596 transitions.
Applied a total of 0 rules in 1139 ms. Remains 4801 /4801 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4801 cols
[2022-05-15 22:33:20] [INFO ] Invariants computation overflowed in 84 ms
[2022-05-15 22:33:50] [INFO ] Performed 1158/4801 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:34:20] [INFO ] Performed 2131/4801 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:34:51] [INFO ] Performed 3209/4801 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:35:21] [INFO ] Performed 4670/4801 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:35:21] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:35:21] [INFO ] Implicit Places using invariants in 121085 ms returned []
// Phase 1: matrix 4596 rows 4801 cols
[2022-05-15 22:35:21] [INFO ] Invariants computation overflowed in 83 ms
[2022-05-15 22:35:22] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 122053 ms to find 0 implicit places.
[2022-05-15 22:35:22] [INFO ] Redundant transitions in 612 ms returned []
// Phase 1: matrix 4596 rows 4801 cols
[2022-05-15 22:35:22] [INFO ] Invariants computation overflowed in 86 ms
[2022-05-15 22:35:27] [INFO ] Dead Transitions using invariants and state equation in 4684 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/4801 places, 4596/4596 transitions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5602/5602 places, 5397/5397 transitions.
Applied a total of 0 rules in 495 ms. Remains 5602 /5602 variables (removed 0) and now considering 5397/5397 (removed 0) transitions.
// Phase 1: matrix 5397 rows 5602 cols
[2022-05-15 22:35:29] [INFO ] Invariants computation overflowed in 113 ms
[2022-05-15 22:35:33] [INFO ] Implicit Places using invariants in 3985 ms returned []
// Phase 1: matrix 5397 rows 5602 cols
[2022-05-15 22:35:33] [INFO ] Invariants computation overflowed in 110 ms
[2022-05-15 22:35:34] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 5108 ms to find 0 implicit places.
[2022-05-15 22:35:34] [INFO ] Redundant transitions in 347 ms returned []
// Phase 1: matrix 5397 rows 5602 cols
[2022-05-15 22:35:34] [INFO ] Invariants computation overflowed in 118 ms
[2022-05-15 22:35:38] [INFO ] Dead Transitions using invariants and state equation in 3742 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5602/5602 places, 5397/5397 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17775 edges and 5602 vertex of which 5600 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 243 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1373 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 802 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 822 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 45070 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 45070 steps, saw 22541 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5397 rows 5602 cols
[2022-05-15 22:35:42] [INFO ] Invariants computation overflowed in 113 ms
[2022-05-15 22:35:43] [INFO ] After 734ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 22:36:08] [INFO ] After 24167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 22:36:08] [INFO ] State equation strengthened by 397 read => feed constraints.
[2022-05-15 22:36:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:36:08] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5602/5602 places, 5397/5397 transitions.
Graph (complete) has 16977 edges and 5602 vertex of which 5600 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 5600 transition count 5395
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 5600 transition count 5394
Deduced a syphon composed of 1 places in 200 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5599 transition count 5394
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 5599 transition count 5393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 5598 transition count 5393
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 2 with 797 rules applied. Total rules applied 804 place count 5598 transition count 4596
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 2 with 797 rules applied. Total rules applied 1601 place count 4801 transition count 4596
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 798 times.
Drop transitions removed 798 transitions
Iterating global reduction 3 with 798 rules applied. Total rules applied 2399 place count 4801 transition count 4596
Applied a total of 2399 rules in 3534 ms. Remains 4801 /5602 variables (removed 801) and now considering 4596/5397 (removed 801) transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/5602 places, 4596/5397 transitions.
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 52423 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52423 steps, saw 26228 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 4596 rows 4801 cols
[2022-05-15 22:36:16] [INFO ] Invariants computation overflowed in 78 ms
[2022-05-15 22:36:17] [INFO ] After 639ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 22:36:42] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4801 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4801/4801 places, 4596/4596 transitions.
Applied a total of 0 rules in 1069 ms. Remains 4801 /4801 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/4801 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4801/4801 places, 4596/4596 transitions.
Applied a total of 0 rules in 1017 ms. Remains 4801 /4801 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4801 cols
[2022-05-15 22:36:44] [INFO ] Invariants computation overflowed in 83 ms
[2022-05-15 22:37:14] [INFO ] Performed 1158/4801 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:37:44] [INFO ] Performed 2137/4801 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:38:15] [INFO ] Performed 3230/4801 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:38:45] [INFO ] Performed 4745/4801 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:38:45] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:38:45] [INFO ] Implicit Places using invariants in 120990 ms returned []
// Phase 1: matrix 4596 rows 4801 cols
[2022-05-15 22:38:45] [INFO ] Invariants computation overflowed in 89 ms
[2022-05-15 22:38:46] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 122016 ms to find 0 implicit places.
[2022-05-15 22:38:46] [INFO ] Redundant transitions in 595 ms returned []
// Phase 1: matrix 4596 rows 4801 cols
[2022-05-15 22:38:46] [INFO ] Invariants computation overflowed in 84 ms
[2022-05-15 22:38:51] [INFO ] Dead Transitions using invariants and state equation in 4698 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4801/4801 places, 4596/4596 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 322 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 13860 reset in 343 ms.
Product exploration explored 100000 steps with 13922 reset in 349 ms.
Built C files in :
/tmp/ltsmin17711099907122653418
[2022-05-15 22:38:53] [INFO ] Too many transitions (5397) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:38:53] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17711099907122653418
Running compilation step : cd /tmp/ltsmin17711099907122653418;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin17711099907122653418;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin17711099907122653418;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5602/5602 places, 5397/5397 transitions.
Applied a total of 0 rules in 487 ms. Remains 5602 /5602 variables (removed 0) and now considering 5397/5397 (removed 0) transitions.
// Phase 1: matrix 5397 rows 5602 cols
[2022-05-15 22:38:57] [INFO ] Invariants computation overflowed in 110 ms
[2022-05-15 22:39:01] [INFO ] Implicit Places using invariants in 4026 ms returned []
// Phase 1: matrix 5397 rows 5602 cols
[2022-05-15 22:39:01] [INFO ] Invariants computation overflowed in 106 ms
[2022-05-15 22:39:02] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 5021 ms to find 0 implicit places.
[2022-05-15 22:39:02] [INFO ] Redundant transitions in 349 ms returned []
// Phase 1: matrix 5397 rows 5602 cols
[2022-05-15 22:39:02] [INFO ] Invariants computation overflowed in 107 ms
[2022-05-15 22:39:06] [INFO ] Dead Transitions using invariants and state equation in 3589 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5602/5602 places, 5397/5397 transitions.
Built C files in :
/tmp/ltsmin992235391402238757
[2022-05-15 22:39:06] [INFO ] Too many transitions (5397) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:39:06] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin992235391402238757
Running compilation step : cd /tmp/ltsmin992235391402238757;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin992235391402238757;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin992235391402238757;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 22:39:10] [INFO ] Flatten gal took : 181 ms
[2022-05-15 22:39:10] [INFO ] Flatten gal took : 199 ms
[2022-05-15 22:39:10] [INFO ] Time to serialize gal into /tmp/LTL8428932104689928745.gal : 26 ms
[2022-05-15 22:39:10] [INFO ] Time to serialize properties into /tmp/LTL195487860925967897.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8428932104689928745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL195487860925967897.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8428932...265
Read 1 LTL properties
Checking formula 0 : !((X(G(F((G(X(G(X(("(p4382<=p10372)")U("(p201<2)"))))))||("(p927>=1)"))))))
Formula 0 simplified : !XGF("(p927>=1)" | GXGX("(p4382<=p10372)" U "(p201<2)"))
Detected timeout of ITS tools.
[2022-05-15 22:39:25] [INFO ] Flatten gal took : 196 ms
[2022-05-15 22:39:25] [INFO ] Applying decomposition
[2022-05-15 22:39:25] [INFO ] Flatten gal took : 207 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15638286935731374877.txt' '-o' '/tmp/graph15638286935731374877.bin' '-w' '/tmp/graph15638286935731374877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15638286935731374877.bin' '-l' '-1' '-v' '-w' '/tmp/graph15638286935731374877.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:39:26] [INFO ] Decomposing Gal with order
[2022-05-15 22:39:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:39:27] [INFO ] Removed a total of 4413 redundant transitions.
[2022-05-15 22:39:27] [INFO ] Flatten gal took : 365 ms
[2022-05-15 22:39:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 211 ms.
[2022-05-15 22:39:28] [INFO ] Time to serialize gal into /tmp/LTL17852132478986733588.gal : 52 ms
[2022-05-15 22:39:28] [INFO ] Time to serialize properties into /tmp/LTL15494458040158952986.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17852132478986733588.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15494458040158952986.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1785213...268
Read 1 LTL properties
Checking formula 0 : !((X(G(F((G(X(G(X(("(gu82.p4382<=gu82.p10372)")U("(gi5.gu354.p201<2)"))))))||("(gi5.gu2022.p927>=1)"))))))
Formula 0 simplified : !XGF("(gi5.gu2022.p927>=1)" | GXGX("(gu82.p4382<=gu82.p10372)" U "(gi5.gu354.p201<2)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6290831844122383326
[2022-05-15 22:39:43] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6290831844122383326
Running compilation step : cd /tmp/ltsmin6290831844122383326;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6290831844122383326;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6290831844122383326;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-200-LTLCardinality-11 finished in 469477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(F((G(p1)||p2))))||!p0)))'
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3408 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:39:50] [INFO ] Invariants computation overflowed in 260 ms
[2022-05-15 22:39:51] [INFO ] Implicit Places using invariants in 1060 ms returned []
Implicit Place search using SMT only with invariants took 1078 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:39:51] [INFO ] Invariants computation overflowed in 245 ms
[2022-05-15 22:39:52] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-200-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=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:(LEQ s2062 s4430), p2:(LEQ s9697 s36), p1:(LEQ 1 s8654)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3819 ms.
Product exploration explored 100000 steps with 33333 reset in 3815 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p2 (NOT p1))
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-200-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-200-LTLCardinality-13 finished in 15171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((!F(p0) U p1))||X((X(F(p2))||X(p2)))))'
Support contains 6 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3324 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:40:05] [INFO ] Invariants computation overflowed in 243 ms
[2022-05-15 22:40:06] [INFO ] Implicit Places using invariants in 1175 ms returned []
Implicit Place search using SMT only with invariants took 1183 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:40:06] [INFO ] Invariants computation overflowed in 251 ms
[2022-05-15 22:40:07] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p2) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-200-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ s38 s5070), p2:(LEQ s4002 s1862), p1:(LEQ s8966 s8570)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5513 ms.
Product exploration explored 100000 steps with 50000 reset in 5476 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 7 factoid took 133 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-200-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-200-LTLCardinality-15 finished in 18628 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(X(F(p0)))))||G(X(X(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(G((F(p0)&&p1))))||p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p0 U p1)||F(X((G((X(p2)&&p3))||p2))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))||p1)))'
Found a SL insensitive property : DoubleExponent-PT-200-LTLCardinality-04
Stuttering acceptance computed with spot in 102 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2396 transitions
Trivial Post-agglo rules discarded 2396 transitions
Performed 2396 trivial Post agglomeration. Transition count delta: 2396
Iterating post reduction 0 with 2396 rules applied. Total rules applied 2396 place count 10599 transition count 7601
Reduce places removed 2396 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2397 rules applied. Total rules applied 4793 place count 8203 transition count 7600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4794 place count 8202 transition count 7600
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4794 place count 8202 transition count 7200
Deduced a syphon composed of 400 places in 784 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5594 place count 7802 transition count 7200
Performed 1801 Post agglomeration using F-continuation condition.Transition count delta: 1801
Deduced a syphon composed of 1801 places in 296 ms
Reduce places removed 1801 places and 0 transitions.
Iterating global reduction 3 with 3602 rules applied. Total rules applied 9196 place count 6001 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 273 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9398 place count 5900 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 264 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9600 place count 5799 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 204 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9802 place count 5698 transition count 5399
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 201 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9992 place count 5603 transition count 5399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9993 place count 5602 transition count 5398
Applied a total of 9993 rules in 6200 ms. Remains 5602 /10600 variables (removed 4998) and now considering 5398/9998 (removed 4600) transitions.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:40:27] [INFO ] Invariants computation overflowed in 117 ms
[2022-05-15 22:40:27] [INFO ] Implicit Places using invariants in 652 ms returned []
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:40:28] [INFO ] Invariants computation overflowed in 115 ms
[2022-05-15 22:40:28] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1663 ms to find 0 implicit places.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:40:29] [INFO ] Invariants computation overflowed in 113 ms
[2022-05-15 22:40:32] [INFO ] Dead Transitions using invariants and state equation in 3718 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 5602/10600 places, 5398/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5602/10600 places, 5398/9998 transitions.
Running random walk in product with property : DoubleExponent-PT-200-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s3961 s2785), p0:(LEQ s2446 s5406)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13037 reset in 315 ms.
Product exploration explored 100000 steps with 13085 reset in 392 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17773 edges and 5602 vertex of which 5600 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 1313 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 788 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 775 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 47478 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47478 steps, saw 23751 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:40:37] [INFO ] Invariants computation overflowed in 133 ms
[2022-05-15 22:40:38] [INFO ] After 615ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:41:03] [INFO ] After 24291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 22:41:03] [INFO ] State equation strengthened by 398 read => feed constraints.
[2022-05-15 22:41:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:41:03] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5602/5602 places, 5398/5398 transitions.
Graph (complete) has 16973 edges and 5602 vertex of which 5600 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 5600 transition count 5396
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 5600 transition count 5395
Deduced a syphon composed of 1 places in 194 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5599 transition count 5395
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 1 with 797 rules applied. Total rules applied 802 place count 5599 transition count 4598
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 1 with 797 rules applied. Total rules applied 1599 place count 4802 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 800 times.
Drop transitions removed 800 transitions
Iterating global reduction 2 with 800 rules applied. Total rules applied 2399 place count 4802 transition count 4598
Applied a total of 2399 rules in 3164 ms. Remains 4802 /5602 variables (removed 800) and now considering 4598/5398 (removed 800) transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/5602 places, 4598/5398 transitions.
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 55215 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55215 steps, saw 27619 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:41:10] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 22:41:11] [INFO ] After 531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:41:36] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4802 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1135 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/4802 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1118 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:41:38] [INFO ] Invariants computation overflowed in 73 ms
[2022-05-15 22:42:08] [INFO ] Performed 1075/4802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:42:39] [INFO ] Performed 2007/4802 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:43:09] [INFO ] Performed 3000/4802 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:43:39] [INFO ] Performed 4304/4802 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:43:39] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:43:39] [INFO ] Implicit Places using invariants in 121098 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:43:39] [INFO ] Invariants computation overflowed in 71 ms
[2022-05-15 22:43:40] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 122148 ms to find 0 implicit places.
[2022-05-15 22:43:41] [INFO ] Redundant transitions in 611 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:43:41] [INFO ] Invariants computation overflowed in 74 ms
[2022-05-15 22:43:45] [INFO ] Dead Transitions using invariants and state equation in 4730 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/4802 places, 4598/4598 transitions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 312 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 5398/5398 transitions.
Applied a total of 0 rules in 456 ms. Remains 5602 /5602 variables (removed 0) and now considering 5398/5398 (removed 0) transitions.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:43:47] [INFO ] Invariants computation overflowed in 123 ms
[2022-05-15 22:43:51] [INFO ] Implicit Places using invariants in 4190 ms returned []
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:43:51] [INFO ] Invariants computation overflowed in 129 ms
[2022-05-15 22:43:52] [INFO ] Implicit Places using invariants and state equation in 1155 ms returned []
Implicit Place search using SMT with State Equation took 5347 ms to find 0 implicit places.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:43:52] [INFO ] Invariants computation overflowed in 116 ms
[2022-05-15 22:43:56] [INFO ] Dead Transitions using invariants and state equation in 3756 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5602/5602 places, 5398/5398 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17773 edges and 5602 vertex of which 5600 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 1292 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 790 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 789 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 47393 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47393 steps, saw 23707 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:44:00] [INFO ] Invariants computation overflowed in 120 ms
[2022-05-15 22:44:01] [INFO ] After 600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:44:26] [INFO ] After 24306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 22:44:26] [INFO ] State equation strengthened by 398 read => feed constraints.
[2022-05-15 22:44:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:44:26] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5602/5602 places, 5398/5398 transitions.
Graph (complete) has 16973 edges and 5602 vertex of which 5600 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 5600 transition count 5396
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 5600 transition count 5395
Deduced a syphon composed of 1 places in 185 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5599 transition count 5395
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 1 with 797 rules applied. Total rules applied 802 place count 5599 transition count 4598
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 1 with 797 rules applied. Total rules applied 1599 place count 4802 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 800 times.
Drop transitions removed 800 transitions
Iterating global reduction 2 with 800 rules applied. Total rules applied 2399 place count 4802 transition count 4598
Applied a total of 2399 rules in 3207 ms. Remains 4802 /5602 variables (removed 800) and now considering 4598/5398 (removed 800) transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/5602 places, 4598/5398 transitions.
Incomplete random walk after 10000 steps, including 1301 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 54681 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54681 steps, saw 27362 distinct states, run finished after 3004 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:44:33] [INFO ] Invariants computation overflowed in 74 ms
[2022-05-15 22:44:34] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:44:59] [INFO ] After 24391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 22:44:59] [INFO ] State equation strengthened by 798 read => feed constraints.
[2022-05-15 22:44:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:44:59] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4802 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1135 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/4802 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1090 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:45:01] [INFO ] Invariants computation overflowed in 80 ms
[2022-05-15 22:45:32] [INFO ] Performed 1096/4802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:46:02] [INFO ] Performed 2029/4802 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:46:32] [INFO ] Performed 3027/4802 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:47:02] [INFO ] Performed 4321/4802 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:47:02] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:47:02] [INFO ] Implicit Places using invariants in 121315 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:47:03] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 22:47:03] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 122256 ms to find 0 implicit places.
[2022-05-15 22:47:04] [INFO ] Redundant transitions in 617 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:47:04] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 22:47:09] [INFO ] Dead Transitions using invariants and state equation in 4925 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/4802 places, 4598/4598 transitions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 256 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 12985 reset in 304 ms.
Product exploration explored 100000 steps with 13029 reset in 331 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5602/5602 places, 5398/5398 transitions.
Applied a total of 0 rules in 497 ms. Remains 5602 /5602 variables (removed 0) and now considering 5398/5398 (removed 0) transitions.
[2022-05-15 22:47:12] [INFO ] Redundant transitions in 347 ms returned []
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:47:12] [INFO ] Invariants computation overflowed in 127 ms
[2022-05-15 22:47:16] [INFO ] Dead Transitions using invariants and state equation in 3818 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5602/5602 places, 5398/5398 transitions.
Product exploration explored 100000 steps with 13049 reset in 297 ms.
Product exploration explored 100000 steps with 13025 reset in 323 ms.
Built C files in :
/tmp/ltsmin16111364246359239213
[2022-05-15 22:47:16] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16111364246359239213
Running compilation step : cd /tmp/ltsmin16111364246359239213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16111364246359239213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16111364246359239213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 5398/5398 transitions.
Applied a total of 0 rules in 477 ms. Remains 5602 /5602 variables (removed 0) and now considering 5398/5398 (removed 0) transitions.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:47:20] [INFO ] Invariants computation overflowed in 123 ms
[2022-05-15 22:47:24] [INFO ] Implicit Places using invariants in 4082 ms returned []
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:47:24] [INFO ] Invariants computation overflowed in 122 ms
[2022-05-15 22:47:25] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 5244 ms to find 0 implicit places.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:47:25] [INFO ] Invariants computation overflowed in 121 ms
[2022-05-15 22:47:29] [INFO ] Dead Transitions using invariants and state equation in 3613 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5602/5602 places, 5398/5398 transitions.
Built C files in :
/tmp/ltsmin1615948232381036286
[2022-05-15 22:47:29] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1615948232381036286
Running compilation step : cd /tmp/ltsmin1615948232381036286;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1615948232381036286;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1615948232381036286;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 22:47:33] [INFO ] Flatten gal took : 169 ms
[2022-05-15 22:47:33] [INFO ] Flatten gal took : 173 ms
[2022-05-15 22:47:33] [INFO ] Time to serialize gal into /tmp/LTL2909686051979586874.gal : 16 ms
[2022-05-15 22:47:33] [INFO ] Time to serialize properties into /tmp/LTL5799235659853440124.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2909686051979586874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5799235659853440124.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2909686...266
Read 1 LTL properties
Checking formula 0 : !((G((G(X("(p4625<=p9655)")))||("(p7204<=p52)"))))
Formula 0 simplified : !G("(p7204<=p52)" | GX"(p4625<=p9655)")
Detected timeout of ITS tools.
[2022-05-15 22:47:48] [INFO ] Flatten gal took : 173 ms
[2022-05-15 22:47:48] [INFO ] Applying decomposition
[2022-05-15 22:47:48] [INFO ] Flatten gal took : 181 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3641566828163853581.txt' '-o' '/tmp/graph3641566828163853581.bin' '-w' '/tmp/graph3641566828163853581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3641566828163853581.bin' '-l' '-1' '-v' '-w' '/tmp/graph3641566828163853581.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:47:49] [INFO ] Decomposing Gal with order
[2022-05-15 22:47:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:47:50] [INFO ] Removed a total of 4404 redundant transitions.
[2022-05-15 22:47:50] [INFO ] Flatten gal took : 323 ms
[2022-05-15 22:47:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 63 ms.
[2022-05-15 22:47:51] [INFO ] Time to serialize gal into /tmp/LTL724903172649580144.gal : 35 ms
[2022-05-15 22:47:51] [INFO ] Time to serialize properties into /tmp/LTL12533155556077315672.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL724903172649580144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12533155556077315672.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7249031...266
Read 1 LTL properties
Checking formula 0 : !((G((G(X("(gu2094.p4625<=gu2094.p9655)")))||("(gu1531.p7204<=gu1531.p52)"))))
Formula 0 simplified : !G("(gu1531.p7204<=gu1531.p52)" | GX"(gu2094.p4625<=gu2094.p9655)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13402220147927229367
[2022-05-15 22:48:06] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13402220147927229367
Running compilation step : cd /tmp/ltsmin13402220147927229367;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13402220147927229367;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13402220147927229367;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-200-LTLCardinality-04 finished in 468296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G(X(G(X((p0 U p1)))))||p2)))))'
[2022-05-15 22:48:09] [INFO ] Flatten gal took : 302 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12012305721663762285
[2022-05-15 22:48:09] [INFO ] Too many transitions (9998) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:48:09] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12012305721663762285
Running compilation step : cd /tmp/ltsmin12012305721663762285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 22:48:09] [INFO ] Applying decomposition
[2022-05-15 22:48:10] [INFO ] Flatten gal took : 297 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10672650459273886237.txt' '-o' '/tmp/graph10672650459273886237.bin' '-w' '/tmp/graph10672650459273886237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10672650459273886237.bin' '-l' '-1' '-v' '-w' '/tmp/graph10672650459273886237.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:48:10] [INFO ] Decomposing Gal with order
[2022-05-15 22:48:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:48:17] [INFO ] Removed a total of 2832 redundant transitions.
[2022-05-15 22:48:17] [INFO ] Flatten gal took : 465 ms
[2022-05-15 22:48:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 278 ms.
[2022-05-15 22:48:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality17630270506470536124.gal : 76 ms
[2022-05-15 22:48:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality8511643192500315197.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17630270506470536124.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8511643192500315197.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 6 LTL properties
Checking formula 0 : !(((X(X(F(X(F("((gi4.gu2377.p5456>=1)||(gi12.gu1050.p9622<=gi12.gu1050.p2666))"))))))||(G(X(X("(gu3041.p7727<=gu3041.p6851)"))))))
Formula 0 simplified : !(XXFXF"((gi4.gu2377.p5456>=1)||(gi12.gu1050.p9622<=gi12.gu1050.p2666))" | GXX"(gu3041.p7727<=gu3041.p6851)")
Compilation finished in 69957 ms.
Running link step : cd /tmp/ltsmin12012305721663762285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 160 ms.
Running LTSmin : cd /tmp/ltsmin12012305721663762285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(<>(X(<>((LTLAPp0==true))))))||[](X(X((LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 21949 ms.
FORMULA DoubleExponent-PT-200-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin12012305721663762285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](X((LTLAPp2==true)))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-200"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-200, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110000219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-200.tgz
mv DoubleExponent-PT-200 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;