Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.0K Feb 25 14:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 14:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 14:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 14:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 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 Echo-PT-d02r19-LTLCardinality-00
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-01
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-02
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-03
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-04
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-05
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-06
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-07
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-08
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-09
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-10
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-11
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-12
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-13
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-14
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679424811876

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r19
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-21 18:53:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 18:53:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 18:53:33] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2023-03-21 18:53:33] [INFO ] Transformed 3455 places.
[2023-03-21 18:53:33] [INFO ] Transformed 2730 transitions.
[2023-03-21 18:53:33] [INFO ] Found NUPN structural information;
[2023-03-21 18:53:33] [INFO ] Parsed PT model containing 3455 places and 2730 transitions and 15940 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Echo-PT-d02r19-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 3455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3455/3455 places, 2730/2730 transitions.
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 3097 transition count 2730
Applied a total of 358 rules in 411 ms. Remains 3097 /3455 variables (removed 358) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3097 cols
[2023-03-21 18:53:36] [INFO ] Invariants computation overflowed in 2214 ms
[2023-03-21 18:53:37] [INFO ] Implicit Places using invariants in 2763 ms returned []
// Phase 1: matrix 2730 rows 3097 cols
[2023-03-21 18:53:39] [INFO ] Invariants computation overflowed in 2044 ms
[2023-03-21 18:53:40] [INFO ] Implicit Places using invariants and state equation in 2833 ms returned []
Implicit Place search using SMT with State Equation took 5636 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3097 cols
[2023-03-21 18:53:42] [INFO ] Invariants computation overflowed in 2007 ms
[2023-03-21 18:53:43] [INFO ] Dead Transitions using invariants and state equation in 3618 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3097/3455 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9681 ms. Remains : 3097/3455 places, 2730/2730 transitions.
Support contains 24 out of 3097 places after structural reductions.
[2023-03-21 18:53:44] [INFO ] Flatten gal took : 284 ms
[2023-03-21 18:53:44] [INFO ] Flatten gal took : 166 ms
[2023-03-21 18:53:44] [INFO ] Input system was already deterministic with 2730 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2730 rows 3097 cols
[2023-03-21 18:53:47] [INFO ] Invariants computation overflowed in 2167 ms
[2023-03-21 18:54:12] [INFO ] After 24318ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 18:54:12] [INFO ] After 24328ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-21 18:54:12] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3097 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Graph (complete) has 9355 edges and 3097 vertex of which 3085 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.12 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3085 transition count 2725
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 3084 transition count 2724
Applied a total of 6 rules in 395 ms. Remains 3084 /3097 variables (removed 13) and now considering 2724/2730 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 3084/3097 places, 2724/2730 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 18:54:16] [INFO ] Invariants computation overflowed in 3331 ms
[2023-03-21 18:54:41] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 159 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 239962 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239962 steps, saw 82200 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 18:54:48] [INFO ] Invariants computation overflowed in 3375 ms
[2023-03-21 18:55:13] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 3084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 146 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 147 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 18:55:17] [INFO ] Invariants computation overflowed in 3276 ms
[2023-03-21 18:55:19] [INFO ] Implicit Places using invariants in 5315 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 18:55:22] [INFO ] Invariants computation overflowed in 3269 ms
[2023-03-21 18:55:23] [INFO ] Implicit Places using invariants and state equation in 4029 ms returned []
Implicit Place search using SMT with State Equation took 9347 ms to find 0 implicit places.
[2023-03-21 18:55:23] [INFO ] Redundant transitions in 152 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 18:55:26] [INFO ] Invariants computation overflowed in 3268 ms
[2023-03-21 18:55:28] [INFO ] Dead Transitions using invariants and state equation in 4732 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14393 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Computed a total of 3097 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3097 transition count 2730
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3094 transition count 2730
Applied a total of 3 rules in 132 ms. Remains 3094 /3097 variables (removed 3) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2023-03-21 18:55:32] [INFO ] Computed 1368 place invariants in 4513 ms
[2023-03-21 18:55:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 18:55:35] [INFO ] Implicit Places using invariants in 6729 ms returned []
[2023-03-21 18:55:35] [INFO ] Invariant cache hit.
[2023-03-21 18:55:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 18:55:37] [INFO ] Implicit Places using invariants and state equation in 2472 ms returned []
Implicit Place search using SMT with State Equation took 9210 ms to find 0 implicit places.
[2023-03-21 18:55:37] [INFO ] Invariant cache hit.
[2023-03-21 18:55:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 18:55:39] [INFO ] Dead Transitions using invariants and state equation in 1941 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3094/3097 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11286 ms. Remains : 3094/3097 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s128 0) (EQ s1667 1) (EQ s2416 0) (EQ s659 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 138 reset in 2137 ms.
Product exploration explored 100000 steps with 138 reset in 2246 ms.
Computed a total of 3094 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3094 transition count 2730
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 240920 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 240920 steps, saw 82396 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 18:55:49] [INFO ] Invariant cache hit.
[2023-03-21 18:55:53] [INFO ] [Real]Absence check using 0 positive and 1368 generalized place invariants in 3847 ms returned sat
[2023-03-21 18:55:54] [INFO ] After 4745ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:56:07] [INFO ] [Nat]Absence check using 0 positive and 1368 generalized place invariants in 12292 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 18:56:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 18:56:19] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 3094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Graph (complete) has 9333 edges and 3094 vertex of which 3085 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3085 transition count 2725
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 3084 transition count 2724
Applied a total of 6 rules in 274 ms. Remains 3084 /3094 variables (removed 10) and now considering 2724/2730 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 3084/3094 places, 2724/2730 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 254477 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254477 steps, saw 84426 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 18:56:25] [INFO ] Invariants computation overflowed in 3138 ms
[2023-03-21 18:56:50] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 129 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 130 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 18:56:54] [INFO ] Invariants computation overflowed in 3405 ms
[2023-03-21 18:56:56] [INFO ] Implicit Places using invariants in 5451 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 18:56:59] [INFO ] Invariants computation overflowed in 3169 ms
[2023-03-21 18:57:00] [INFO ] Implicit Places using invariants and state equation in 3839 ms returned []
Implicit Place search using SMT with State Equation took 9293 ms to find 0 implicit places.
[2023-03-21 18:57:00] [INFO ] Redundant transitions in 126 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 18:57:03] [INFO ] Invariants computation overflowed in 3171 ms
[2023-03-21 18:57:05] [INFO ] Dead Transitions using invariants and state equation in 4705 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14271 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 129 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 18:57:08] [INFO ] Invariants computation overflowed in 3340 ms
[2023-03-21 18:59:51] [INFO ] After 162338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 3094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Applied a total of 0 rules in 130 ms. Remains 3094 /3094 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
[2023-03-21 18:59:51] [INFO ] Invariant cache hit.
[2023-03-21 18:59:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 18:59:54] [INFO ] Implicit Places using invariants in 2676 ms returned []
[2023-03-21 18:59:54] [INFO ] Invariant cache hit.
[2023-03-21 18:59:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 18:59:56] [INFO ] Implicit Places using invariants and state equation in 2532 ms returned []
Implicit Place search using SMT with State Equation took 5215 ms to find 0 implicit places.
[2023-03-21 18:59:56] [INFO ] Invariant cache hit.
[2023-03-21 18:59:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 18:59:58] [INFO ] Dead Transitions using invariants and state equation in 1878 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7225 ms. Remains : 3094/3094 places, 2730/2730 transitions.
Computed a total of 3094 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3094 transition count 2730
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 212237 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212237 steps, saw 77318 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:00:03] [INFO ] Invariant cache hit.
[2023-03-21 19:00:07] [INFO ] [Real]Absence check using 0 positive and 1368 generalized place invariants in 3744 ms returned sat
[2023-03-21 19:00:08] [INFO ] After 4550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:00:20] [INFO ] [Nat]Absence check using 0 positive and 1368 generalized place invariants in 12222 ms returned sat
[2023-03-21 19:00:33] [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 3094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Graph (complete) has 9333 edges and 3094 vertex of which 3085 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3085 transition count 2725
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 3084 transition count 2724
Applied a total of 6 rules in 279 ms. Remains 3084 /3094 variables (removed 10) and now considering 2724/2730 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 3084/3094 places, 2724/2730 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 215502 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215502 steps, saw 77856 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:00:40] [INFO ] Invariants computation overflowed in 3145 ms
[2023-03-21 19:01:05] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 3084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 137 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 133 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:01:08] [INFO ] Invariants computation overflowed in 3097 ms
[2023-03-21 19:01:10] [INFO ] Implicit Places using invariants in 5091 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:01:13] [INFO ] Invariants computation overflowed in 3091 ms
[2023-03-21 19:01:14] [INFO ] Implicit Places using invariants and state equation in 3827 ms returned []
Implicit Place search using SMT with State Equation took 8921 ms to find 0 implicit places.
[2023-03-21 19:01:14] [INFO ] Redundant transitions in 63 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:01:17] [INFO ] Invariants computation overflowed in 3075 ms
[2023-03-21 19:01:19] [INFO ] Dead Transitions using invariants and state equation in 4588 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13716 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 120 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:01:22] [INFO ] Invariants computation overflowed in 3494 ms
[2023-03-21 19:04:00] [INFO ] After 157652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 138 reset in 1982 ms.
Product exploration explored 100000 steps with 138 reset in 2187 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 3094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Graph (complete) has 9333 edges and 3094 vertex of which 3089 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.23 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 265 ms. Remains 3089 /3094 variables (removed 5) and now considering 2729/2730 (removed 1) transitions.
[2023-03-21 19:04:05] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 2729 rows 3089 cols
[2023-03-21 19:04:12] [INFO ] Computed 1364 place invariants in 6484 ms
[2023-03-21 19:04:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:04:13] [INFO ] Dead Transitions using invariants and state equation in 8263 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3089/3094 places, 2729/2730 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8601 ms. Remains : 3089/3094 places, 2729/2730 transitions.
Built C files in :
/tmp/ltsmin44480351943514807
[2023-03-21 19:04:13] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin44480351943514807
Running compilation step : cd /tmp/ltsmin44480351943514807;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin44480351943514807;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin44480351943514807;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 3094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Applied a total of 0 rules in 121 ms. Remains 3094 /3094 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2023-03-21 19:04:21] [INFO ] Computed 1368 place invariants in 4070 ms
[2023-03-21 19:04:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:04:23] [INFO ] Implicit Places using invariants in 6192 ms returned []
[2023-03-21 19:04:23] [INFO ] Invariant cache hit.
[2023-03-21 19:04:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:04:25] [INFO ] Implicit Places using invariants and state equation in 2694 ms returned []
Implicit Place search using SMT with State Equation took 8901 ms to find 0 implicit places.
[2023-03-21 19:04:26] [INFO ] Invariant cache hit.
[2023-03-21 19:04:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:04:27] [INFO ] Dead Transitions using invariants and state equation in 1901 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10927 ms. Remains : 3094/3094 places, 2730/2730 transitions.
Built C files in :
/tmp/ltsmin2588256419645880061
[2023-03-21 19:04:27] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2588256419645880061
Running compilation step : cd /tmp/ltsmin2588256419645880061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2588256419645880061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2588256419645880061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-21 19:04:31] [INFO ] Flatten gal took : 127 ms
[2023-03-21 19:04:31] [INFO ] Flatten gal took : 127 ms
[2023-03-21 19:04:31] [INFO ] Time to serialize gal into /tmp/LTL11418285656460751637.gal : 27 ms
[2023-03-21 19:04:31] [INFO ] Time to serialize properties into /tmp/LTL18032457455071401230.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11418285656460751637.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5749261905933252077.hoa' '-atoms' '/tmp/LTL18032457455071401230.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18032457455071401230.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5749261905933252077.hoa
Detected timeout of ITS tools.
[2023-03-21 19:04:46] [INFO ] Flatten gal took : 119 ms
[2023-03-21 19:04:46] [INFO ] Flatten gal took : 115 ms
[2023-03-21 19:04:46] [INFO ] Time to serialize gal into /tmp/LTL16319675296417291726.gal : 20 ms
[2023-03-21 19:04:46] [INFO ] Time to serialize properties into /tmp/LTL16577098684354585196.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16319675296417291726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16577098684354585196.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G("(((p1128==0)||(p2667==1))||((p3417==0)||(p1659==1)))"))))
Formula 0 simplified : XF!"(((p1128==0)||(p2667==1))||((p3417==0)||(p1659==1)))"
Detected timeout of ITS tools.
[2023-03-21 19:05:02] [INFO ] Flatten gal took : 106 ms
[2023-03-21 19:05:02] [INFO ] Applying decomposition
[2023-03-21 19:05:02] [INFO ] Flatten gal took : 107 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9642760934461438674.txt' '-o' '/tmp/graph9642760934461438674.bin' '-w' '/tmp/graph9642760934461438674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9642760934461438674.bin' '-l' '-1' '-v' '-w' '/tmp/graph9642760934461438674.weights' '-q' '0' '-e' '0.001'
[2023-03-21 19:05:03] [INFO ] Decomposing Gal with order
[2023-03-21 19:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 19:05:03] [INFO ] Removed a total of 3377 redundant transitions.
[2023-03-21 19:05:03] [INFO ] Flatten gal took : 352 ms
[2023-03-21 19:05:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 235 labels/synchronizations in 83 ms.
[2023-03-21 19:05:03] [INFO ] Time to serialize gal into /tmp/LTL6014070399714470615.gal : 41 ms
[2023-03-21 19:05:03] [INFO ] Time to serialize properties into /tmp/LTL14448552477295893435.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6014070399714470615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14448552477295893435.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i2.u47.p1128==0)||(i10.u89.p2667==1))||((i5.u139.p3417==0)||(i12.i0.i1.u190.p1659==1)))"))))
Formula 0 simplified : XF!"(((i2.u47.p1128==0)||(i10.u89.p2667==1))||((i5.u139.p3417==0)||(i12.i0.i1.u190.p1659==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin137211622800403893
[2023-03-21 19:05:19] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin137211622800403893
Running compilation step : cd /tmp/ltsmin137211622800403893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin137211622800403893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin137211622800403893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Echo-PT-d02r19-LTLCardinality-02 finished in 593784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1 U p2))))))'
Support contains 5 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3095 transition count 2730
Applied a total of 2 rules in 132 ms. Remains 3095 /3097 variables (removed 2) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3095 cols
[2023-03-21 19:05:26] [INFO ] Computed 1369 place invariants in 4472 ms
[2023-03-21 19:05:28] [INFO ] Implicit Places using invariants in 6537 ms returned []
[2023-03-21 19:05:28] [INFO ] Invariant cache hit.
[2023-03-21 19:05:31] [INFO ] Implicit Places using invariants and state equation in 2296 ms returned []
Implicit Place search using SMT with State Equation took 8840 ms to find 0 implicit places.
[2023-03-21 19:05:31] [INFO ] Invariant cache hit.
[2023-03-21 19:05:32] [INFO ] Dead Transitions using invariants and state equation in 1740 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3095/3097 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10717 ms. Remains : 3095/3097 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s2722 0) (EQ s2455 1)), p2:(OR (EQ s2225 0) (EQ s710 1)), p1:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 194 reset in 2509 ms.
Product exploration explored 100000 steps with 198 reset in 2702 ms.
Computed a total of 3095 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3095 transition count 2730
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 359 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 4629 steps, including 6 resets, run visited all 3 properties in 119 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 432 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-21 19:05:40] [INFO ] Invariant cache hit.
[2023-03-21 19:05:46] [INFO ] [Real]Absence check using 4 positive place invariants in 212 ms returned sat
[2023-03-21 19:05:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:05:55] [INFO ] [Real]Absence check using 4 positive and 1365 generalized place invariants in 9286 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 3095 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3095/3095 places, 2730/2730 transitions.
Applied a total of 0 rules in 133 ms. Remains 3095 /3095 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
[2023-03-21 19:05:55] [INFO ] Invariant cache hit.
[2023-03-21 19:05:58] [INFO ] Implicit Places using invariants in 2142 ms returned []
[2023-03-21 19:05:58] [INFO ] Invariant cache hit.
[2023-03-21 19:06:00] [INFO ] Implicit Places using invariants and state equation in 2219 ms returned []
Implicit Place search using SMT with State Equation took 4379 ms to find 0 implicit places.
[2023-03-21 19:06:00] [INFO ] Invariant cache hit.
[2023-03-21 19:06:02] [INFO ] Dead Transitions using invariants and state equation in 1705 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6219 ms. Remains : 3095/3095 places, 2730/2730 transitions.
Computed a total of 3095 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3095 transition count 2730
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 427 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:06:04] [INFO ] Invariant cache hit.
[2023-03-21 19:06:04] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:06:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 49 ms returned sat
[2023-03-21 19:06:10] [INFO ] [Nat]Absence check using 4 positive and 1365 generalized place invariants in 5222 ms returned sat
[2023-03-21 19:06:19] [INFO ] After 14747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3095 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3095/3095 places, 2730/2730 transitions.
Graph (complete) has 9341 edges and 3095 vertex of which 3086 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3086 transition count 2725
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 3085 transition count 2724
Applied a total of 6 rules in 290 ms. Remains 3085 /3095 variables (removed 10) and now considering 2724/2730 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 3085/3095 places, 2724/2730 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222793 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222793 steps, saw 79301 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:06:24] [INFO ] Invariants computation overflowed in 1884 ms
[2023-03-21 19:06:25] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:06:50] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 3085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 141 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 3085/3085 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 144 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:06:52] [INFO ] Invariants computation overflowed in 1953 ms
[2023-03-21 19:06:54] [INFO ] Implicit Places using invariants in 3878 ms returned []
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:06:56] [INFO ] Invariants computation overflowed in 1866 ms
[2023-03-21 19:06:57] [INFO ] Implicit Places using invariants and state equation in 2607 ms returned []
Implicit Place search using SMT with State Equation took 6488 ms to find 0 implicit places.
[2023-03-21 19:06:57] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:06:59] [INFO ] Invariants computation overflowed in 2033 ms
[2023-03-21 19:07:00] [INFO ] Dead Transitions using invariants and state equation in 3598 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10311 ms. Remains : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 142 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:07:02] [INFO ] Invariants computation overflowed in 1972 ms
[2023-03-21 19:07:03] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:10:48] [INFO ] After 225028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 463 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-21 19:10:49] [INFO ] Invariant cache hit.
[2023-03-21 19:10:54] [INFO ] [Real]Absence check using 4 positive place invariants in 62 ms returned sat
[2023-03-21 19:11:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:11:04] [INFO ] [Real]Absence check using 4 positive and 1365 generalized place invariants in 9564 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 189 reset in 2325 ms.
Product exploration explored 100000 steps with 200 reset in 2544 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 3095 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3095/3095 places, 2730/2730 transitions.
Graph (complete) has 9341 edges and 3095 vertex of which 3090 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 167 ms. Remains 3090 /3095 variables (removed 5) and now considering 2729/2730 (removed 1) transitions.
[2023-03-21 19:11:09] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 2729 rows 3090 cols
[2023-03-21 19:11:11] [INFO ] Invariants computation overflowed in 2073 ms
[2023-03-21 19:11:13] [INFO ] Dead Transitions using invariants and state equation in 3553 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3090/3095 places, 2729/2730 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3802 ms. Remains : 3090/3095 places, 2729/2730 transitions.
Built C files in :
/tmp/ltsmin10656516640724886794
[2023-03-21 19:11:13] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10656516640724886794
Running compilation step : cd /tmp/ltsmin10656516640724886794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10656516640724886794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10656516640724886794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 3095 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3095/3095 places, 2730/2730 transitions.
Applied a total of 0 rules in 134 ms. Remains 3095 /3095 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
[2023-03-21 19:11:16] [INFO ] Invariant cache hit.
[2023-03-21 19:11:18] [INFO ] Implicit Places using invariants in 2190 ms returned []
[2023-03-21 19:11:18] [INFO ] Invariant cache hit.
[2023-03-21 19:11:20] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 4297 ms to find 0 implicit places.
[2023-03-21 19:11:20] [INFO ] Invariant cache hit.
[2023-03-21 19:11:22] [INFO ] Dead Transitions using invariants and state equation in 1636 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6067 ms. Remains : 3095/3095 places, 2730/2730 transitions.
Built C files in :
/tmp/ltsmin7910787817099635995
[2023-03-21 19:11:22] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7910787817099635995
Running compilation step : cd /tmp/ltsmin7910787817099635995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7910787817099635995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7910787817099635995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-21 19:11:25] [INFO ] Flatten gal took : 121 ms
[2023-03-21 19:11:25] [INFO ] Flatten gal took : 127 ms
[2023-03-21 19:11:25] [INFO ] Time to serialize gal into /tmp/LTL16423119289101461159.gal : 20 ms
[2023-03-21 19:11:25] [INFO ] Time to serialize properties into /tmp/LTL13610813484797774877.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16423119289101461159.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5734159582707271096.hoa' '-atoms' '/tmp/LTL13610813484797774877.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13610813484797774877.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5734159582707271096.hoa
Detected timeout of ITS tools.
[2023-03-21 19:11:41] [INFO ] Flatten gal took : 137 ms
[2023-03-21 19:11:41] [INFO ] Flatten gal took : 115 ms
[2023-03-21 19:11:41] [INFO ] Time to serialize gal into /tmp/LTL2977760686572174974.gal : 16 ms
[2023-03-21 19:11:41] [INFO ] Time to serialize properties into /tmp/LTL13951290275028509433.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2977760686572174974.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13951290275028509433.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G(("(p1050==1)")U("((p3226==0)||(p1710==1))")))||("((p627==0)&&(p346==1))")))))
Formula 0 simplified : XG(!"((p627==0)&&(p346==1))" & F(!"(p1050==1)" R !"((p3226==0)||(p1710==1))"))
Detected timeout of ITS tools.
[2023-03-21 19:11:56] [INFO ] Flatten gal took : 102 ms
[2023-03-21 19:11:56] [INFO ] Applying decomposition
[2023-03-21 19:11:56] [INFO ] Flatten gal took : 101 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9285197118583162526.txt' '-o' '/tmp/graph9285197118583162526.bin' '-w' '/tmp/graph9285197118583162526.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9285197118583162526.bin' '-l' '-1' '-v' '-w' '/tmp/graph9285197118583162526.weights' '-q' '0' '-e' '0.001'
[2023-03-21 19:11:56] [INFO ] Decomposing Gal with order
[2023-03-21 19:11:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 19:11:57] [INFO ] Removed a total of 3236 redundant transitions.
[2023-03-21 19:11:57] [INFO ] Flatten gal took : 200 ms
[2023-03-21 19:11:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 60 ms.
[2023-03-21 19:11:57] [INFO ] Time to serialize gal into /tmp/LTL6228785244947286570.gal : 27 ms
[2023-03-21 19:11:57] [INFO ] Time to serialize properties into /tmp/LTL11147240213622047278.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6228785244947286570.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11147240213622047278.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G(("(i5.i0.u13.p1050==1)")U("((i6.i2.u240.p3226==0)||(i8.u131.p1710==1))")))||("((i12.i2.u362.p627==0)&&(i10.i1.u172.p346==1))...161
Formula 0 simplified : XG(!"((i12.i2.u362.p627==0)&&(i10.i1.u172.p346==1))" & F(!"(i5.i0.u13.p1050==1)" R !"((i6.i2.u240.p3226==0)||(i8.u131.p1710==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9513930501101191133
[2023-03-21 19:12:12] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9513930501101191133
Running compilation step : cd /tmp/ltsmin9513930501101191133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9513930501101191133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9513930501101191133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Echo-PT-d02r19-LTLCardinality-04 finished in 413473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (!p1&&X(X(F(!p2)))))))'
Support contains 5 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3094 transition count 2730
Applied a total of 3 rules in 126 ms. Remains 3094 /3097 variables (removed 3) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2023-03-21 19:12:20] [INFO ] Computed 1368 place invariants in 4762 ms
[2023-03-21 19:12:20] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:12:22] [INFO ] Implicit Places using invariants in 6952 ms returned []
[2023-03-21 19:12:22] [INFO ] Invariant cache hit.
[2023-03-21 19:12:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:12:25] [INFO ] Implicit Places using invariants and state equation in 2486 ms returned []
Implicit Place search using SMT with State Equation took 9455 ms to find 0 implicit places.
[2023-03-21 19:12:25] [INFO ] Invariant cache hit.
[2023-03-21 19:12:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:12:27] [INFO ] Dead Transitions using invariants and state equation in 1996 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3094/3097 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11580 ms. Remains : 3094/3097 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR p1 p2), (OR p1 p2), true, p2, p2]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(OR (EQ s1670 0) (EQ s753 1)), p0:(OR (EQ s2994 0) (EQ s1234 1)), p2:(OR (EQ s1913 0) (EQ s1234 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d02r19-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r19-LTLCardinality-05 finished in 11784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3097 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Graph (complete) has 9355 edges and 3097 vertex of which 3090 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 158 ms. Remains 3089 /3097 variables (removed 8) and now considering 2728/2730 (removed 2) transitions.
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:12:33] [INFO ] Invariants computation overflowed in 6015 ms
[2023-03-21 19:12:35] [INFO ] Implicit Places using invariants in 8135 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:12:41] [INFO ] Invariants computation overflowed in 5903 ms
[2023-03-21 19:12:42] [INFO ] Implicit Places using invariants and state equation in 6647 ms returned []
Implicit Place search using SMT with State Equation took 14785 ms to find 0 implicit places.
[2023-03-21 19:12:42] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:12:48] [INFO ] Invariants computation overflowed in 5820 ms
[2023-03-21 19:12:49] [INFO ] Dead Transitions using invariants and state equation in 7318 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3089/3097 places, 2728/2730 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22339 ms. Remains : 3089/3097 places, 2728/2730 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1808 0) (EQ s2453 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 184 reset in 2229 ms.
Product exploration explored 100000 steps with 182 reset in 2503 ms.
Computed a total of 3089 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3089 transition count 2728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 595 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=31 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:13:02] [INFO ] Invariants computation overflowed in 6022 ms
[2023-03-21 19:13:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:13:17] [INFO ] [Real]Absence check using state equation in 9751 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3089 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Applied a total of 0 rules in 154 ms. Remains 3089 /3089 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:13:23] [INFO ] Invariants computation overflowed in 5874 ms
[2023-03-21 19:13:25] [INFO ] Implicit Places using invariants in 7869 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:13:31] [INFO ] Invariants computation overflowed in 5750 ms
[2023-03-21 19:13:32] [INFO ] Implicit Places using invariants and state equation in 6473 ms returned []
Implicit Place search using SMT with State Equation took 14344 ms to find 0 implicit places.
[2023-03-21 19:13:32] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:13:37] [INFO ] Invariants computation overflowed in 5769 ms
[2023-03-21 19:13:39] [INFO ] Dead Transitions using invariants and state equation in 7327 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21909 ms. Remains : 3089/3089 places, 2728/2728 transitions.
Computed a total of 3089 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3089 transition count 2728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 461 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=28 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 434 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:13:47] [INFO ] Invariants computation overflowed in 5804 ms
[2023-03-21 19:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:14:02] [INFO ] [Real]Absence check using state equation in 9580 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 175 reset in 2470 ms.
Product exploration explored 100000 steps with 179 reset in 2763 ms.
Built C files in :
/tmp/ltsmin5941064417136821898
[2023-03-21 19:14:07] [INFO ] Too many transitions (2728) to apply POR reductions. Disabling POR matrices.
[2023-03-21 19:14:07] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5941064417136821898
Running compilation step : cd /tmp/ltsmin5941064417136821898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5941064417136821898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5941064417136821898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 3089 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Applied a total of 0 rules in 154 ms. Remains 3089 /3089 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:14:17] [INFO ] Invariants computation overflowed in 6575 ms
[2023-03-21 19:14:19] [INFO ] Implicit Places using invariants in 8640 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:14:25] [INFO ] Invariants computation overflowed in 5770 ms
[2023-03-21 19:14:26] [INFO ] Implicit Places using invariants and state equation in 6518 ms returned []
Implicit Place search using SMT with State Equation took 15161 ms to find 0 implicit places.
[2023-03-21 19:14:26] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:14:32] [INFO ] Invariants computation overflowed in 5750 ms
[2023-03-21 19:14:33] [INFO ] Dead Transitions using invariants and state equation in 7263 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22661 ms. Remains : 3089/3089 places, 2728/2728 transitions.
Built C files in :
/tmp/ltsmin8427750394662018518
[2023-03-21 19:14:33] [INFO ] Too many transitions (2728) to apply POR reductions. Disabling POR matrices.
[2023-03-21 19:14:33] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8427750394662018518
Running compilation step : cd /tmp/ltsmin8427750394662018518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8427750394662018518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8427750394662018518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-21 19:14:36] [INFO ] Flatten gal took : 106 ms
[2023-03-21 19:14:36] [INFO ] Flatten gal took : 107 ms
[2023-03-21 19:14:36] [INFO ] Time to serialize gal into /tmp/LTL3419467866744688503.gal : 24 ms
[2023-03-21 19:14:36] [INFO ] Time to serialize properties into /tmp/LTL15282809617275344211.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3419467866744688503.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5436404064757246359.hoa' '-atoms' '/tmp/LTL15282809617275344211.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15282809617275344211.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5436404064757246359.hoa
Detected timeout of ITS tools.
[2023-03-21 19:14:52] [INFO ] Flatten gal took : 118 ms
[2023-03-21 19:14:52] [INFO ] Flatten gal took : 109 ms
[2023-03-21 19:14:52] [INFO ] Time to serialize gal into /tmp/LTL9014440758084932350.gal : 18 ms
[2023-03-21 19:14:52] [INFO ] Time to serialize properties into /tmp/LTL3764202766977585284.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9014440758084932350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3764202766977585284.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p2809==0)&&(p355==1))"))))
Formula 0 simplified : FG!"((p2809==0)&&(p355==1))"
Detected timeout of ITS tools.
[2023-03-21 19:15:07] [INFO ] Flatten gal took : 115 ms
[2023-03-21 19:15:07] [INFO ] Applying decomposition
[2023-03-21 19:15:07] [INFO ] Flatten gal took : 119 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4071812827452019493.txt' '-o' '/tmp/graph4071812827452019493.bin' '-w' '/tmp/graph4071812827452019493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4071812827452019493.bin' '-l' '-1' '-v' '-w' '/tmp/graph4071812827452019493.weights' '-q' '0' '-e' '0.001'
[2023-03-21 19:15:07] [INFO ] Decomposing Gal with order
[2023-03-21 19:15:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 19:15:08] [INFO ] Removed a total of 3483 redundant transitions.
[2023-03-21 19:15:08] [INFO ] Flatten gal took : 206 ms
[2023-03-21 19:15:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 79 ms.
[2023-03-21 19:15:08] [INFO ] Time to serialize gal into /tmp/LTL13054888034217762648.gal : 40 ms
[2023-03-21 19:15:08] [INFO ] Time to serialize properties into /tmp/LTL16370389116314345745.ltl : 29 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13054888034217762648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16370389116314345745.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.i0.u165.p2809==0)&&(i7.i2.u341.p355==1))"))))
Formula 0 simplified : FG!"((i4.i0.u165.p2809==0)&&(i7.i2.u341.p355==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11897682073489819774
[2023-03-21 19:15:23] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11897682073489819774
Running compilation step : cd /tmp/ltsmin11897682073489819774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11897682073489819774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11897682073489819774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Echo-PT-d02r19-LTLCardinality-06 finished in 179351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3094 transition count 2730
Applied a total of 3 rules in 135 ms. Remains 3094 /3097 variables (removed 3) and now considering 2730/2730 (removed 0) transitions.
[2023-03-21 19:15:26] [INFO ] Invariant cache hit.
[2023-03-21 19:15:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:15:29] [INFO ] Implicit Places using invariants in 2664 ms returned []
[2023-03-21 19:15:29] [INFO ] Invariant cache hit.
[2023-03-21 19:15:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:15:32] [INFO ] Implicit Places using invariants and state equation in 2659 ms returned []
Implicit Place search using SMT with State Equation took 5327 ms to find 0 implicit places.
[2023-03-21 19:15:32] [INFO ] Invariant cache hit.
[2023-03-21 19:15:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:15:34] [INFO ] Dead Transitions using invariants and state equation in 1925 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3094/3097 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7390 ms. Remains : 3094/3097 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s2934 0) (EQ s2717 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 283 steps with 0 reset in 10 ms.
FORMULA Echo-PT-d02r19-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r19-LTLCardinality-07 finished in 7564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p1))))))'
Support contains 4 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3095 transition count 2730
Applied a total of 2 rules in 129 ms. Remains 3095 /3097 variables (removed 2) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3095 cols
[2023-03-21 19:15:36] [INFO ] Invariants computation overflowed in 2475 ms
[2023-03-21 19:15:38] [INFO ] Implicit Places using invariants in 4507 ms returned []
// Phase 1: matrix 2730 rows 3095 cols
[2023-03-21 19:15:41] [INFO ] Invariants computation overflowed in 2626 ms
[2023-03-21 19:15:42] [INFO ] Implicit Places using invariants and state equation in 3286 ms returned []
Implicit Place search using SMT with State Equation took 7798 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3095 cols
[2023-03-21 19:15:44] [INFO ] Invariants computation overflowed in 2444 ms
[2023-03-21 19:15:46] [INFO ] Dead Transitions using invariants and state equation in 3901 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3095/3097 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11838 ms. Remains : 3095/3097 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (EQ s2188 0) (EQ s750 1)) (OR (EQ s817 0) (EQ s1729 1))), p1:(OR (EQ s817 0) (EQ s1729 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 138 reset in 2002 ms.
Product exploration explored 100000 steps with 138 reset in 2257 ms.
Computed a total of 3095 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3095 transition count 2730
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1)]
Finished random walk after 873 steps, including 1 resets, run visited all 1 properties in 18 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Support contains 2 out of 3095 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 : 3095/3095 places, 2730/2730 transitions.
Graph (complete) has 9339 edges and 3095 vertex of which 3090 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 149 ms. Remains 3089 /3095 variables (removed 6) and now considering 2728/2730 (removed 2) transitions.
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:15:55] [INFO ] Invariants computation overflowed in 2782 ms
[2023-03-21 19:15:57] [INFO ] Implicit Places using invariants in 4931 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:16:00] [INFO ] Invariants computation overflowed in 2758 ms
[2023-03-21 19:16:00] [INFO ] Implicit Places using invariants and state equation in 3503 ms returned []
Implicit Place search using SMT with State Equation took 8449 ms to find 0 implicit places.
[2023-03-21 19:16:00] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:16:03] [INFO ] Invariants computation overflowed in 2757 ms
[2023-03-21 19:16:05] [INFO ] Dead Transitions using invariants and state equation in 4233 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3089/3095 places, 2728/2730 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12906 ms. Remains : 3089/3095 places, 2728/2730 transitions.
Computed a total of 3089 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3089 transition count 2728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Finished random walk after 88 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=22 )
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 138 reset in 1977 ms.
Product exploration explored 100000 steps with 138 reset in 2233 ms.
Built C files in :
/tmp/ltsmin6723583100190787689
[2023-03-21 19:16:11] [INFO ] Too many transitions (2728) to apply POR reductions. Disabling POR matrices.
[2023-03-21 19:16:11] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6723583100190787689
Running compilation step : cd /tmp/ltsmin6723583100190787689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6723583100190787689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6723583100190787689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 3089 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Graph (complete) has 9314 edges and 3089 vertex of which 3088 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 148 ms. Remains 3088 /3089 variables (removed 1) and now considering 2728/2728 (removed 0) transitions.
// Phase 1: matrix 2728 rows 3088 cols
[2023-03-21 19:16:19] [INFO ] Computed 1364 place invariants in 4775 ms
[2023-03-21 19:16:19] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:16:21] [INFO ] Implicit Places using invariants in 6879 ms returned []
[2023-03-21 19:16:21] [INFO ] Invariant cache hit.
[2023-03-21 19:16:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:16:21] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 7529 ms to find 0 implicit places.
[2023-03-21 19:16:22] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-21 19:16:22] [INFO ] Invariant cache hit.
[2023-03-21 19:16:22] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:16:23] [INFO ] Dead Transitions using invariants and state equation in 1844 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3088/3089 places, 2728/2728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9598 ms. Remains : 3088/3089 places, 2728/2728 transitions.
Built C files in :
/tmp/ltsmin11770482216675662545
[2023-03-21 19:16:23] [INFO ] Too many transitions (2728) to apply POR reductions. Disabling POR matrices.
[2023-03-21 19:16:23] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11770482216675662545
Running compilation step : cd /tmp/ltsmin11770482216675662545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11770482216675662545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11770482216675662545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-21 19:16:27] [INFO ] Flatten gal took : 104 ms
[2023-03-21 19:16:27] [INFO ] Flatten gal took : 103 ms
[2023-03-21 19:16:27] [INFO ] Time to serialize gal into /tmp/LTL12732961155167604888.gal : 17 ms
[2023-03-21 19:16:27] [INFO ] Time to serialize properties into /tmp/LTL7938033182657058446.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12732961155167604888.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13040826072365877287.hoa' '-atoms' '/tmp/LTL7938033182657058446.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7938033182657058446.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13040826072365877287.hoa
Detected timeout of ITS tools.
[2023-03-21 19:16:42] [INFO ] Flatten gal took : 105 ms
[2023-03-21 19:16:42] [INFO ] Flatten gal took : 106 ms
[2023-03-21 19:16:42] [INFO ] Time to serialize gal into /tmp/LTL8269052366849825026.gal : 14 ms
[2023-03-21 19:16:42] [INFO ] Time to serialize properties into /tmp/LTL10002678613083643980.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8269052366849825026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10002678613083643980.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((p1816==0)||(p2728==1))")))||("(((p3188==0)||(p175==1))&&((p1816==0)||(p2728==1)))")))))
Formula 0 simplified : XX(!"(((p3188==0)||(p175==1))&&((p1816==0)||(p2728==1)))" & GF!"((p1816==0)||(p2728==1))")
Detected timeout of ITS tools.
[2023-03-21 19:16:57] [INFO ] Flatten gal took : 103 ms
[2023-03-21 19:16:57] [INFO ] Applying decomposition
[2023-03-21 19:16:58] [INFO ] Flatten gal took : 105 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17733200476176936627.txt' '-o' '/tmp/graph17733200476176936627.bin' '-w' '/tmp/graph17733200476176936627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17733200476176936627.bin' '-l' '-1' '-v' '-w' '/tmp/graph17733200476176936627.weights' '-q' '0' '-e' '0.001'
[2023-03-21 19:16:58] [INFO ] Decomposing Gal with order
[2023-03-21 19:16:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 19:16:58] [INFO ] Removed a total of 3325 redundant transitions.
[2023-03-21 19:16:58] [INFO ] Flatten gal took : 169 ms
[2023-03-21 19:16:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 214 labels/synchronizations in 37 ms.
[2023-03-21 19:16:58] [INFO ] Time to serialize gal into /tmp/LTL11463925996755708202.gal : 28 ms
[2023-03-21 19:16:58] [INFO ] Time to serialize properties into /tmp/LTL15951390692677045381.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11463925996755708202.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15951390692677045381.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((i8.u204.p1816==0)||(i3.u271.p2728==1))")))||("(((i0.u389.p3188==0)||(i12.u12.p175==1))&&((i8.u204.p1816==0)||(i3.u271.p...171
Formula 0 simplified : XX(!"(((i0.u389.p3188==0)||(i12.u12.p175==1))&&((i8.u204.p1816==0)||(i3.u271.p2728==1)))" & GF!"((i8.u204.p1816==0)||(i3.u271.p2728=...161
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7916915430223387019
[2023-03-21 19:17:13] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7916915430223387019
Running compilation step : cd /tmp/ltsmin7916915430223387019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7916915430223387019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7916915430223387019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Echo-PT-d02r19-LTLCardinality-14 finished in 102692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 2 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3094 transition count 2730
Applied a total of 3 rules in 135 ms. Remains 3094 /3097 variables (removed 3) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2023-03-21 19:17:21] [INFO ] Computed 1368 place invariants in 4148 ms
[2023-03-21 19:17:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:17:23] [INFO ] Implicit Places using invariants in 6403 ms returned []
[2023-03-21 19:17:23] [INFO ] Invariant cache hit.
[2023-03-21 19:17:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:17:26] [INFO ] Implicit Places using invariants and state equation in 2625 ms returned []
Implicit Place search using SMT with State Equation took 9030 ms to find 0 implicit places.
[2023-03-21 19:17:26] [INFO ] Invariant cache hit.
[2023-03-21 19:17:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:17:27] [INFO ] Dead Transitions using invariants and state equation in 1899 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3094/3097 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11071 ms. Remains : 3094/3097 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1397 0) (EQ s331 1)), p0:(OR (EQ s1397 0) (EQ s331 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2601 ms.
Product exploration explored 100000 steps with 50000 reset in 2775 ms.
Computed a total of 3094 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3094 transition count 2730
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r19-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r19-LTLCardinality-15 finished in 18045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : Echo-PT-d02r19-LTLCardinality-02
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Graph (complete) has 9355 edges and 3097 vertex of which 3089 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.8 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 147 ms. Remains 3088 /3097 variables (removed 9) and now considering 2728/2730 (removed 2) transitions.
// Phase 1: matrix 2728 rows 3088 cols
[2023-03-21 19:17:39] [INFO ] Computed 1364 place invariants in 4557 ms
[2023-03-21 19:17:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:17:42] [INFO ] Implicit Places using invariants in 6887 ms returned []
[2023-03-21 19:17:42] [INFO ] Invariant cache hit.
[2023-03-21 19:17:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:17:44] [INFO ] Implicit Places using invariants and state equation in 2391 ms returned []
Implicit Place search using SMT with State Equation took 9291 ms to find 0 implicit places.
[2023-03-21 19:17:44] [INFO ] Invariant cache hit.
[2023-03-21 19:17:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:17:46] [INFO ] Dead Transitions using invariants and state equation in 1870 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3088/3097 places, 2728/2730 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11312 ms. Remains : 3088/3097 places, 2728/2730 transitions.
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s128 0) (EQ s1666 1) (EQ s2414 0) (EQ s659 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 138 reset in 1972 ms.
Product exploration explored 100000 steps with 138 reset in 2243 ms.
Computed a total of 3088 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3088 transition count 2728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 226480 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226480 steps, saw 79955 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:17:55] [INFO ] Invariant cache hit.
[2023-03-21 19:18:00] [INFO ] [Real]Absence check using 0 positive and 1364 generalized place invariants in 4132 ms returned sat
[2023-03-21 19:18:12] [INFO ] After 16344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3088/3088 places, 2728/2728 transitions.
Graph (complete) has 9308 edges and 3088 vertex of which 3084 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3084 transition count 2724
Applied a total of 5 rules in 151 ms. Remains 3084 /3088 variables (removed 4) and now considering 2724/2728 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 3084/3088 places, 2724/2728 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 224489 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224489 steps, saw 79598 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:18:18] [INFO ] Invariants computation overflowed in 3492 ms
[2023-03-21 19:18:43] [INFO ] After 25026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 143 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 146 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:18:47] [INFO ] Invariants computation overflowed in 3414 ms
[2023-03-21 19:18:49] [INFO ] Implicit Places using invariants in 5423 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:18:53] [INFO ] Invariants computation overflowed in 3405 ms
[2023-03-21 19:18:53] [INFO ] Implicit Places using invariants and state equation in 4070 ms returned []
Implicit Place search using SMT with State Equation took 9497 ms to find 0 implicit places.
[2023-03-21 19:18:53] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:18:57] [INFO ] Invariants computation overflowed in 3404 ms
[2023-03-21 19:18:58] [INFO ] Dead Transitions using invariants and state equation in 4818 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14544 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 142 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:19:02] [INFO ] Invariants computation overflowed in 3413 ms
[2023-03-21 19:21:45] [INFO ] After 163075ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 3088 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3088/3088 places, 2728/2728 transitions.
Applied a total of 0 rules in 130 ms. Remains 3088 /3088 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
[2023-03-21 19:21:45] [INFO ] Invariant cache hit.
[2023-03-21 19:21:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:21:48] [INFO ] Implicit Places using invariants in 2414 ms returned []
[2023-03-21 19:21:48] [INFO ] Invariant cache hit.
[2023-03-21 19:21:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:21:50] [INFO ] Implicit Places using invariants and state equation in 2378 ms returned []
Implicit Place search using SMT with State Equation took 4795 ms to find 0 implicit places.
[2023-03-21 19:21:50] [INFO ] Invariant cache hit.
[2023-03-21 19:21:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:21:52] [INFO ] Dead Transitions using invariants and state equation in 1828 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6754 ms. Remains : 3088/3088 places, 2728/2728 transitions.
Computed a total of 3088 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3088 transition count 2728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222234 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222234 steps, saw 79222 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:21:57] [INFO ] Invariant cache hit.
[2023-03-21 19:22:02] [INFO ] [Real]Absence check using 0 positive and 1364 generalized place invariants in 4093 ms returned sat
[2023-03-21 19:22:13] [INFO ] After 16215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3088/3088 places, 2728/2728 transitions.
Graph (complete) has 9308 edges and 3088 vertex of which 3084 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3084 transition count 2724
Applied a total of 5 rules in 144 ms. Remains 3084 /3088 variables (removed 4) and now considering 2724/2728 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 3084/3088 places, 2724/2728 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 220801 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220801 steps, saw 78915 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:22:20] [INFO ] Invariants computation overflowed in 3245 ms
[2023-03-21 19:22:45] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 150 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 152 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:22:48] [INFO ] Invariants computation overflowed in 3126 ms
[2023-03-21 19:22:50] [INFO ] Implicit Places using invariants in 4998 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:22:53] [INFO ] Invariants computation overflowed in 3093 ms
[2023-03-21 19:22:54] [INFO ] Implicit Places using invariants and state equation in 3776 ms returned []
Implicit Place search using SMT with State Equation took 8784 ms to find 0 implicit places.
[2023-03-21 19:22:54] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:22:57] [INFO ] Invariants computation overflowed in 3088 ms
[2023-03-21 19:22:59] [INFO ] Dead Transitions using invariants and state equation in 4514 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13528 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 135 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-21 19:23:02] [INFO ] Invariants computation overflowed in 3103 ms
[2023-03-21 19:25:43] [INFO ] After 161146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 138 reset in 1960 ms.
Product exploration explored 100000 steps with 138 reset in 2201 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 3088 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3088/3088 places, 2728/2728 transitions.
Applied a total of 0 rules in 145 ms. Remains 3088 /3088 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
[2023-03-21 19:25:48] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-21 19:25:48] [INFO ] Invariant cache hit.
[2023-03-21 19:25:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:25:50] [INFO ] Dead Transitions using invariants and state equation in 1661 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1901 ms. Remains : 3088/3088 places, 2728/2728 transitions.
Built C files in :
/tmp/ltsmin7905919330119813627
[2023-03-21 19:25:50] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7905919330119813627
Running compilation step : cd /tmp/ltsmin7905919330119813627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7905919330119813627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7905919330119813627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 3088 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3088/3088 places, 2728/2728 transitions.
Applied a total of 0 rules in 122 ms. Remains 3088 /3088 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
[2023-03-21 19:25:53] [INFO ] Invariant cache hit.
[2023-03-21 19:25:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:25:55] [INFO ] Implicit Places using invariants in 2177 ms returned []
[2023-03-21 19:25:55] [INFO ] Invariant cache hit.
[2023-03-21 19:25:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:25:58] [INFO ] Implicit Places using invariants and state equation in 2469 ms returned []
Implicit Place search using SMT with State Equation took 4679 ms to find 0 implicit places.
[2023-03-21 19:25:58] [INFO ] Invariant cache hit.
[2023-03-21 19:25:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:26:00] [INFO ] Dead Transitions using invariants and state equation in 1670 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6472 ms. Remains : 3088/3088 places, 2728/2728 transitions.
Built C files in :
/tmp/ltsmin9202970131644469112
[2023-03-21 19:26:00] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9202970131644469112
Running compilation step : cd /tmp/ltsmin9202970131644469112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9202970131644469112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9202970131644469112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-21 19:26:03] [INFO ] Flatten gal took : 117 ms
[2023-03-21 19:26:03] [INFO ] Flatten gal took : 103 ms
[2023-03-21 19:26:04] [INFO ] Time to serialize gal into /tmp/LTL40808642124723039.gal : 595 ms
[2023-03-21 19:26:04] [INFO ] Time to serialize properties into /tmp/LTL14763595798498537149.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL40808642124723039.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16297066949398112329.hoa' '-atoms' '/tmp/LTL14763595798498537149.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL14763595798498537149.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16297066949398112329.hoa
Detected timeout of ITS tools.
[2023-03-21 19:26:19] [INFO ] Flatten gal took : 108 ms
[2023-03-21 19:26:19] [INFO ] Flatten gal took : 100 ms
[2023-03-21 19:26:19] [INFO ] Time to serialize gal into /tmp/LTL11250568318766218461.gal : 14 ms
[2023-03-21 19:26:19] [INFO ] Time to serialize properties into /tmp/LTL4650786625196287798.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11250568318766218461.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4650786625196287798.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(((p1128==0)||(p2667==1))||((p3417==0)||(p1659==1)))"))))
Formula 0 simplified : XF!"(((p1128==0)||(p2667==1))||((p3417==0)||(p1659==1)))"
Detected timeout of ITS tools.
[2023-03-21 19:26:34] [INFO ] Flatten gal took : 101 ms
[2023-03-21 19:26:34] [INFO ] Applying decomposition
[2023-03-21 19:26:34] [INFO ] Flatten gal took : 101 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15007595742455438246.txt' '-o' '/tmp/graph15007595742455438246.bin' '-w' '/tmp/graph15007595742455438246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15007595742455438246.bin' '-l' '-1' '-v' '-w' '/tmp/graph15007595742455438246.weights' '-q' '0' '-e' '0.001'
[2023-03-21 19:26:34] [INFO ] Decomposing Gal with order
[2023-03-21 19:26:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 19:26:35] [INFO ] Removed a total of 3201 redundant transitions.
[2023-03-21 19:26:35] [INFO ] Flatten gal took : 164 ms
[2023-03-21 19:26:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 510 labels/synchronizations in 50 ms.
[2023-03-21 19:26:35] [INFO ] Time to serialize gal into /tmp/LTL7179487765480285260.gal : 466 ms
[2023-03-21 19:26:35] [INFO ] Time to serialize properties into /tmp/LTL1909617836385355115.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7179487765480285260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1909617836385355115.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i5.i0.u54.p1128==0)||(i2.i0.u77.p2667==1))||((i4.i0.u141.p3417==0)||(i4.i1.u185.p1659==1)))"))))
Formula 0 simplified : XF!"(((i5.i0.u54.p1128==0)||(i2.i0.u77.p2667==1))||((i4.i0.u141.p3417==0)||(i4.i1.u185.p1659==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1867334954821469540
[2023-03-21 19:26:50] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1867334954821469540
Running compilation step : cd /tmp/ltsmin1867334954821469540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1867334954821469540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1867334954821469540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Echo-PT-d02r19-LTLCardinality-02 finished in 558958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1 U p2))))))'
Found a Shortening insensitive property : Echo-PT-d02r19-LTLCardinality-04
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Graph (complete) has 9355 edges and 3097 vertex of which 3090 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 148 ms. Remains 3089 /3097 variables (removed 8) and now considering 2728/2730 (removed 2) transitions.
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-21 19:27:01] [INFO ] Computed 1365 place invariants in 6856 ms
[2023-03-21 19:27:03] [INFO ] Implicit Places using invariants in 8843 ms returned []
[2023-03-21 19:27:03] [INFO ] Invariant cache hit.
[2023-03-21 19:27:05] [INFO ] Implicit Places using invariants and state equation in 2035 ms returned []
Implicit Place search using SMT with State Equation took 10891 ms to find 0 implicit places.
[2023-03-21 19:27:05] [INFO ] Invariant cache hit.
[2023-03-21 19:27:06] [INFO ] Dead Transitions using invariants and state equation in 1559 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3089/3097 places, 2728/2730 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12610 ms. Remains : 3089/3097 places, 2728/2730 transitions.
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s2716 0) (EQ s2453 1)), p2:(OR (EQ s2223 0) (EQ s710 1)), p1:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 194 reset in 2240 ms.
Product exploration explored 100000 steps with 195 reset in 2480 ms.
Computed a total of 3089 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3089 transition count 2728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 939 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:27:14] [INFO ] Invariant cache hit.
[2023-03-21 19:27:14] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:27:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 155 ms returned sat
[2023-03-21 19:27:21] [INFO ] [Nat]Absence check using 4 positive and 1361 generalized place invariants in 6501 ms returned sat
[2023-03-21 19:27:39] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3089 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Graph (complete) has 9316 edges and 3089 vertex of which 3085 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3085 transition count 2724
Applied a total of 5 rules in 145 ms. Remains 3085 /3089 variables (removed 4) and now considering 2724/2728 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 3085/3089 places, 2724/2728 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222697 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222697 steps, saw 79287 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:27:45] [INFO ] Invariants computation overflowed in 2098 ms
[2023-03-21 19:27:45] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:28:10] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 154 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 3085/3085 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 138 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:28:12] [INFO ] Invariants computation overflowed in 1858 ms
[2023-03-21 19:28:14] [INFO ] Implicit Places using invariants in 3686 ms returned []
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:28:16] [INFO ] Invariants computation overflowed in 1823 ms
[2023-03-21 19:28:17] [INFO ] Implicit Places using invariants and state equation in 2473 ms returned []
Implicit Place search using SMT with State Equation took 6170 ms to find 0 implicit places.
[2023-03-21 19:28:17] [INFO ] Redundant transitions in 63 ms returned []
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:28:18] [INFO ] Invariants computation overflowed in 1802 ms
[2023-03-21 19:28:20] [INFO ] Dead Transitions using invariants and state equation in 3258 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9639 ms. Remains : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 142 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:28:22] [INFO ] Invariants computation overflowed in 1814 ms
[2023-03-21 19:28:22] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:32:07] [INFO ] After 225027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 420 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-21 19:32:08] [INFO ] Invariant cache hit.
[2023-03-21 19:32:14] [INFO ] [Real]Absence check using 4 positive place invariants in 72 ms returned sat
[2023-03-21 19:32:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:32:23] [INFO ] [Real]Absence check using 4 positive and 1361 generalized place invariants in 9515 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 3089 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Applied a total of 0 rules in 119 ms. Remains 3089 /3089 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
[2023-03-21 19:32:23] [INFO ] Invariant cache hit.
[2023-03-21 19:32:25] [INFO ] Implicit Places using invariants in 1953 ms returned []
[2023-03-21 19:32:25] [INFO ] Invariant cache hit.
[2023-03-21 19:32:27] [INFO ] Implicit Places using invariants and state equation in 2049 ms returned []
Implicit Place search using SMT with State Equation took 4043 ms to find 0 implicit places.
[2023-03-21 19:32:27] [INFO ] Invariant cache hit.
[2023-03-21 19:32:29] [INFO ] Dead Transitions using invariants and state equation in 1611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5776 ms. Remains : 3089/3089 places, 2728/2728 transitions.
Computed a total of 3089 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3089 transition count 2728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 412 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:32:31] [INFO ] Invariant cache hit.
[2023-03-21 19:32:31] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:32:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 60 ms returned sat
[2023-03-21 19:32:38] [INFO ] [Nat]Absence check using 4 positive and 1361 generalized place invariants in 6718 ms returned sat
[2023-03-21 19:32:56] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3089 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Graph (complete) has 9316 edges and 3089 vertex of which 3085 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3085 transition count 2724
Applied a total of 5 rules in 168 ms. Remains 3085 /3089 variables (removed 4) and now considering 2724/2728 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 3085/3089 places, 2724/2728 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 211339 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211339 steps, saw 77138 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:33:02] [INFO ] Invariants computation overflowed in 1850 ms
[2023-03-21 19:33:02] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:33:27] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 157 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 3085/3085 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 156 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:33:29] [INFO ] Invariants computation overflowed in 1854 ms
[2023-03-21 19:33:31] [INFO ] Implicit Places using invariants in 3833 ms returned []
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:33:33] [INFO ] Invariants computation overflowed in 1980 ms
[2023-03-21 19:33:34] [INFO ] Implicit Places using invariants and state equation in 2720 ms returned []
Implicit Place search using SMT with State Equation took 6556 ms to find 0 implicit places.
[2023-03-21 19:33:34] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:33:36] [INFO ] Invariants computation overflowed in 2011 ms
[2023-03-21 19:33:38] [INFO ] Dead Transitions using invariants and state equation in 3508 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10301 ms. Remains : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 141 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-21 19:33:40] [INFO ] Invariants computation overflowed in 1846 ms
[2023-03-21 19:33:40] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:37:25] [INFO ] After 225017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 448 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-21 19:37:26] [INFO ] Invariant cache hit.
[2023-03-21 19:37:31] [INFO ] [Real]Absence check using 4 positive place invariants in 73 ms returned sat
[2023-03-21 19:37:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 19:37:41] [INFO ] [Real]Absence check using 4 positive and 1361 generalized place invariants in 9760 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 1383 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 196 reset in 2188 ms.
Product exploration explored 100000 steps with 185 reset in 3174 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 3089 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Applied a total of 0 rules in 141 ms. Remains 3089 /3089 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
[2023-03-21 19:37:49] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-21 19:37:49] [INFO ] Invariant cache hit.
[2023-03-21 19:37:50] [INFO ] Dead Transitions using invariants and state equation in 1574 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1794 ms. Remains : 3089/3089 places, 2728/2728 transitions.
Built C files in :
/tmp/ltsmin338075150740144545
[2023-03-21 19:37:50] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin338075150740144545
Running compilation step : cd /tmp/ltsmin338075150740144545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin338075150740144545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin338075150740144545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 3089 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Applied a total of 0 rules in 122 ms. Remains 3089 /3089 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
[2023-03-21 19:37:53] [INFO ] Invariant cache hit.
[2023-03-21 19:37:55] [INFO ] Implicit Places using invariants in 2138 ms returned []
[2023-03-21 19:37:55] [INFO ] Invariant cache hit.
[2023-03-21 19:37:57] [INFO ] Implicit Places using invariants and state equation in 2001 ms returned []
Implicit Place search using SMT with State Equation took 4180 ms to find 0 implicit places.
[2023-03-21 19:37:57] [INFO ] Invariant cache hit.
[2023-03-21 19:37:59] [INFO ] Dead Transitions using invariants and state equation in 1570 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5877 ms. Remains : 3089/3089 places, 2728/2728 transitions.
Built C files in :
/tmp/ltsmin7928558287970479232
[2023-03-21 19:37:59] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7928558287970479232
Running compilation step : cd /tmp/ltsmin7928558287970479232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7928558287970479232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7928558287970479232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-21 19:38:02] [INFO ] Flatten gal took : 116 ms
[2023-03-21 19:38:02] [INFO ] Flatten gal took : 100 ms
[2023-03-21 19:38:02] [INFO ] Time to serialize gal into /tmp/LTL2255745342436736118.gal : 14 ms
[2023-03-21 19:38:05] [INFO ] Time to serialize properties into /tmp/LTL4573162471724348815.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2255745342436736118.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14244643454087772919.hoa' '-atoms' '/tmp/LTL4573162471724348815.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4573162471724348815.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14244643454087772919.hoa
Detected timeout of ITS tools.
[2023-03-21 19:38:20] [INFO ] Flatten gal took : 109 ms
[2023-03-21 19:38:20] [INFO ] Flatten gal took : 109 ms
[2023-03-21 19:38:20] [INFO ] Time to serialize gal into /tmp/LTL8777044922827358733.gal : 17 ms
[2023-03-21 19:38:20] [INFO ] Time to serialize properties into /tmp/LTL12000101309459992089.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8777044922827358733.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12000101309459992089.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G(("(p1050==1)")U("((p3226==0)||(p1710==1))")))||("((p627==0)&&(p346==1))")))))
Formula 0 simplified : XG(!"((p627==0)&&(p346==1))" & F(!"(p1050==1)" R !"((p3226==0)||(p1710==1))"))
Detected timeout of ITS tools.
[2023-03-21 19:38:35] [INFO ] Flatten gal took : 99 ms
[2023-03-21 19:38:35] [INFO ] Applying decomposition
[2023-03-21 19:38:35] [INFO ] Flatten gal took : 99 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1604820619986752931.txt' '-o' '/tmp/graph1604820619986752931.bin' '-w' '/tmp/graph1604820619986752931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1604820619986752931.bin' '-l' '-1' '-v' '-w' '/tmp/graph1604820619986752931.weights' '-q' '0' '-e' '0.001'
[2023-03-21 19:38:36] [INFO ] Decomposing Gal with order
[2023-03-21 19:38:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 19:38:36] [INFO ] Removed a total of 3221 redundant transitions.
[2023-03-21 19:38:36] [INFO ] Flatten gal took : 168 ms
[2023-03-21 19:38:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 343 labels/synchronizations in 53 ms.
[2023-03-21 19:38:36] [INFO ] Time to serialize gal into /tmp/LTL16040956829248685233.gal : 36 ms
[2023-03-21 19:38:36] [INFO ] Time to serialize properties into /tmp/LTL13029254366308940004.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16040956829248685233.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13029254366308940004.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G(("(i15.i1.u18.p1050==1)")U("((i0.i3.u238.p3226==0)||(i11.i1.u183.p1710==1))")))||("((i12.u346.p627==0)&&(i5.u173.p346==1))")...159
Formula 0 simplified : XG(!"((i12.u346.p627==0)&&(i5.u173.p346==1))" & F(!"(i15.i1.u18.p1050==1)" R !"((i0.i3.u238.p3226==0)||(i11.i1.u183.p1710==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin335895892773486442
[2023-03-21 19:38:51] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin335895892773486442
Running compilation step : cd /tmp/ltsmin335895892773486442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin335895892773486442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin335895892773486442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Echo-PT-d02r19-LTLCardinality-04 finished in 720704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p1))))))'
[2023-03-21 19:38:54] [INFO ] Flatten gal took : 113 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16556688657553877738
[2023-03-21 19:38:54] [INFO ] Too many transitions (2730) to apply POR reductions. Disabling POR matrices.
[2023-03-21 19:38:54] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16556688657553877738
Running compilation step : cd /tmp/ltsmin16556688657553877738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-21 19:38:55] [INFO ] Applying decomposition
[2023-03-21 19:38:55] [INFO ] Flatten gal took : 116 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8863422137553578414.txt' '-o' '/tmp/graph8863422137553578414.bin' '-w' '/tmp/graph8863422137553578414.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8863422137553578414.bin' '-l' '-1' '-v' '-w' '/tmp/graph8863422137553578414.weights' '-q' '0' '-e' '0.001'
[2023-03-21 19:38:55] [INFO ] Decomposing Gal with order
[2023-03-21 19:38:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 19:38:55] [INFO ] Removed a total of 3370 redundant transitions.
[2023-03-21 19:38:55] [INFO ] Flatten gal took : 180 ms
[2023-03-21 19:38:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 56 ms.
[2023-03-21 19:38:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality4154117083394042102.gal : 28 ms
[2023-03-21 19:38:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality6313214156620865318.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4154117083394042102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6313214156620865318.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((X(G("(((i4.u57.p1128==0)||(i7.u298.p2667==1))||((i8.u163.p3417==0)||(i14.u340.p1659==1)))"))))
Formula 0 simplified : XF!"(((i4.u57.p1128==0)||(i7.u298.p2667==1))||((i8.u163.p3417==0)||(i14.u340.p1659==1)))"
Compilation finished in 9106 ms.
Running link step : cd /tmp/ltsmin16556688657553877738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin16556688657553877738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.050: LTL layer: formula: X([]((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 0.053: "X([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.055: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.091: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.638: DFS-FIFO for weak LTL, using special progress label 2738
pins2lts-mc-linux64( 0/ 8), 1.638: There are 2739 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.638: State length is 3098, there are 2734 groups
pins2lts-mc-linux64( 0/ 8), 1.638: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.638: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.638: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.638: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 2.125: ~1 levels ~960 states ~10136 transitions
pins2lts-mc-linux64( 2/ 8), 2.535: ~1 levels ~1920 states ~22944 transitions
pins2lts-mc-linux64( 2/ 8), 3.245: ~1 levels ~3840 states ~49728 transitions
pins2lts-mc-linux64( 6/ 8), 4.605: ~1 levels ~7680 states ~104216 transitions
pins2lts-mc-linux64( 4/ 8), 7.184: ~1 levels ~15360 states ~217096 transitions
pins2lts-mc-linux64( 4/ 8), 12.568: ~1 levels ~30720 states ~451784 transitions
pins2lts-mc-linux64( 5/ 8), 23.010: ~1 levels ~61440 states ~919072 transitions
pins2lts-mc-linux64( 7/ 8), 43.370: ~1 levels ~122880 states ~1946928 transitions
pins2lts-mc-linux64( 7/ 8), 84.516: ~1 levels ~245760 states ~4066640 transitions
pins2lts-mc-linux64( 7/ 8), 167.267: ~1 levels ~491520 states ~8453896 transitions
pins2lts-mc-linux64( 2/ 8), 338.907: ~1 levels ~983040 states ~17696584 transitions
pins2lts-mc-linux64( 7/ 8), 411.998: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 412.403:
pins2lts-mc-linux64( 0/ 8), 412.404: mean standard work distribution: 0.4% (states) 1.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 412.404:
pins2lts-mc-linux64( 0/ 8), 412.404: Explored 1178381 states 21340351 transitions, fanout: 18.110
pins2lts-mc-linux64( 0/ 8), 412.404: Total exploration time 410.760 sec (410.450 sec minimum, 410.599 sec on average)
pins2lts-mc-linux64( 0/ 8), 412.404: States per second: 2869, Transitions per second: 51953
pins2lts-mc-linux64( 0/ 8), 412.404:
pins2lts-mc-linux64( 0/ 8), 412.404: Progress states detected: 6392063
pins2lts-mc-linux64( 0/ 8), 412.404: Redundant explorations: -81.5651
pins2lts-mc-linux64( 0/ 8), 412.404:
pins2lts-mc-linux64( 0/ 8), 412.404: Queue width: 8B, total height: 6662894, memory: 50.83MB
pins2lts-mc-linux64( 0/ 8), 412.404: Tree memory: 304.8MB, 50.0 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 412.404: Tree fill ratio (roots/leafs): 4.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 412.404: Stored 2964 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 412.404: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 412.404: Est. total memory use: 355.6MB (~1074.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16556688657553877738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16556688657553877738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 166192 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16274704 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d02r19"
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-5348"
echo " Executing tool itstools"
echo " Input is Echo-PT-d02r19, 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 r165-tall-167838849900075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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