Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789600548.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldRVs-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789600548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717011161257

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 19:32:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 19:32:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:32:43] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2024-05-29 19:32:43] [INFO ] Transformed 4003 places.
[2024-05-29 19:32:43] [INFO ] Transformed 4503 transitions.
[2024-05-29 19:32:43] [INFO ] Found NUPN structural information;
[2024-05-29 19:32:43] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-100B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 4003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Discarding 687 places :
Symmetric choice reduction at 0 with 687 rule applications. Total rules 687 place count 3316 transition count 3816
Iterating global reduction 0 with 687 rules applied. Total rules applied 1374 place count 3316 transition count 3816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1375 place count 3315 transition count 3815
Iterating global reduction 0 with 1 rules applied. Total rules applied 1376 place count 3315 transition count 3815
Applied a total of 1376 rules in 853 ms. Remains 3315 /4003 variables (removed 688) and now considering 3815/4503 (removed 688) transitions.
// Phase 1: matrix 3815 rows 3315 cols
[2024-05-29 19:32:44] [INFO ] Computed 401 invariants in 74 ms
[2024-05-29 19:32:45] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2024-05-29 19:32:45] [INFO ] Invariant cache hit.
[2024-05-29 19:32:51] [INFO ] Implicit Places using invariants and state equation in 5232 ms returned []
Implicit Place search using SMT with State Equation took 6362 ms to find 0 implicit places.
[2024-05-29 19:32:51] [INFO ] Invariant cache hit.
[2024-05-29 19:32:53] [INFO ] Dead Transitions using invariants and state equation in 2781 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3315/4003 places, 3815/4503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10000 ms. Remains : 3315/4003 places, 3815/4503 transitions.
Support contains 58 out of 3315 places after structural reductions.
[2024-05-29 19:32:54] [INFO ] Flatten gal took : 268 ms
[2024-05-29 19:32:54] [INFO ] Flatten gal took : 152 ms
[2024-05-29 19:32:54] [INFO ] Input system was already deterministic with 3815 transitions.
Support contains 56 out of 3315 places (down from 58) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 34) seen :19
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-29 19:32:55] [INFO ] Invariant cache hit.
[2024-05-29 19:32:56] [INFO ] After 1196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 19:32:58] [INFO ] [Nat]Absence check using 401 positive place invariants in 224 ms returned sat
[2024-05-29 19:33:02] [INFO ] After 3736ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2024-05-29 19:33:03] [INFO ] Deduced a trap composed of 28 places in 842 ms of which 12 ms to minimize.
[2024-05-29 19:33:04] [INFO ] Deduced a trap composed of 27 places in 785 ms of which 2 ms to minimize.
[2024-05-29 19:33:05] [INFO ] Deduced a trap composed of 37 places in 800 ms of which 2 ms to minimize.
[2024-05-29 19:33:06] [INFO ] Deduced a trap composed of 25 places in 768 ms of which 3 ms to minimize.
[2024-05-29 19:33:07] [INFO ] Deduced a trap composed of 20 places in 794 ms of which 2 ms to minimize.
[2024-05-29 19:33:07] [INFO ] Deduced a trap composed of 24 places in 780 ms of which 1 ms to minimize.
[2024-05-29 19:33:08] [INFO ] Deduced a trap composed of 30 places in 765 ms of which 2 ms to minimize.
[2024-05-29 19:33:09] [INFO ] Deduced a trap composed of 31 places in 808 ms of which 1 ms to minimize.
[2024-05-29 19:33:10] [INFO ] Deduced a trap composed of 28 places in 774 ms of which 1 ms to minimize.
[2024-05-29 19:33:11] [INFO ] Deduced a trap composed of 22 places in 759 ms of which 1 ms to minimize.
[2024-05-29 19:33:12] [INFO ] Deduced a trap composed of 35 places in 757 ms of which 1 ms to minimize.
[2024-05-29 19:33:13] [INFO ] Deduced a trap composed of 46 places in 742 ms of which 1 ms to minimize.
[2024-05-29 19:33:14] [INFO ] Deduced a trap composed of 47 places in 728 ms of which 2 ms to minimize.
[2024-05-29 19:33:15] [INFO ] Deduced a trap composed of 40 places in 747 ms of which 1 ms to minimize.
[2024-05-29 19:33:15] [INFO ] Deduced a trap composed of 25 places in 619 ms of which 2 ms to minimize.
[2024-05-29 19:33:16] [INFO ] Deduced a trap composed of 58 places in 702 ms of which 1 ms to minimize.
[2024-05-29 19:33:17] [INFO ] Deduced a trap composed of 58 places in 652 ms of which 2 ms to minimize.
[2024-05-29 19:33:18] [INFO ] Deduced a trap composed of 48 places in 715 ms of which 1 ms to minimize.
[2024-05-29 19:33:18] [INFO ] Deduced a trap composed of 62 places in 664 ms of which 1 ms to minimize.
[2024-05-29 19:33:19] [INFO ] Deduced a trap composed of 67 places in 693 ms of which 1 ms to minimize.
[2024-05-29 19:33:20] [INFO ] Deduced a trap composed of 58 places in 678 ms of which 1 ms to minimize.
[2024-05-29 19:33:21] [INFO ] Deduced a trap composed of 55 places in 753 ms of which 2 ms to minimize.
[2024-05-29 19:33:22] [INFO ] Deduced a trap composed of 79 places in 733 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:33:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 19:33:22] [INFO ] After 25585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 2696 ms.
Support contains 30 out of 3315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 3315 transition count 3423
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 1 with 392 rules applied. Total rules applied 784 place count 2923 transition count 3423
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 784 place count 2923 transition count 2924
Deduced a syphon composed of 499 places in 16 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1782 place count 2424 transition count 2924
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1789 place count 2417 transition count 2917
Iterating global reduction 2 with 7 rules applied. Total rules applied 1796 place count 2417 transition count 2917
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1796 place count 2417 transition count 2914
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1802 place count 2414 transition count 2914
Performed 990 Post agglomeration using F-continuation condition.Transition count delta: 990
Deduced a syphon composed of 990 places in 17 ms
Reduce places removed 990 places and 0 transitions.
Iterating global reduction 2 with 1980 rules applied. Total rules applied 3782 place count 1424 transition count 1924
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 196 times.
Drop transitions removed 196 transitions
Iterating global reduction 2 with 196 rules applied. Total rules applied 3978 place count 1424 transition count 1924
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3979 place count 1423 transition count 1923
Applied a total of 3979 rules in 1016 ms. Remains 1423 /3315 variables (removed 1892) and now considering 1923/3815 (removed 1892) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1018 ms. Remains : 1423/3315 places, 1923/3815 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1923 rows 1423 cols
[2024-05-29 19:33:26] [INFO ] Computed 401 invariants in 18 ms
[2024-05-29 19:33:26] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 19:33:27] [INFO ] [Nat]Absence check using 401 positive place invariants in 71 ms returned sat
[2024-05-29 19:33:28] [INFO ] After 895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 19:33:28] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:33:28] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:33:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2024-05-29 19:33:28] [INFO ] After 1501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 176 ms.
[2024-05-29 19:33:28] [INFO ] After 1990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 118 ms.
Support contains 11 out of 1423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1423/1423 places, 1923/1923 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 1423 transition count 1918
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1418 transition count 1918
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 1410 transition count 1910
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 1410 transition count 1910
Applied a total of 29 rules in 190 ms. Remains 1410 /1423 variables (removed 13) and now considering 1910/1923 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 1410/1423 places, 1910/1923 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1910 rows 1410 cols
[2024-05-29 19:33:29] [INFO ] Computed 401 invariants in 8 ms
[2024-05-29 19:33:29] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 19:33:30] [INFO ] [Nat]Absence check using 401 positive place invariants in 71 ms returned sat
[2024-05-29 19:33:30] [INFO ] After 809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 19:33:31] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:33:31] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:33:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2024-05-29 19:33:31] [INFO ] After 1235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 135 ms.
[2024-05-29 19:33:31] [INFO ] After 1693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 36 ms.
Support contains 8 out of 1410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1410/1410 places, 1910/1910 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1410 transition count 1909
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1409 transition count 1909
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1408 transition count 1908
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1408 transition count 1908
Applied a total of 5 rules in 175 ms. Remains 1408 /1410 variables (removed 2) and now considering 1908/1910 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 1408/1410 places, 1908/1910 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 185075 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185075 steps, saw 180961 distinct states, run finished after 3003 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1908 rows 1408 cols
[2024-05-29 19:33:35] [INFO ] Computed 401 invariants in 15 ms
[2024-05-29 19:33:35] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 19:33:35] [INFO ] [Nat]Absence check using 401 positive place invariants in 70 ms returned sat
[2024-05-29 19:33:36] [INFO ] After 795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 19:33:36] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:33:36] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:33:36] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:33:36] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:33:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 565 ms
[2024-05-29 19:33:37] [INFO ] After 1511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-29 19:33:37] [INFO ] After 1922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 43 ms.
Support contains 8 out of 1408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 1908/1908 transitions.
Applied a total of 0 rules in 62 ms. Remains 1408 /1408 variables (removed 0) and now considering 1908/1908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1408/1408 places, 1908/1908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 1908/1908 transitions.
Applied a total of 0 rules in 59 ms. Remains 1408 /1408 variables (removed 0) and now considering 1908/1908 (removed 0) transitions.
[2024-05-29 19:33:37] [INFO ] Invariant cache hit.
[2024-05-29 19:33:38] [INFO ] Implicit Places using invariants in 810 ms returned []
[2024-05-29 19:33:38] [INFO ] Invariant cache hit.
[2024-05-29 19:33:40] [INFO ] Implicit Places using invariants and state equation in 1837 ms returned []
Implicit Place search using SMT with State Equation took 2649 ms to find 0 implicit places.
[2024-05-29 19:33:40] [INFO ] Redundant transitions in 303 ms returned []
[2024-05-29 19:33:40] [INFO ] Invariant cache hit.
[2024-05-29 19:33:41] [INFO ] Dead Transitions using invariants and state equation in 993 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4013 ms. Remains : 1408/1408 places, 1908/1908 transitions.
Applied a total of 0 rules in 75 ms. Remains 1408 /1408 variables (removed 0) and now considering 1908/1908 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 19:33:41] [INFO ] Invariant cache hit.
[2024-05-29 19:33:41] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 19:33:41] [INFO ] [Nat]Absence check using 401 positive place invariants in 70 ms returned sat
[2024-05-29 19:33:42] [INFO ] After 741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 19:33:42] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:33:42] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:33:42] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 3 ms to minimize.
[2024-05-29 19:33:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 339 ms
[2024-05-29 19:33:43] [INFO ] After 1235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2024-05-29 19:33:43] [INFO ] After 1648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA ShieldRVs-PT-100B-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 805 stabilizing places and 805 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p1 U G(p2)))))'
Support contains 8 out of 3315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3303 transition count 3803
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3303 transition count 3803
Applied a total of 24 rules in 306 ms. Remains 3303 /3315 variables (removed 12) and now considering 3803/3815 (removed 12) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2024-05-29 19:33:44] [INFO ] Computed 401 invariants in 17 ms
[2024-05-29 19:33:45] [INFO ] Implicit Places using invariants in 984 ms returned []
[2024-05-29 19:33:45] [INFO ] Invariant cache hit.
[2024-05-29 19:33:51] [INFO ] Implicit Places using invariants and state equation in 6197 ms returned []
Implicit Place search using SMT with State Equation took 7184 ms to find 0 implicit places.
[2024-05-29 19:33:51] [INFO ] Invariant cache hit.
[2024-05-29 19:33:54] [INFO ] Dead Transitions using invariants and state equation in 2757 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3315 places, 3803/3815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10251 ms. Remains : 3303/3315 places, 3803/3815 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s1762 1), p1:(EQ s1790 1), p0:(OR (EQ s2574 0) (EQ s2610 0) (EQ s2630 0) (EQ s1404 0) (EQ s1411 0) (EQ s1432 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 100 reset in 1028 ms.
Product exploration explored 100000 steps with 88 reset in 965 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 218 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-29 19:33:57] [INFO ] Invariant cache hit.
[2024-05-29 19:33:58] [INFO ] [Real]Absence check using 401 positive place invariants in 242 ms returned sat
[2024-05-29 19:33:58] [INFO ] After 1107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 19:33:59] [INFO ] [Nat]Absence check using 401 positive place invariants in 230 ms returned sat
[2024-05-29 19:34:03] [INFO ] After 3967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 19:34:05] [INFO ] Deduced a trap composed of 21 places in 1009 ms of which 1 ms to minimize.
[2024-05-29 19:34:06] [INFO ] Deduced a trap composed of 20 places in 1006 ms of which 3 ms to minimize.
[2024-05-29 19:34:07] [INFO ] Deduced a trap composed of 23 places in 999 ms of which 1 ms to minimize.
[2024-05-29 19:34:08] [INFO ] Deduced a trap composed of 32 places in 985 ms of which 1 ms to minimize.
[2024-05-29 19:34:09] [INFO ] Deduced a trap composed of 47 places in 944 ms of which 2 ms to minimize.
[2024-05-29 19:34:10] [INFO ] Deduced a trap composed of 30 places in 1000 ms of which 2 ms to minimize.
[2024-05-29 19:34:11] [INFO ] Deduced a trap composed of 29 places in 1001 ms of which 2 ms to minimize.
[2024-05-29 19:34:12] [INFO ] Deduced a trap composed of 72 places in 890 ms of which 1 ms to minimize.
[2024-05-29 19:34:13] [INFO ] Deduced a trap composed of 36 places in 958 ms of which 1 ms to minimize.
[2024-05-29 19:34:14] [INFO ] Deduced a trap composed of 35 places in 957 ms of which 1 ms to minimize.
[2024-05-29 19:34:15] [INFO ] Deduced a trap composed of 33 places in 938 ms of which 2 ms to minimize.
[2024-05-29 19:34:16] [INFO ] Deduced a trap composed of 35 places in 969 ms of which 2 ms to minimize.
[2024-05-29 19:34:18] [INFO ] Deduced a trap composed of 104 places in 936 ms of which 2 ms to minimize.
[2024-05-29 19:34:19] [INFO ] Deduced a trap composed of 32 places in 939 ms of which 1 ms to minimize.
[2024-05-29 19:34:20] [INFO ] Deduced a trap composed of 54 places in 901 ms of which 1 ms to minimize.
[2024-05-29 19:34:21] [INFO ] Deduced a trap composed of 68 places in 938 ms of which 1 ms to minimize.
[2024-05-29 19:34:22] [INFO ] Deduced a trap composed of 30 places in 897 ms of which 2 ms to minimize.
[2024-05-29 19:34:23] [INFO ] Deduced a trap composed of 34 places in 902 ms of which 3 ms to minimize.
[2024-05-29 19:34:24] [INFO ] Deduced a trap composed of 56 places in 828 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:34:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 19:34:24] [INFO ] After 25467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 994 ms.
Support contains 8 out of 3303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Drop transitions removed 397 transitions
Trivial Post-agglo rules discarded 397 transitions
Performed 397 trivial Post agglomeration. Transition count delta: 397
Iterating post reduction 0 with 397 rules applied. Total rules applied 397 place count 3303 transition count 3406
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 794 place count 2906 transition count 3406
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 794 place count 2906 transition count 2907
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1792 place count 2407 transition count 2907
Performed 997 Post agglomeration using F-continuation condition.Transition count delta: 997
Deduced a syphon composed of 997 places in 5 ms
Reduce places removed 997 places and 0 transitions.
Iterating global reduction 2 with 1994 rules applied. Total rules applied 3786 place count 1410 transition count 1910
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 2 with 201 rules applied. Total rules applied 3987 place count 1410 transition count 1910
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3988 place count 1409 transition count 1909
Applied a total of 3988 rules in 489 ms. Remains 1409 /3303 variables (removed 1894) and now considering 1909/3803 (removed 1894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 ms. Remains : 1409/3303 places, 1909/3803 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1909 rows 1409 cols
[2024-05-29 19:34:26] [INFO ] Computed 401 invariants in 10 ms
[2024-05-29 19:34:26] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 19:34:26] [INFO ] [Nat]Absence check using 401 positive place invariants in 77 ms returned sat
[2024-05-29 19:34:28] [INFO ] After 1018ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 19:34:28] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:34:28] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:34:28] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:34:28] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:34:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 453 ms
[2024-05-29 19:34:28] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2024-05-29 19:34:29] [INFO ] After 2042ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 297 ms.
[2024-05-29 19:34:29] [INFO ] After 2804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 192 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 56 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 113457 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113457 steps, saw 110758 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 19:34:33] [INFO ] Invariant cache hit.
[2024-05-29 19:34:33] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 19:34:33] [INFO ] [Nat]Absence check using 401 positive place invariants in 74 ms returned sat
[2024-05-29 19:34:34] [INFO ] After 987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 415 ms
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:34:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2024-05-29 19:34:36] [INFO ] After 2242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 342 ms.
[2024-05-29 19:34:36] [INFO ] After 3053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 221 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 66 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 52 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2024-05-29 19:34:36] [INFO ] Invariant cache hit.
[2024-05-29 19:34:37] [INFO ] Implicit Places using invariants in 748 ms returned []
[2024-05-29 19:34:37] [INFO ] Invariant cache hit.
[2024-05-29 19:34:39] [INFO ] Implicit Places using invariants and state equation in 1817 ms returned []
Implicit Place search using SMT with State Equation took 2567 ms to find 0 implicit places.
[2024-05-29 19:34:39] [INFO ] Redundant transitions in 166 ms returned []
[2024-05-29 19:34:39] [INFO ] Invariant cache hit.
[2024-05-29 19:34:40] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3728 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 71 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-29 19:34:40] [INFO ] Invariant cache hit.
[2024-05-29 19:34:40] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 19:34:41] [INFO ] [Nat]Absence check using 401 positive place invariants in 66 ms returned sat
[2024-05-29 19:34:42] [INFO ] After 978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 19:34:42] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:34:42] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:34:42] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:34:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 412 ms
[2024-05-29 19:34:42] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:34:43] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:34:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2024-05-29 19:34:43] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2024-05-29 19:34:43] [INFO ] After 2205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 351 ms.
[2024-05-29 19:34:43] [INFO ] After 2966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 21 factoid took 480 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Support contains 8 out of 3303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Applied a total of 0 rules in 140 ms. Remains 3303 /3303 variables (removed 0) and now considering 3803/3803 (removed 0) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2024-05-29 19:34:44] [INFO ] Computed 401 invariants in 22 ms
[2024-05-29 19:34:46] [INFO ] Implicit Places using invariants in 1224 ms returned []
[2024-05-29 19:34:46] [INFO ] Invariant cache hit.
[2024-05-29 19:34:52] [INFO ] Implicit Places using invariants and state equation in 6061 ms returned []
Implicit Place search using SMT with State Equation took 7287 ms to find 0 implicit places.
[2024-05-29 19:34:52] [INFO ] Invariant cache hit.
[2024-05-29 19:34:55] [INFO ] Dead Transitions using invariants and state equation in 3308 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10737 ms. Remains : 3303/3303 places, 3803/3803 transitions.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (AND (NOT p1) p2)), (X (OR p1 p2)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (AND (NOT p1) p2))), (X (X (OR p1 p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 210 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-29 19:34:56] [INFO ] Invariant cache hit.
[2024-05-29 19:34:57] [INFO ] [Real]Absence check using 401 positive place invariants in 250 ms returned sat
[2024-05-29 19:34:57] [INFO ] After 1078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 19:34:58] [INFO ] [Nat]Absence check using 401 positive place invariants in 228 ms returned sat
[2024-05-29 19:35:02] [INFO ] After 3746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 19:35:03] [INFO ] Deduced a trap composed of 21 places in 953 ms of which 2 ms to minimize.
[2024-05-29 19:35:04] [INFO ] Deduced a trap composed of 20 places in 940 ms of which 2 ms to minimize.
[2024-05-29 19:35:05] [INFO ] Deduced a trap composed of 23 places in 919 ms of which 1 ms to minimize.
[2024-05-29 19:35:06] [INFO ] Deduced a trap composed of 32 places in 930 ms of which 1 ms to minimize.
[2024-05-29 19:35:07] [INFO ] Deduced a trap composed of 47 places in 929 ms of which 2 ms to minimize.
[2024-05-29 19:35:08] [INFO ] Deduced a trap composed of 30 places in 931 ms of which 1 ms to minimize.
[2024-05-29 19:35:09] [INFO ] Deduced a trap composed of 29 places in 915 ms of which 2 ms to minimize.
[2024-05-29 19:35:10] [INFO ] Deduced a trap composed of 72 places in 906 ms of which 2 ms to minimize.
[2024-05-29 19:35:11] [INFO ] Deduced a trap composed of 36 places in 904 ms of which 2 ms to minimize.
[2024-05-29 19:35:12] [INFO ] Deduced a trap composed of 35 places in 888 ms of which 1 ms to minimize.
[2024-05-29 19:35:13] [INFO ] Deduced a trap composed of 33 places in 938 ms of which 2 ms to minimize.
[2024-05-29 19:35:14] [INFO ] Deduced a trap composed of 35 places in 820 ms of which 2 ms to minimize.
[2024-05-29 19:35:15] [INFO ] Deduced a trap composed of 104 places in 903 ms of which 2 ms to minimize.
[2024-05-29 19:35:17] [INFO ] Deduced a trap composed of 32 places in 1025 ms of which 2 ms to minimize.
[2024-05-29 19:35:18] [INFO ] Deduced a trap composed of 54 places in 889 ms of which 2 ms to minimize.
[2024-05-29 19:35:19] [INFO ] Deduced a trap composed of 68 places in 937 ms of which 2 ms to minimize.
[2024-05-29 19:35:20] [INFO ] Deduced a trap composed of 30 places in 944 ms of which 2 ms to minimize.
[2024-05-29 19:35:21] [INFO ] Deduced a trap composed of 34 places in 952 ms of which 2 ms to minimize.
[2024-05-29 19:35:22] [INFO ] Deduced a trap composed of 56 places in 967 ms of which 2 ms to minimize.
[2024-05-29 19:35:23] [INFO ] Deduced a trap composed of 40 places in 938 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:35:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 19:35:23] [INFO ] After 25786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1134 ms.
Support contains 8 out of 3303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Drop transitions removed 397 transitions
Trivial Post-agglo rules discarded 397 transitions
Performed 397 trivial Post agglomeration. Transition count delta: 397
Iterating post reduction 0 with 397 rules applied. Total rules applied 397 place count 3303 transition count 3406
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 794 place count 2906 transition count 3406
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 794 place count 2906 transition count 2907
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1792 place count 2407 transition count 2907
Performed 997 Post agglomeration using F-continuation condition.Transition count delta: 997
Deduced a syphon composed of 997 places in 7 ms
Reduce places removed 997 places and 0 transitions.
Iterating global reduction 2 with 1994 rules applied. Total rules applied 3786 place count 1410 transition count 1910
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 2 with 201 rules applied. Total rules applied 3987 place count 1410 transition count 1910
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3988 place count 1409 transition count 1909
Applied a total of 3988 rules in 492 ms. Remains 1409 /3303 variables (removed 1894) and now considering 1909/3803 (removed 1894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 1409/3303 places, 1909/3803 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1909 rows 1409 cols
[2024-05-29 19:35:25] [INFO ] Computed 401 invariants in 9 ms
[2024-05-29 19:35:25] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 19:35:26] [INFO ] [Nat]Absence check using 401 positive place invariants in 76 ms returned sat
[2024-05-29 19:35:27] [INFO ] After 988ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 19:35:27] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:35:27] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:35:27] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:35:27] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:35:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 444 ms
[2024-05-29 19:35:28] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:35:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-05-29 19:35:28] [INFO ] After 1996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 293 ms.
[2024-05-29 19:35:28] [INFO ] After 2755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 222 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 54 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 121089 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121089 steps, saw 117979 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 19:35:32] [INFO ] Invariant cache hit.
[2024-05-29 19:35:32] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 19:35:33] [INFO ] [Nat]Absence check using 401 positive place invariants in 70 ms returned sat
[2024-05-29 19:35:34] [INFO ] After 983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 19:35:34] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:35:34] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:35:34] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:35:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 394 ms
[2024-05-29 19:35:35] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:35:35] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:35:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2024-05-29 19:35:35] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-05-29 19:35:35] [INFO ] After 2232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 380 ms.
[2024-05-29 19:35:35] [INFO ] After 3044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 192 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 52 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 63 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2024-05-29 19:35:36] [INFO ] Invariant cache hit.
[2024-05-29 19:35:36] [INFO ] Implicit Places using invariants in 730 ms returned []
[2024-05-29 19:35:36] [INFO ] Invariant cache hit.
[2024-05-29 19:35:38] [INFO ] Implicit Places using invariants and state equation in 1932 ms returned []
Implicit Place search using SMT with State Equation took 2663 ms to find 0 implicit places.
[2024-05-29 19:35:39] [INFO ] Redundant transitions in 181 ms returned []
[2024-05-29 19:35:39] [INFO ] Invariant cache hit.
[2024-05-29 19:35:40] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3917 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 51 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-29 19:35:40] [INFO ] Invariant cache hit.
[2024-05-29 19:35:40] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 19:35:40] [INFO ] [Nat]Absence check using 401 positive place invariants in 78 ms returned sat
[2024-05-29 19:35:41] [INFO ] After 1043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 19:35:42] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:35:42] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:35:42] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:35:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 418 ms
[2024-05-29 19:35:42] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:35:42] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:35:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2024-05-29 19:35:43] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:35:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2024-05-29 19:35:43] [INFO ] After 2313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 366 ms.
[2024-05-29 19:35:43] [INFO ] After 3169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (AND (NOT p1) p2)), (X (OR p1 p2)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (AND (NOT p1) p2))), (X (X (OR p1 p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 21 factoid took 458 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 99 reset in 786 ms.
Product exploration explored 100000 steps with 84 reset in 860 ms.
Built C files in :
/tmp/ltsmin9091334266943681953
[2024-05-29 19:35:46] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9091334266943681953
Running compilation step : cd /tmp/ltsmin9091334266943681953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9091334266943681953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9091334266943681953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 3303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Applied a total of 0 rules in 144 ms. Remains 3303 /3303 variables (removed 0) and now considering 3803/3803 (removed 0) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2024-05-29 19:35:49] [INFO ] Computed 401 invariants in 23 ms
[2024-05-29 19:35:51] [INFO ] Implicit Places using invariants in 1139 ms returned []
[2024-05-29 19:35:51] [INFO ] Invariant cache hit.
[2024-05-29 19:35:56] [INFO ] Implicit Places using invariants and state equation in 5643 ms returned []
Implicit Place search using SMT with State Equation took 6783 ms to find 0 implicit places.
[2024-05-29 19:35:56] [INFO ] Invariant cache hit.
[2024-05-29 19:35:59] [INFO ] Dead Transitions using invariants and state equation in 2948 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9880 ms. Remains : 3303/3303 places, 3803/3803 transitions.
Built C files in :
/tmp/ltsmin13477539618727522558
[2024-05-29 19:35:59] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13477539618727522558
Running compilation step : cd /tmp/ltsmin13477539618727522558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13477539618727522558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13477539618727522558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 19:36:03] [INFO ] Flatten gal took : 126 ms
[2024-05-29 19:36:03] [INFO ] Flatten gal took : 129 ms
[2024-05-29 19:36:03] [INFO ] Time to serialize gal into /tmp/LTL16909896406420997431.gal : 32 ms
[2024-05-29 19:36:03] [INFO ] Time to serialize properties into /tmp/LTL13185795693200072544.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16909896406420997431.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5299933591405841310.hoa' '-atoms' '/tmp/LTL13185795693200072544.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13185795693200072544.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5299933591405841310.hoa
Detected timeout of ITS tools.
[2024-05-29 19:36:18] [INFO ] Flatten gal took : 109 ms
[2024-05-29 19:36:18] [INFO ] Flatten gal took : 115 ms
[2024-05-29 19:36:18] [INFO ] Time to serialize gal into /tmp/LTL2217821913466003669.gal : 19 ms
[2024-05-29 19:36:18] [INFO ] Time to serialize properties into /tmp/LTL10149580456208908356.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2217821913466003669.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10149580456208908356.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X("((((p3112==0)||(p3156==0))||((p3181==0)||(p1688==0)))||((p1696==0)||(p1722==0)))"))&&(("(p2157==1)")U(G("(p2124!=1)"))))))
Formula 0 simplified : G(X!"((((p3112==0)||(p3156==0))||((p3181==0)||(p1688==0)))||((p1696==0)||(p1722==0)))" | (!"(p2157==1)" R F!"(p2124!=1)"))
Detected timeout of ITS tools.
[2024-05-29 19:36:33] [INFO ] Flatten gal took : 111 ms
[2024-05-29 19:36:33] [INFO ] Applying decomposition
[2024-05-29 19:36:33] [INFO ] Flatten gal took : 112 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14408258847141395284.txt' '-o' '/tmp/graph14408258847141395284.bin' '-w' '/tmp/graph14408258847141395284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14408258847141395284.bin' '-l' '-1' '-v' '-w' '/tmp/graph14408258847141395284.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:36:34] [INFO ] Decomposing Gal with order
[2024-05-29 19:36:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:36:34] [INFO ] Removed a total of 3591 redundant transitions.
[2024-05-29 19:36:35] [INFO ] Flatten gal took : 268 ms
[2024-05-29 19:36:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 26 ms.
[2024-05-29 19:36:35] [INFO ] Time to serialize gal into /tmp/LTL655990187046066288.gal : 41 ms
[2024-05-29 19:36:35] [INFO ] Time to serialize properties into /tmp/LTL7388765833316254328.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL655990187046066288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7388765833316254328.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((X("((((i23.i1.i3.u973.p3112==0)||(i24.i0.i0.u986.p3156==0))||((i24.i0.i1.u993.p3181==0)||(i12.i1.i3.u533.p1688==0)))||((i12.i1.i...254
Formula 0 simplified : G(X!"((((i23.i1.i3.u973.p3112==0)||(i24.i0.i0.u986.p3156==0))||((i24.i0.i1.u993.p3181==0)||(i12.i1.i3.u533.p1688==0)))||((i12.i1.i3....247
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1465856982294434355
[2024-05-29 19:36:50] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1465856982294434355
Running compilation step : cd /tmp/ltsmin1465856982294434355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1465856982294434355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1465856982294434355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-00 finished in 189662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G((p0 U (p1 U (p2||G(p1)))))))))'
Support contains 5 out of 3315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3302 transition count 3802
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3302 transition count 3802
Applied a total of 26 rules in 297 ms. Remains 3302 /3315 variables (removed 13) and now considering 3802/3815 (removed 13) transitions.
// Phase 1: matrix 3802 rows 3302 cols
[2024-05-29 19:36:53] [INFO ] Computed 401 invariants in 14 ms
[2024-05-29 19:36:54] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2024-05-29 19:36:54] [INFO ] Invariant cache hit.
[2024-05-29 19:36:59] [INFO ] Implicit Places using invariants and state equation in 4926 ms returned []
Implicit Place search using SMT with State Equation took 6069 ms to find 0 implicit places.
[2024-05-29 19:36:59] [INFO ] Invariant cache hit.
[2024-05-29 19:37:02] [INFO ] Dead Transitions using invariants and state equation in 2926 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3302/3315 places, 3802/3815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9294 ms. Remains : 3302/3315 places, 3802/3815 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s2637 1) (EQ s2671 1) (EQ s2693 1)), p2:(AND (EQ s2974 1) (NEQ s2403 1)), p1:(NEQ s2403 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 715 reset in 409 ms.
Product exploration explored 100000 steps with 702 reset in 388 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR p0 p2 p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2) p1)), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p0 p2 p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p2) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 141 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 19:37:04] [INFO ] Invariant cache hit.
[2024-05-29 19:37:05] [INFO ] [Real]Absence check using 401 positive place invariants in 222 ms returned sat
[2024-05-29 19:37:07] [INFO ] After 3077ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-29 19:37:08] [INFO ] [Nat]Absence check using 401 positive place invariants in 259 ms returned sat
[2024-05-29 19:37:11] [INFO ] After 2969ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-29 19:37:13] [INFO ] Deduced a trap composed of 34 places in 1026 ms of which 1 ms to minimize.
[2024-05-29 19:37:14] [INFO ] Deduced a trap composed of 38 places in 1031 ms of which 2 ms to minimize.
[2024-05-29 19:37:15] [INFO ] Deduced a trap composed of 29 places in 994 ms of which 1 ms to minimize.
[2024-05-29 19:37:16] [INFO ] Deduced a trap composed of 37 places in 973 ms of which 3 ms to minimize.
[2024-05-29 19:37:17] [INFO ] Deduced a trap composed of 34 places in 981 ms of which 2 ms to minimize.
[2024-05-29 19:37:18] [INFO ] Deduced a trap composed of 22 places in 968 ms of which 2 ms to minimize.
[2024-05-29 19:37:19] [INFO ] Deduced a trap composed of 35 places in 955 ms of which 2 ms to minimize.
[2024-05-29 19:37:20] [INFO ] Deduced a trap composed of 47 places in 958 ms of which 2 ms to minimize.
[2024-05-29 19:37:22] [INFO ] Deduced a trap composed of 33 places in 980 ms of which 2 ms to minimize.
[2024-05-29 19:37:23] [INFO ] Deduced a trap composed of 28 places in 929 ms of which 2 ms to minimize.
[2024-05-29 19:37:24] [INFO ] Deduced a trap composed of 56 places in 891 ms of which 1 ms to minimize.
[2024-05-29 19:37:25] [INFO ] Deduced a trap composed of 37 places in 868 ms of which 2 ms to minimize.
[2024-05-29 19:37:26] [INFO ] Deduced a trap composed of 22 places in 881 ms of which 2 ms to minimize.
[2024-05-29 19:37:27] [INFO ] Deduced a trap composed of 56 places in 878 ms of which 2 ms to minimize.
[2024-05-29 19:37:28] [INFO ] Deduced a trap composed of 68 places in 870 ms of which 2 ms to minimize.
[2024-05-29 19:37:29] [INFO ] Deduced a trap composed of 43 places in 855 ms of which 1 ms to minimize.
[2024-05-29 19:37:30] [INFO ] Deduced a trap composed of 47 places in 826 ms of which 2 ms to minimize.
[2024-05-29 19:37:31] [INFO ] Deduced a trap composed of 38 places in 753 ms of which 2 ms to minimize.
[2024-05-29 19:37:32] [INFO ] Deduced a trap composed of 38 places in 737 ms of which 2 ms to minimize.
[2024-05-29 19:37:33] [INFO ] Deduced a trap composed of 45 places in 768 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:37:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 19:37:33] [INFO ] After 25583ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 198 ms.
Support contains 5 out of 3302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3302/3302 places, 3802/3802 transitions.
Drop transitions removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 3302 transition count 3403
Reduce places removed 399 places and 0 transitions.
Iterating post reduction 1 with 399 rules applied. Total rules applied 798 place count 2903 transition count 3403
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 798 place count 2903 transition count 2902
Deduced a syphon composed of 501 places in 7 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 1800 place count 2402 transition count 2902
Performed 996 Post agglomeration using F-continuation condition.Transition count delta: 996
Deduced a syphon composed of 996 places in 5 ms
Reduce places removed 996 places and 0 transitions.
Iterating global reduction 2 with 1992 rules applied. Total rules applied 3792 place count 1406 transition count 1906
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 2 with 201 rules applied. Total rules applied 3993 place count 1406 transition count 1906
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3994 place count 1405 transition count 1905
Applied a total of 3994 rules in 480 ms. Remains 1405 /3302 variables (removed 1897) and now considering 1905/3802 (removed 1897) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 1405/3302 places, 1905/3802 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1905 rows 1405 cols
[2024-05-29 19:37:34] [INFO ] Computed 401 invariants in 12 ms
[2024-05-29 19:37:34] [INFO ] [Real]Absence check using 401 positive place invariants in 78 ms returned sat
[2024-05-29 19:37:35] [INFO ] After 1064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:37:35] [INFO ] [Nat]Absence check using 401 positive place invariants in 69 ms returned sat
[2024-05-29 19:37:36] [INFO ] After 726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 347 ms
[2024-05-29 19:37:36] [INFO ] After 1125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-29 19:37:36] [INFO ] After 1462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 1405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1405/1405 places, 1905/1905 transitions.
Applied a total of 0 rules in 51 ms. Remains 1405 /1405 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1405/1405 places, 1905/1905 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 294071 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 294071 steps, saw 291021 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 19:37:40] [INFO ] Invariant cache hit.
[2024-05-29 19:37:40] [INFO ] [Real]Absence check using 401 positive place invariants in 68 ms returned sat
[2024-05-29 19:37:40] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:37:40] [INFO ] [Nat]Absence check using 401 positive place invariants in 70 ms returned sat
[2024-05-29 19:37:41] [INFO ] After 715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:37:41] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:37:41] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:37:41] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:37:41] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:37:42] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:37:42] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:37:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 770 ms
[2024-05-29 19:37:42] [INFO ] After 1533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-29 19:37:42] [INFO ] After 1849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 1405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1405/1405 places, 1905/1905 transitions.
Applied a total of 0 rules in 63 ms. Remains 1405 /1405 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1405/1405 places, 1905/1905 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1405/1405 places, 1905/1905 transitions.
Applied a total of 0 rules in 52 ms. Remains 1405 /1405 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
[2024-05-29 19:37:42] [INFO ] Invariant cache hit.
[2024-05-29 19:37:43] [INFO ] Implicit Places using invariants in 743 ms returned []
[2024-05-29 19:37:43] [INFO ] Invariant cache hit.
[2024-05-29 19:37:45] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2654 ms to find 0 implicit places.
[2024-05-29 19:37:45] [INFO ] Redundant transitions in 159 ms returned []
[2024-05-29 19:37:45] [INFO ] Invariant cache hit.
[2024-05-29 19:37:46] [INFO ] Dead Transitions using invariants and state equation in 926 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3797 ms. Remains : 1405/1405 places, 1905/1905 transitions.
Applied a total of 0 rules in 52 ms. Remains 1405 /1405 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 19:37:46] [INFO ] Invariant cache hit.
[2024-05-29 19:37:46] [INFO ] [Real]Absence check using 401 positive place invariants in 69 ms returned sat
[2024-05-29 19:37:46] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:37:46] [INFO ] [Nat]Absence check using 401 positive place invariants in 68 ms returned sat
[2024-05-29 19:37:47] [INFO ] After 719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:37:47] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:37:47] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:37:47] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:37:47] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:37:48] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:37:48] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:37:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 721 ms
[2024-05-29 19:37:48] [INFO ] After 1488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-29 19:37:48] [INFO ] After 1793ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR p0 p2 p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2) p1)), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p0 p2 p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p2) p1))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p1 p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1 p2)))
Knowledge based reduction with 17 factoid took 257 ms. Reduced automaton from 9 states, 26 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-100B-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-100B-LTLFireability-01 finished in 55172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F((p0&&G(p1))) U p2)||X(F(p3)))))'
Support contains 4 out of 3315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3314 transition count 3414
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2914 transition count 3414
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 800 place count 2914 transition count 2914
Deduced a syphon composed of 500 places in 8 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1800 place count 2414 transition count 2914
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1810 place count 2404 transition count 2904
Iterating global reduction 2 with 10 rules applied. Total rules applied 1820 place count 2404 transition count 2904
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1820 place count 2404 transition count 2902
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1824 place count 2402 transition count 2902
Performed 995 Post agglomeration using F-continuation condition.Transition count delta: 995
Deduced a syphon composed of 995 places in 5 ms
Reduce places removed 995 places and 0 transitions.
Iterating global reduction 2 with 1990 rules applied. Total rules applied 3814 place count 1407 transition count 1907
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3816 place count 1405 transition count 1905
Applied a total of 3816 rules in 658 ms. Remains 1405 /3315 variables (removed 1910) and now considering 1905/3815 (removed 1910) transitions.
// Phase 1: matrix 1905 rows 1405 cols
[2024-05-29 19:37:49] [INFO ] Computed 401 invariants in 9 ms
[2024-05-29 19:37:49] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-05-29 19:37:49] [INFO ] Invariant cache hit.
[2024-05-29 19:37:51] [INFO ] Implicit Places using invariants and state equation in 1769 ms returned []
Implicit Place search using SMT with State Equation took 2441 ms to find 0 implicit places.
[2024-05-29 19:37:52] [INFO ] Redundant transitions in 394 ms returned [1904]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1904 rows 1405 cols
[2024-05-29 19:37:52] [INFO ] Computed 401 invariants in 3 ms
[2024-05-29 19:37:53] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1405/3315 places, 1904/3815 transitions.
Applied a total of 0 rules in 50 ms. Remains 1405 /1405 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4484 ms. Remains : 1405/3315 places, 1904/3815 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s602 1), p0:(EQ s1068 1), p1:(EQ s474 1), p3:(EQ s648 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2827 steps with 3 reset in 23 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-02 finished in 4767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 3315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3302 transition count 3802
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3302 transition count 3802
Applied a total of 26 rules in 324 ms. Remains 3302 /3315 variables (removed 13) and now considering 3802/3815 (removed 13) transitions.
// Phase 1: matrix 3802 rows 3302 cols
[2024-05-29 19:37:53] [INFO ] Computed 401 invariants in 30 ms
[2024-05-29 19:37:55] [INFO ] Implicit Places using invariants in 1396 ms returned []
[2024-05-29 19:37:55] [INFO ] Invariant cache hit.
[2024-05-29 19:38:00] [INFO ] Implicit Places using invariants and state equation in 5229 ms returned []
Implicit Place search using SMT with State Equation took 6630 ms to find 0 implicit places.
[2024-05-29 19:38:00] [INFO ] Invariant cache hit.
[2024-05-29 19:38:03] [INFO ] Dead Transitions using invariants and state equation in 3009 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3302/3315 places, 3802/3815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9967 ms. Remains : 3302/3315 places, 3802/3815 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s2989 1) (EQ s3023 1) (EQ s3045 1)), p0:(EQ s1449 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-03 finished in 10118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X((X(p1) U !p1)) U p2)))'
Support contains 5 out of 3315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3302 transition count 3802
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3302 transition count 3802
Applied a total of 26 rules in 283 ms. Remains 3302 /3315 variables (removed 13) and now considering 3802/3815 (removed 13) transitions.
[2024-05-29 19:38:03] [INFO ] Invariant cache hit.
[2024-05-29 19:38:04] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2024-05-29 19:38:04] [INFO ] Invariant cache hit.
[2024-05-29 19:38:09] [INFO ] Implicit Places using invariants and state equation in 4904 ms returned []
Implicit Place search using SMT with State Equation took 6066 ms to find 0 implicit places.
[2024-05-29 19:38:09] [INFO ] Invariant cache hit.
[2024-05-29 19:38:12] [INFO ] Dead Transitions using invariants and state equation in 2986 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3302/3315 places, 3802/3815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9338 ms. Remains : 3302/3315 places, 3802/3815 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), (OR (NOT p2) p1), (AND (NOT p0) p1), true, (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s545 1), p0:(AND (EQ s2925 1) (EQ s2959 1) (EQ s2981 1)), p1:(NEQ s103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-04 finished in 9551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 4 out of 3315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3314 transition count 3414
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2914 transition count 3414
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 800 place count 2914 transition count 2914
Deduced a syphon composed of 500 places in 7 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1800 place count 2414 transition count 2914
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1813 place count 2401 transition count 2901
Iterating global reduction 2 with 13 rules applied. Total rules applied 1826 place count 2401 transition count 2901
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1826 place count 2401 transition count 2897
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1834 place count 2397 transition count 2897
Performed 992 Post agglomeration using F-continuation condition.Transition count delta: 992
Deduced a syphon composed of 992 places in 6 ms
Reduce places removed 992 places and 0 transitions.
Iterating global reduction 2 with 1984 rules applied. Total rules applied 3818 place count 1405 transition count 1905
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3820 place count 1403 transition count 1903
Applied a total of 3820 rules in 527 ms. Remains 1403 /3315 variables (removed 1912) and now considering 1903/3815 (removed 1912) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-05-29 19:38:13] [INFO ] Computed 401 invariants in 10 ms
[2024-05-29 19:38:14] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-29 19:38:14] [INFO ] Invariant cache hit.
[2024-05-29 19:38:16] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 2478 ms to find 0 implicit places.
[2024-05-29 19:38:16] [INFO ] Redundant transitions in 516 ms returned [1902]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1902 rows 1403 cols
[2024-05-29 19:38:16] [INFO ] Computed 401 invariants in 3 ms
[2024-05-29 19:38:17] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1403/3315 places, 1902/3815 transitions.
Applied a total of 0 rules in 52 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4581 ms. Remains : 1403/3315 places, 1902/3815 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s516 0) (EQ s519 0) (EQ s528 0)), p1:(EQ s238 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 75 reset in 971 ms.
Product exploration explored 100000 steps with 75 reset in 1118 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 19:38:20] [INFO ] Invariant cache hit.
[2024-05-29 19:38:20] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:38:20] [INFO ] [Nat]Absence check using 401 positive place invariants in 77 ms returned sat
[2024-05-29 19:38:21] [INFO ] After 783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:38:21] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:38:21] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:38:21] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:38:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 354 ms
[2024-05-29 19:38:21] [INFO ] After 1187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-29 19:38:21] [INFO ] After 1539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1403 transition count 1902
Applied a total of 200 rules in 106 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Finished probabilistic random walk after 37534 steps, run visited all 1 properties in 465 ms. (steps per millisecond=80 )
Probabilistic random walk after 37534 steps, saw 36473 distinct states, run finished after 466 ms. (steps per millisecond=80 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 48 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-05-29 19:38:23] [INFO ] Invariant cache hit.
[2024-05-29 19:38:23] [INFO ] Implicit Places using invariants in 728 ms returned []
[2024-05-29 19:38:23] [INFO ] Invariant cache hit.
[2024-05-29 19:38:25] [INFO ] Implicit Places using invariants and state equation in 1815 ms returned []
Implicit Place search using SMT with State Equation took 2548 ms to find 0 implicit places.
[2024-05-29 19:38:25] [INFO ] Redundant transitions in 415 ms returned []
[2024-05-29 19:38:25] [INFO ] Invariant cache hit.
[2024-05-29 19:38:26] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4021 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 19:38:27] [INFO ] Invariant cache hit.
[2024-05-29 19:38:27] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:38:27] [INFO ] [Nat]Absence check using 401 positive place invariants in 69 ms returned sat
[2024-05-29 19:38:28] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:38:28] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:38:28] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:38:28] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:38:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 343 ms
[2024-05-29 19:38:28] [INFO ] After 1130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-29 19:38:29] [INFO ] After 1455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1403 transition count 1902
Applied a total of 200 rules in 106 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Finished probabilistic random walk after 37534 steps, run visited all 1 properties in 476 ms. (steps per millisecond=78 )
Probabilistic random walk after 37534 steps, saw 36473 distinct states, run finished after 477 ms. (steps per millisecond=78 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 75 reset in 825 ms.
Product exploration explored 100000 steps with 75 reset in 1013 ms.
Built C files in :
/tmp/ltsmin14197322921160831361
[2024-05-29 19:38:32] [INFO ] Too many transitions (1902) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:38:32] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14197322921160831361
Running compilation step : cd /tmp/ltsmin14197322921160831361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14197322921160831361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14197322921160831361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 57 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-05-29 19:38:35] [INFO ] Invariant cache hit.
[2024-05-29 19:38:35] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-05-29 19:38:35] [INFO ] Invariant cache hit.
[2024-05-29 19:38:37] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 2342 ms to find 0 implicit places.
[2024-05-29 19:38:37] [INFO ] Redundant transitions in 405 ms returned []
[2024-05-29 19:38:37] [INFO ] Invariant cache hit.
[2024-05-29 19:38:38] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3837 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Built C files in :
/tmp/ltsmin7142281782244301622
[2024-05-29 19:38:38] [INFO ] Too many transitions (1902) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:38:38] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7142281782244301622
Running compilation step : cd /tmp/ltsmin7142281782244301622;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7142281782244301622;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7142281782244301622;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 19:38:42] [INFO ] Flatten gal took : 54 ms
[2024-05-29 19:38:42] [INFO ] Flatten gal took : 55 ms
[2024-05-29 19:38:42] [INFO ] Time to serialize gal into /tmp/LTL2638353730483026567.gal : 10 ms
[2024-05-29 19:38:42] [INFO ] Time to serialize properties into /tmp/LTL17212985324946676970.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2638353730483026567.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9097374127108420230.hoa' '-atoms' '/tmp/LTL17212985324946676970.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17212985324946676970.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9097374127108420230.hoa
Detected timeout of ITS tools.
[2024-05-29 19:38:57] [INFO ] Flatten gal took : 54 ms
[2024-05-29 19:38:57] [INFO ] Flatten gal took : 55 ms
[2024-05-29 19:38:57] [INFO ] Time to serialize gal into /tmp/LTL16439889364149253184.gal : 10 ms
[2024-05-29 19:38:57] [INFO ] Time to serialize properties into /tmp/LTL9364692986956526953.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16439889364149253184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9364692986956526953.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p1532==0)||(p1540==0))")||(("(p1566==0)")||(F("(p760==0)")))))))
Formula 0 simplified : G(F(!"((p1532==0)||(p1540==0))" & !"(p1566==0)") & FG!"(p760==0)")
Detected timeout of ITS tools.
[2024-05-29 19:39:12] [INFO ] Flatten gal took : 67 ms
[2024-05-29 19:39:12] [INFO ] Applying decomposition
[2024-05-29 19:39:12] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4501275900895377810.txt' '-o' '/tmp/graph4501275900895377810.bin' '-w' '/tmp/graph4501275900895377810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4501275900895377810.bin' '-l' '-1' '-v' '-w' '/tmp/graph4501275900895377810.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:39:12] [INFO ] Decomposing Gal with order
[2024-05-29 19:39:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:39:12] [INFO ] Removed a total of 2101 redundant transitions.
[2024-05-29 19:39:13] [INFO ] Flatten gal took : 90 ms
[2024-05-29 19:39:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2260 labels/synchronizations in 34 ms.
[2024-05-29 19:39:13] [INFO ] Time to serialize gal into /tmp/LTL3411749705852457451.gal : 13 ms
[2024-05-29 19:39:13] [INFO ] Time to serialize properties into /tmp/LTL12211546230988256747.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3411749705852457451.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12211546230988256747.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i8.i0.i1.u148.p1532==0)||(i8.i0.i1.u149.p1540==0))")||(("(i8.i1.i0.u152.p1566==0)")||(F("(i4.i0.i1.u68.p760==0)")))))))
Formula 0 simplified : G(F(!"((i8.i0.i1.u148.p1532==0)||(i8.i0.i1.u149.p1540==0))" & !"(i8.i1.i0.u152.p1566==0)") & FG!"(i4.i0.i1.u68.p760==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18300490957896049773
[2024-05-29 19:39:28] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18300490957896049773
Running compilation step : cd /tmp/ltsmin18300490957896049773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18300490957896049773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18300490957896049773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-05 finished in 78212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 3315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3314 transition count 3414
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2914 transition count 3414
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 800 place count 2914 transition count 2914
Deduced a syphon composed of 500 places in 7 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1800 place count 2414 transition count 2914
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1813 place count 2401 transition count 2901
Iterating global reduction 2 with 13 rules applied. Total rules applied 1826 place count 2401 transition count 2901
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1826 place count 2401 transition count 2897
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1834 place count 2397 transition count 2897
Performed 993 Post agglomeration using F-continuation condition.Transition count delta: 993
Deduced a syphon composed of 993 places in 5 ms
Reduce places removed 993 places and 0 transitions.
Iterating global reduction 2 with 1986 rules applied. Total rules applied 3820 place count 1404 transition count 1904
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3822 place count 1402 transition count 1902
Applied a total of 3822 rules in 539 ms. Remains 1402 /3315 variables (removed 1913) and now considering 1902/3815 (removed 1913) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-29 19:39:31] [INFO ] Computed 401 invariants in 10 ms
[2024-05-29 19:39:32] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-05-29 19:39:32] [INFO ] Invariant cache hit.
[2024-05-29 19:39:34] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
[2024-05-29 19:39:34] [INFO ] Redundant transitions in 378 ms returned [1901]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-05-29 19:39:34] [INFO ] Computed 401 invariants in 3 ms
[2024-05-29 19:39:35] [INFO ] Dead Transitions using invariants and state equation in 892 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/3315 places, 1901/3815 transitions.
Applied a total of 0 rules in 49 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4144 ms. Remains : 1402/3315 places, 1901/3815 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s496 1) (EQ s498 1) (EQ s502 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1274 steps with 0 reset in 14 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-06 finished in 4221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 3315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3303 transition count 3803
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3303 transition count 3803
Applied a total of 24 rules in 296 ms. Remains 3303 /3315 variables (removed 12) and now considering 3803/3815 (removed 12) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2024-05-29 19:39:35] [INFO ] Computed 401 invariants in 17 ms
[2024-05-29 19:39:36] [INFO ] Implicit Places using invariants in 1130 ms returned []
[2024-05-29 19:39:36] [INFO ] Invariant cache hit.
[2024-05-29 19:39:39] [INFO ] Implicit Places using invariants and state equation in 2580 ms returned []
Implicit Place search using SMT with State Equation took 3712 ms to find 0 implicit places.
[2024-05-29 19:39:39] [INFO ] Invariant cache hit.
[2024-05-29 19:39:42] [INFO ] Dead Transitions using invariants and state equation in 2916 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3315 places, 3803/3815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6926 ms. Remains : 3303/3315 places, 3803/3815 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s2665 0) (EQ s3220 0)), p0:(EQ s2534 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 189 reset in 519 ms.
Product exploration explored 100000 steps with 191 reset in 538 ms.
Computed a total of 800 stabilizing places and 800 stable transitions
Computed a total of 800 stabilizing places and 800 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 19:39:43] [INFO ] Invariant cache hit.
[2024-05-29 19:39:44] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:39:44] [INFO ] [Nat]Absence check using 401 positive place invariants in 226 ms returned sat
[2024-05-29 19:39:47] [INFO ] After 2411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:39:48] [INFO ] Deduced a trap composed of 19 places in 1089 ms of which 2 ms to minimize.
[2024-05-29 19:39:49] [INFO ] Deduced a trap composed of 21 places in 1078 ms of which 2 ms to minimize.
[2024-05-29 19:39:50] [INFO ] Deduced a trap composed of 24 places in 1081 ms of which 2 ms to minimize.
[2024-05-29 19:39:52] [INFO ] Deduced a trap composed of 50 places in 1055 ms of which 2 ms to minimize.
[2024-05-29 19:39:53] [INFO ] Deduced a trap composed of 34 places in 1072 ms of which 2 ms to minimize.
[2024-05-29 19:39:54] [INFO ] Deduced a trap composed of 27 places in 1087 ms of which 1 ms to minimize.
[2024-05-29 19:39:55] [INFO ] Deduced a trap composed of 31 places in 1068 ms of which 3 ms to minimize.
[2024-05-29 19:39:56] [INFO ] Deduced a trap composed of 39 places in 1072 ms of which 1 ms to minimize.
[2024-05-29 19:39:58] [INFO ] Deduced a trap composed of 32 places in 1037 ms of which 2 ms to minimize.
[2024-05-29 19:39:59] [INFO ] Deduced a trap composed of 32 places in 1063 ms of which 2 ms to minimize.
[2024-05-29 19:40:00] [INFO ] Deduced a trap composed of 39 places in 1072 ms of which 2 ms to minimize.
[2024-05-29 19:40:01] [INFO ] Deduced a trap composed of 35 places in 1066 ms of which 1 ms to minimize.
[2024-05-29 19:40:02] [INFO ] Deduced a trap composed of 84 places in 1106 ms of which 1 ms to minimize.
[2024-05-29 19:40:04] [INFO ] Deduced a trap composed of 62 places in 1052 ms of which 2 ms to minimize.
[2024-05-29 19:40:05] [INFO ] Deduced a trap composed of 80 places in 1018 ms of which 2 ms to minimize.
[2024-05-29 19:40:06] [INFO ] Deduced a trap composed of 49 places in 1096 ms of which 2 ms to minimize.
[2024-05-29 19:40:07] [INFO ] Deduced a trap composed of 54 places in 1087 ms of which 2 ms to minimize.
[2024-05-29 19:40:08] [INFO ] Deduced a trap composed of 52 places in 1070 ms of which 1 ms to minimize.
[2024-05-29 19:40:10] [INFO ] Deduced a trap composed of 62 places in 1087 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:40:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 19:40:10] [INFO ] After 25687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Finished Parikh walk after 323 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=80 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 3 out of 3303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 3302 transition count 3403
Reduce places removed 399 places and 0 transitions.
Iterating post reduction 1 with 399 rules applied. Total rules applied 798 place count 2903 transition count 3403
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 798 place count 2903 transition count 2904
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1796 place count 2404 transition count 2904
Performed 996 Post agglomeration using F-continuation condition.Transition count delta: 996
Deduced a syphon composed of 996 places in 5 ms
Reduce places removed 996 places and 0 transitions.
Iterating global reduction 2 with 1992 rules applied. Total rules applied 3788 place count 1408 transition count 1908
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3790 place count 1406 transition count 1906
Applied a total of 3790 rules in 394 ms. Remains 1406 /3303 variables (removed 1897) and now considering 1906/3803 (removed 1897) transitions.
// Phase 1: matrix 1906 rows 1406 cols
[2024-05-29 19:40:10] [INFO ] Computed 401 invariants in 6 ms
[2024-05-29 19:40:11] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-05-29 19:40:11] [INFO ] Invariant cache hit.
[2024-05-29 19:40:13] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
[2024-05-29 19:40:13] [INFO ] Redundant transitions in 361 ms returned [1905]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1905 rows 1406 cols
[2024-05-29 19:40:13] [INFO ] Computed 401 invariants in 3 ms
[2024-05-29 19:40:14] [INFO ] Dead Transitions using invariants and state equation in 906 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1406/3303 places, 1905/3803 transitions.
Applied a total of 0 rules in 52 ms. Remains 1406 /1406 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4036 ms. Remains : 1406/3303 places, 1905/3803 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 412 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :3
Finished Best-First random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 450 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 22544 reset in 1293 ms.
Product exploration explored 100000 steps with 22611 reset in 1469 ms.
Built C files in :
/tmp/ltsmin1270083855074983951
[2024-05-29 19:40:18] [INFO ] Too many transitions (1905) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:40:18] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1270083855074983951
Running compilation step : cd /tmp/ltsmin1270083855074983951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1270083855074983951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1270083855074983951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1406 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1406/1406 places, 1905/1905 transitions.
Applied a total of 0 rules in 50 ms. Remains 1406 /1406 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
[2024-05-29 19:40:22] [INFO ] Invariant cache hit.
[2024-05-29 19:40:22] [INFO ] Implicit Places using invariants in 640 ms returned []
[2024-05-29 19:40:22] [INFO ] Invariant cache hit.
[2024-05-29 19:40:24] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
[2024-05-29 19:40:24] [INFO ] Redundant transitions in 373 ms returned []
[2024-05-29 19:40:24] [INFO ] Invariant cache hit.
[2024-05-29 19:40:25] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3711 ms. Remains : 1406/1406 places, 1905/1905 transitions.
Built C files in :
/tmp/ltsmin3293296311327264130
[2024-05-29 19:40:25] [INFO ] Too many transitions (1905) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:40:25] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3293296311327264130
Running compilation step : cd /tmp/ltsmin3293296311327264130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3293296311327264130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3293296311327264130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 19:40:28] [INFO ] Flatten gal took : 61 ms
[2024-05-29 19:40:28] [INFO ] Flatten gal took : 62 ms
[2024-05-29 19:40:28] [INFO ] Time to serialize gal into /tmp/LTL4006169561480799638.gal : 10 ms
[2024-05-29 19:40:28] [INFO ] Time to serialize properties into /tmp/LTL7457216938215584593.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4006169561480799638.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14095819945784468804.hoa' '-atoms' '/tmp/LTL7457216938215584593.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7457216938215584593.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14095819945784468804.hoa
Detected timeout of ITS tools.
[2024-05-29 19:40:44] [INFO ] Flatten gal took : 59 ms
[2024-05-29 19:40:44] [INFO ] Flatten gal took : 61 ms
[2024-05-29 19:40:44] [INFO ] Time to serialize gal into /tmp/LTL2814175392489264815.gal : 10 ms
[2024-05-29 19:40:44] [INFO ] Time to serialize properties into /tmp/LTL11376867712074603692.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2814175392489264815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11376867712074603692.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p3065==1)")||(G("((p3225==0)&&(p3901==0))"))))))
Formula 0 simplified : XG(!"(p3065==1)" & F!"((p3225==0)&&(p3901==0))")
Detected timeout of ITS tools.
[2024-05-29 19:40:59] [INFO ] Flatten gal took : 69 ms
[2024-05-29 19:40:59] [INFO ] Applying decomposition
[2024-05-29 19:40:59] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14572227132637132219.txt' '-o' '/tmp/graph14572227132637132219.bin' '-w' '/tmp/graph14572227132637132219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14572227132637132219.bin' '-l' '-1' '-v' '-w' '/tmp/graph14572227132637132219.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:40:59] [INFO ] Decomposing Gal with order
[2024-05-29 19:40:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:40:59] [INFO ] Removed a total of 2098 redundant transitions.
[2024-05-29 19:40:59] [INFO ] Flatten gal took : 84 ms
[2024-05-29 19:40:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2222 labels/synchronizations in 22 ms.
[2024-05-29 19:40:59] [INFO ] Time to serialize gal into /tmp/LTL4194868937010703435.gal : 11 ms
[2024-05-29 19:40:59] [INFO ] Time to serialize properties into /tmp/LTL4909939238294653284.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4194868937010703435.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4909939238294653284.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i17.u304.p3065==1)")||(G("((i18.i0.i1.u322.p3225==0)&&(i22.u392.p3901==0))"))))))
Formula 0 simplified : XG(!"(i17.u304.p3065==1)" & F!"((i18.i0.i1.u322.p3225==0)&&(i22.u392.p3901==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12733538788982551257
[2024-05-29 19:41:14] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12733538788982551257
Running compilation step : cd /tmp/ltsmin12733538788982551257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12733538788982551257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12733538788982551257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-07 finished in 102427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 3315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3314 transition count 3414
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2914 transition count 3414
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 800 place count 2914 transition count 2914
Deduced a syphon composed of 500 places in 7 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1800 place count 2414 transition count 2914
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1811 place count 2403 transition count 2903
Iterating global reduction 2 with 11 rules applied. Total rules applied 1822 place count 2403 transition count 2903
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1822 place count 2403 transition count 2900
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1828 place count 2400 transition count 2900
Performed 994 Post agglomeration using F-continuation condition.Transition count delta: 994
Deduced a syphon composed of 994 places in 5 ms
Reduce places removed 994 places and 0 transitions.
Iterating global reduction 2 with 1988 rules applied. Total rules applied 3816 place count 1406 transition count 1906
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3818 place count 1404 transition count 1904
Applied a total of 3818 rules in 516 ms. Remains 1404 /3315 variables (removed 1911) and now considering 1904/3815 (removed 1911) transitions.
// Phase 1: matrix 1904 rows 1404 cols
[2024-05-29 19:41:18] [INFO ] Computed 401 invariants in 3 ms
[2024-05-29 19:41:19] [INFO ] Implicit Places using invariants in 636 ms returned []
[2024-05-29 19:41:19] [INFO ] Invariant cache hit.
[2024-05-29 19:41:20] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 2270 ms to find 0 implicit places.
[2024-05-29 19:41:21] [INFO ] Redundant transitions in 385 ms returned [1903]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1903 rows 1404 cols
[2024-05-29 19:41:21] [INFO ] Computed 401 invariants in 3 ms
[2024-05-29 19:41:21] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1404/3315 places, 1903/3815 transitions.
Applied a total of 0 rules in 49 ms. Remains 1404 /1404 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4162 ms. Remains : 1404/3315 places, 1903/3815 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s189 1), p0:(EQ s829 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1300 steps with 0 reset in 14 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-08 finished in 4243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 3315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3314 transition count 3414
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2914 transition count 3414
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 800 place count 2914 transition count 2914
Deduced a syphon composed of 500 places in 8 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1800 place count 2414 transition count 2914
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1813 place count 2401 transition count 2901
Iterating global reduction 2 with 13 rules applied. Total rules applied 1826 place count 2401 transition count 2901
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1826 place count 2401 transition count 2897
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1834 place count 2397 transition count 2897
Performed 992 Post agglomeration using F-continuation condition.Transition count delta: 992
Deduced a syphon composed of 992 places in 5 ms
Reduce places removed 992 places and 0 transitions.
Iterating global reduction 2 with 1984 rules applied. Total rules applied 3818 place count 1405 transition count 1905
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3820 place count 1403 transition count 1903
Applied a total of 3820 rules in 488 ms. Remains 1403 /3315 variables (removed 1912) and now considering 1903/3815 (removed 1912) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-05-29 19:41:22] [INFO ] Computed 401 invariants in 7 ms
[2024-05-29 19:41:23] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-29 19:41:23] [INFO ] Invariant cache hit.
[2024-05-29 19:41:24] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2363 ms to find 0 implicit places.
[2024-05-29 19:41:25] [INFO ] Redundant transitions in 400 ms returned [1902]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1902 rows 1403 cols
[2024-05-29 19:41:25] [INFO ] Computed 401 invariants in 3 ms
[2024-05-29 19:41:26] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1403/3315 places, 1902/3815 transitions.
Applied a total of 0 rules in 49 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4220 ms. Remains : 1403/3315 places, 1902/3815 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-09 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:(EQ s1081 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]]
Stuttering criterion allowed to conclude after 1320 steps with 2 reset in 14 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-09 finished in 4317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3303 transition count 3803
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3303 transition count 3803
Applied a total of 24 rules in 281 ms. Remains 3303 /3315 variables (removed 12) and now considering 3803/3815 (removed 12) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2024-05-29 19:41:26] [INFO ] Computed 401 invariants in 24 ms
[2024-05-29 19:41:27] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2024-05-29 19:41:27] [INFO ] Invariant cache hit.
[2024-05-29 19:41:32] [INFO ] Implicit Places using invariants and state equation in 4409 ms returned []
Implicit Place search using SMT with State Equation took 5564 ms to find 0 implicit places.
[2024-05-29 19:41:32] [INFO ] Invariant cache hit.
[2024-05-29 19:41:35] [INFO ] Dead Transitions using invariants and state equation in 3043 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3315 places, 3803/3815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8889 ms. Remains : 3303/3315 places, 3803/3815 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2777 1) (EQ s711 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 55 reset in 638 ms.
Product exploration explored 100000 steps with 54 reset in 717 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1771 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-29 19:41:37] [INFO ] Invariant cache hit.
[2024-05-29 19:41:40] [INFO ] [Real]Absence check using 401 positive place invariants in 1104 ms returned sat
[2024-05-29 19:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 19:41:52] [INFO ] [Real]Absence check using state equation in 11676 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3302 transition count 3402
Reduce places removed 400 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 401 rules applied. Total rules applied 801 place count 2902 transition count 3401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 802 place count 2901 transition count 3401
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 802 place count 2901 transition count 2901
Deduced a syphon composed of 500 places in 8 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 1802 place count 2401 transition count 2901
Performed 995 Post agglomeration using F-continuation condition.Transition count delta: 995
Deduced a syphon composed of 995 places in 5 ms
Reduce places removed 995 places and 0 transitions.
Iterating global reduction 3 with 1990 rules applied. Total rules applied 3792 place count 1406 transition count 1906
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3794 place count 1404 transition count 1904
Applied a total of 3794 rules in 420 ms. Remains 1404 /3303 variables (removed 1899) and now considering 1904/3803 (removed 1899) transitions.
// Phase 1: matrix 1904 rows 1404 cols
[2024-05-29 19:41:52] [INFO ] Computed 401 invariants in 7 ms
[2024-05-29 19:41:53] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-29 19:41:53] [INFO ] Invariant cache hit.
[2024-05-29 19:41:54] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2182 ms to find 0 implicit places.
[2024-05-29 19:41:55] [INFO ] Redundant transitions in 386 ms returned [1903]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1903 rows 1404 cols
[2024-05-29 19:41:55] [INFO ] Computed 401 invariants in 4 ms
[2024-05-29 19:41:56] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1404/3303 places, 1903/3803 transitions.
Applied a total of 0 rules in 55 ms. Remains 1404 /1404 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3993 ms. Remains : 1404/3303 places, 1903/3803 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2024-05-29 19:41:56] [INFO ] Invariant cache hit.
[2024-05-29 19:41:58] [INFO ] [Real]Absence check using 401 positive place invariants in 314 ms returned sat
[2024-05-29 19:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 19:42:03] [INFO ] [Real]Absence check using state equation in 5128 ms returned sat
[2024-05-29 19:42:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:42:05] [INFO ] [Nat]Absence check using 401 positive place invariants in 219 ms returned sat
[2024-05-29 19:42:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 19:42:07] [INFO ] [Nat]Absence check using state equation in 2671 ms returned sat
[2024-05-29 19:42:07] [INFO ] Computed and/alt/rep : 1548/6607/1548 causal constraints (skipped 353 transitions) in 119 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2024-05-29 19:42:19] [INFO ] Deduced a trap composed of 2 places in 980 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:42:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27161 reset in 1807 ms.
Product exploration explored 100000 steps with 27113 reset in 1940 ms.
Built C files in :
/tmp/ltsmin9476676016299278593
[2024-05-29 19:42:23] [INFO ] Too many transitions (1903) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:42:23] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9476676016299278593
Running compilation step : cd /tmp/ltsmin9476676016299278593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9476676016299278593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9476676016299278593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1404/1404 places, 1903/1903 transitions.
Applied a total of 0 rules in 52 ms. Remains 1404 /1404 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-05-29 19:42:26] [INFO ] Invariant cache hit.
[2024-05-29 19:42:27] [INFO ] Implicit Places using invariants in 673 ms returned []
[2024-05-29 19:42:27] [INFO ] Invariant cache hit.
[2024-05-29 19:42:28] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2414 ms to find 0 implicit places.
[2024-05-29 19:42:29] [INFO ] Redundant transitions in 387 ms returned []
[2024-05-29 19:42:29] [INFO ] Invariant cache hit.
[2024-05-29 19:42:30] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3782 ms. Remains : 1404/1404 places, 1903/1903 transitions.
Built C files in :
/tmp/ltsmin7873419583720351978
[2024-05-29 19:42:30] [INFO ] Too many transitions (1903) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:42:30] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7873419583720351978
Running compilation step : cd /tmp/ltsmin7873419583720351978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7873419583720351978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7873419583720351978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 19:42:33] [INFO ] Flatten gal took : 63 ms
[2024-05-29 19:42:33] [INFO ] Flatten gal took : 55 ms
[2024-05-29 19:42:33] [INFO ] Time to serialize gal into /tmp/LTL11793436022720106527.gal : 10 ms
[2024-05-29 19:42:33] [INFO ] Time to serialize properties into /tmp/LTL17270500282485145201.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11793436022720106527.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10108167886741005788.hoa' '-atoms' '/tmp/LTL17270500282485145201.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17270500282485145201.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10108167886741005788.hoa
Detected timeout of ITS tools.
[2024-05-29 19:42:48] [INFO ] Flatten gal took : 50 ms
[2024-05-29 19:42:48] [INFO ] Flatten gal took : 50 ms
[2024-05-29 19:42:48] [INFO ] Time to serialize gal into /tmp/LTL8436695670294676803.gal : 9 ms
[2024-05-29 19:42:48] [INFO ] Time to serialize properties into /tmp/LTL16511380039654935994.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8436695670294676803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16511380039654935994.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("((p3361==1)||(p844==1))"))))
Formula 0 simplified : XG!"((p3361==1)||(p844==1))"
Detected timeout of ITS tools.
[2024-05-29 19:43:03] [INFO ] Flatten gal took : 54 ms
[2024-05-29 19:43:03] [INFO ] Applying decomposition
[2024-05-29 19:43:03] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12715001010265504220.txt' '-o' '/tmp/graph12715001010265504220.bin' '-w' '/tmp/graph12715001010265504220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12715001010265504220.bin' '-l' '-1' '-v' '-w' '/tmp/graph12715001010265504220.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:43:03] [INFO ] Decomposing Gal with order
[2024-05-29 19:43:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:43:04] [INFO ] Removed a total of 2095 redundant transitions.
[2024-05-29 19:43:04] [INFO ] Flatten gal took : 89 ms
[2024-05-29 19:43:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2292 labels/synchronizations in 30 ms.
[2024-05-29 19:43:04] [INFO ] Time to serialize gal into /tmp/LTL17663368905409902278.gal : 12 ms
[2024-05-29 19:43:04] [INFO ] Time to serialize properties into /tmp/LTL16006306140182550934.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17663368905409902278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16006306140182550934.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F("((i17.i1.i1.u335.p3361==1)||(i3.i0.i1.u78.p844==1))"))))
Formula 0 simplified : XG!"((i17.i1.i1.u335.p3361==1)||(i3.i0.i1.u78.p844==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2325747069561279447
[2024-05-29 19:43:19] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2325747069561279447
Running compilation step : cd /tmp/ltsmin2325747069561279447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2325747069561279447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2325747069561279447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-10 finished in 115828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 4 out of 3315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3302 transition count 3802
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3302 transition count 3802
Applied a total of 26 rules in 301 ms. Remains 3302 /3315 variables (removed 13) and now considering 3802/3815 (removed 13) transitions.
// Phase 1: matrix 3802 rows 3302 cols
[2024-05-29 19:43:22] [INFO ] Computed 401 invariants in 18 ms
[2024-05-29 19:43:23] [INFO ] Implicit Places using invariants in 1142 ms returned []
[2024-05-29 19:43:23] [INFO ] Invariant cache hit.
[2024-05-29 19:43:28] [INFO ] Implicit Places using invariants and state equation in 5100 ms returned []
Implicit Place search using SMT with State Equation took 6242 ms to find 0 implicit places.
[2024-05-29 19:43:28] [INFO ] Invariant cache hit.
[2024-05-29 19:43:31] [INFO ] Dead Transitions using invariants and state equation in 3077 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3302/3315 places, 3802/3815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9620 ms. Remains : 3302/3315 places, 3802/3815 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (EQ s688 0) (EQ s692 0) (EQ s700 0)), p0:(EQ s3235 0)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1896 ms.
Product exploration explored 100000 steps with 33333 reset in 1882 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-100B-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-100B-LTLFireability-11 finished in 13647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||((p1 U (p2||G(p1))) U p3)))))'
Support contains 2 out of 3315 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 : 3315/3315 places, 3815/3815 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3314 transition count 3414
Reduce places removed 400 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 401 rules applied. Total rules applied 801 place count 2914 transition count 3413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 802 place count 2913 transition count 3413
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 802 place count 2913 transition count 2914
Deduced a syphon composed of 499 places in 7 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 1800 place count 2414 transition count 2914
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1810 place count 2404 transition count 2904
Iterating global reduction 3 with 10 rules applied. Total rules applied 1820 place count 2404 transition count 2904
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1820 place count 2404 transition count 2900
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1828 place count 2400 transition count 2900
Performed 991 Post agglomeration using F-continuation condition.Transition count delta: 991
Deduced a syphon composed of 991 places in 7 ms
Reduce places removed 991 places and 0 transitions.
Iterating global reduction 3 with 1982 rules applied. Total rules applied 3810 place count 1409 transition count 1909
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3812 place count 1407 transition count 1907
Applied a total of 3812 rules in 503 ms. Remains 1407 /3315 variables (removed 1908) and now considering 1907/3815 (removed 1908) transitions.
// Phase 1: matrix 1907 rows 1407 cols
[2024-05-29 19:43:36] [INFO ] Computed 401 invariants in 7 ms
[2024-05-29 19:43:37] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-29 19:43:37] [INFO ] Invariant cache hit.
[2024-05-29 19:43:38] [INFO ] Implicit Places using invariants and state equation in 1781 ms returned []
Implicit Place search using SMT with State Equation took 2451 ms to find 0 implicit places.
[2024-05-29 19:43:39] [INFO ] Redundant transitions in 373 ms returned [1906]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1906 rows 1407 cols
[2024-05-29 19:43:39] [INFO ] Computed 401 invariants in 3 ms
[2024-05-29 19:43:40] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1407/3315 places, 1906/3815 transitions.
Applied a total of 0 rules in 50 ms. Remains 1407 /1407 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4345 ms. Remains : 1407/3315 places, 1906/3815 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(EQ s177 1), p0:(EQ s67 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 76 reset in 813 ms.
Product exploration explored 100000 steps with 76 reset in 1001 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1407 stabilizing places and 4/1906 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Finished random walk after 1236 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=88 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p3) p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 2 out of 1407 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 : 1407/1407 places, 1906/1906 transitions.
Applied a total of 0 rules in 56 ms. Remains 1407 /1407 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
[2024-05-29 19:43:42] [INFO ] Invariant cache hit.
[2024-05-29 19:43:43] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-05-29 19:43:43] [INFO ] Invariant cache hit.
[2024-05-29 19:43:45] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 2405 ms to find 0 implicit places.
[2024-05-29 19:43:45] [INFO ] Redundant transitions in 384 ms returned []
[2024-05-29 19:43:45] [INFO ] Invariant cache hit.
[2024-05-29 19:43:46] [INFO ] Dead Transitions using invariants and state equation in 937 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3789 ms. Remains : 1407/1407 places, 1906/1906 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1407 stabilizing places and 4/1906 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Finished random walk after 1250 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 76 reset in 811 ms.
Product exploration explored 100000 steps with 76 reset in 1004 ms.
Built C files in :
/tmp/ltsmin17700050763515932268
[2024-05-29 19:43:48] [INFO ] Too many transitions (1906) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:43:48] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17700050763515932268
Running compilation step : cd /tmp/ltsmin17700050763515932268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17700050763515932268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17700050763515932268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1407/1407 places, 1906/1906 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1405 transition count 1904
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1404 transition count 1903
Applied a total of 3 rules in 134 ms. Remains 1404 /1407 variables (removed 3) and now considering 1903/1906 (removed 3) transitions.
// Phase 1: matrix 1903 rows 1404 cols
[2024-05-29 19:43:51] [INFO ] Computed 401 invariants in 10 ms
[2024-05-29 19:43:52] [INFO ] Implicit Places using invariants in 642 ms returned []
[2024-05-29 19:43:52] [INFO ] Invariant cache hit.
[2024-05-29 19:43:54] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 2296 ms to find 0 implicit places.
[2024-05-29 19:43:54] [INFO ] Redundant transitions in 376 ms returned []
[2024-05-29 19:43:54] [INFO ] Invariant cache hit.
[2024-05-29 19:43:55] [INFO ] Dead Transitions using invariants and state equation in 926 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1404/1407 places, 1903/1906 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3739 ms. Remains : 1404/1407 places, 1903/1906 transitions.
Built C files in :
/tmp/ltsmin3837682868544677929
[2024-05-29 19:43:55] [INFO ] Too many transitions (1903) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:43:55] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3837682868544677929
Running compilation step : cd /tmp/ltsmin3837682868544677929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3837682868544677929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3837682868544677929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 19:43:58] [INFO ] Flatten gal took : 51 ms
[2024-05-29 19:43:58] [INFO ] Flatten gal took : 56 ms
[2024-05-29 19:43:58] [INFO ] Time to serialize gal into /tmp/LTL6317533830795225011.gal : 9 ms
[2024-05-29 19:43:58] [INFO ] Time to serialize properties into /tmp/LTL13118290586990457096.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6317533830795225011.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7012043010130019578.hoa' '-atoms' '/tmp/LTL13118290586990457096.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13118290586990457096.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7012043010130019578.hoa
Detected timeout of ITS tools.
[2024-05-29 19:44:13] [INFO ] Flatten gal took : 56 ms
[2024-05-29 19:44:14] [INFO ] Flatten gal took : 55 ms
[2024-05-29 19:44:14] [INFO ] Time to serialize gal into /tmp/LTL3079176193398303852.gal : 9 ms
[2024-05-29 19:44:14] [INFO ] Time to serialize properties into /tmp/LTL16578644203793620600.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3079176193398303852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16578644203793620600.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p280==0)")||((("(p3920!=1)")U(("((p1702!=1)&&(p3920!=1))")||(G("(p3920!=1)"))))U("(p585==1)"))))))
Formula 0 simplified : FG(!"(p280==0)" & ((!"(p3920!=1)" M !"((p1702!=1)&&(p3920!=1))") R !"(p585==1)"))
Detected timeout of ITS tools.
[2024-05-29 19:44:29] [INFO ] Flatten gal took : 54 ms
[2024-05-29 19:44:29] [INFO ] Applying decomposition
[2024-05-29 19:44:29] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16391818316288140334.txt' '-o' '/tmp/graph16391818316288140334.bin' '-w' '/tmp/graph16391818316288140334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16391818316288140334.bin' '-l' '-1' '-v' '-w' '/tmp/graph16391818316288140334.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:44:29] [INFO ] Decomposing Gal with order
[2024-05-29 19:44:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:44:29] [INFO ] Removed a total of 2095 redundant transitions.
[2024-05-29 19:44:29] [INFO ] Flatten gal took : 99 ms
[2024-05-29 19:44:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2340 labels/synchronizations in 39 ms.
[2024-05-29 19:44:29] [INFO ] Time to serialize gal into /tmp/LTL16878295937896741838.gal : 10 ms
[2024-05-29 19:44:29] [INFO ] Time to serialize properties into /tmp/LTL2102770443128111219.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16878295937896741838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2102770443128111219.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i1.i0.i1.u19.p280==0)")||((("(i20.i0.i1.u392.p3920!=1)")U(("((i8.i1.i1.u166.p1702!=1)&&(i20.i0.i1.u392.p3920!=1))")||(G("(i2...214
Formula 0 simplified : FG(!"(i1.i0.i1.u19.p280==0)" & ((!"(i20.i0.i1.u392.p3920!=1)" M !"((i8.i1.i1.u166.p1702!=1)&&(i20.i0.i1.u392.p3920!=1))") R !"(i2.i1...174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10247856845616909463
[2024-05-29 19:44:44] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10247856845616909463
Running compilation step : cd /tmp/ltsmin10247856845616909463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10247856845616909463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10247856845616909463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-13 finished in 71796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 3315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3314 transition count 3414
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2914 transition count 3414
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 800 place count 2914 transition count 2914
Deduced a syphon composed of 500 places in 8 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1800 place count 2414 transition count 2914
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1812 place count 2402 transition count 2902
Iterating global reduction 2 with 12 rules applied. Total rules applied 1824 place count 2402 transition count 2902
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1824 place count 2402 transition count 2899
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1830 place count 2399 transition count 2899
Performed 994 Post agglomeration using F-continuation condition.Transition count delta: 994
Deduced a syphon composed of 994 places in 5 ms
Reduce places removed 994 places and 0 transitions.
Iterating global reduction 2 with 1988 rules applied. Total rules applied 3818 place count 1405 transition count 1905
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3820 place count 1403 transition count 1903
Applied a total of 3820 rules in 517 ms. Remains 1403 /3315 variables (removed 1912) and now considering 1903/3815 (removed 1912) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-05-29 19:44:48] [INFO ] Computed 401 invariants in 6 ms
[2024-05-29 19:44:48] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-05-29 19:44:48] [INFO ] Invariant cache hit.
[2024-05-29 19:44:50] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 2368 ms to find 0 implicit places.
[2024-05-29 19:44:50] [INFO ] Redundant transitions in 405 ms returned [1902]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1902 rows 1403 cols
[2024-05-29 19:44:50] [INFO ] Computed 401 invariants in 5 ms
[2024-05-29 19:44:51] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1403/3315 places, 1902/3815 transitions.
Applied a total of 0 rules in 49 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4261 ms. Remains : 1403/3315 places, 1902/3815 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s448 0) (EQ s1105 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 76 reset in 821 ms.
Product exploration explored 100000 steps with 75 reset in 996 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 71 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 37 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 233269 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233269 steps, saw 226181 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 19:44:57] [INFO ] Invariant cache hit.
[2024-05-29 19:44:57] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:44:57] [INFO ] [Nat]Absence check using 401 positive place invariants in 75 ms returned sat
[2024-05-29 19:44:58] [INFO ] After 741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:44:58] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:44:58] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:44:58] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2024-05-29 19:44:58] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:44:59] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:44:59] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:44:59] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:44:59] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:44:59] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:44:59] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:44:59] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:44:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1476 ms
[2024-05-29 19:44:59] [INFO ] After 2260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-29 19:44:59] [INFO ] After 2585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1403 transition count 1902
Applied a total of 201 rules in 105 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 262062 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262062 steps, saw 259362 distinct states, run finished after 3002 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1902 rows 1403 cols
[2024-05-29 19:45:03] [INFO ] Computed 401 invariants in 9 ms
[2024-05-29 19:45:03] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:45:03] [INFO ] [Nat]Absence check using 401 positive place invariants in 76 ms returned sat
[2024-05-29 19:45:04] [INFO ] After 791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:45:04] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:45:04] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1176 ms
[2024-05-29 19:45:05] [INFO ] After 2041ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-29 19:45:05] [INFO ] After 2392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 60 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 59 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-05-29 19:45:06] [INFO ] Invariant cache hit.
[2024-05-29 19:45:06] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-05-29 19:45:06] [INFO ] Invariant cache hit.
[2024-05-29 19:45:08] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 2896 ms to find 0 implicit places.
[2024-05-29 19:45:09] [INFO ] Redundant transitions in 175 ms returned []
[2024-05-29 19:45:09] [INFO ] Invariant cache hit.
[2024-05-29 19:45:10] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4118 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 58 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 19:45:10] [INFO ] Invariant cache hit.
[2024-05-29 19:45:10] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:45:10] [INFO ] [Nat]Absence check using 401 positive place invariants in 73 ms returned sat
[2024-05-29 19:45:11] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:45:11] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:45:11] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:45:11] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:45:11] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:45:11] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:45:12] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:45:12] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:45:12] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:45:12] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:45:12] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:45:12] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:45:12] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:45:12] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1308 ms
[2024-05-29 19:45:12] [INFO ] After 2102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-29 19:45:12] [INFO ] After 2437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 62 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
// Phase 1: matrix 1902 rows 1403 cols
[2024-05-29 19:45:13] [INFO ] Computed 401 invariants in 11 ms
[2024-05-29 19:45:13] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-05-29 19:45:13] [INFO ] Invariant cache hit.
[2024-05-29 19:45:15] [INFO ] Implicit Places using invariants and state equation in 1790 ms returned []
Implicit Place search using SMT with State Equation took 2542 ms to find 0 implicit places.
[2024-05-29 19:45:15] [INFO ] Redundant transitions in 396 ms returned []
[2024-05-29 19:45:15] [INFO ] Invariant cache hit.
[2024-05-29 19:45:17] [INFO ] Dead Transitions using invariants and state equation in 1086 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4094 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 224986 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224986 steps, saw 218059 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 19:45:20] [INFO ] Invariant cache hit.
[2024-05-29 19:45:20] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:45:20] [INFO ] [Nat]Absence check using 401 positive place invariants in 74 ms returned sat
[2024-05-29 19:45:21] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:45:21] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-29 19:45:21] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:45:22] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 3 ms to minimize.
[2024-05-29 19:45:22] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:45:22] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:45:22] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:45:22] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:45:22] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:45:22] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 19:45:22] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:45:23] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:45:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1494 ms
[2024-05-29 19:45:23] [INFO ] After 2290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-29 19:45:23] [INFO ] After 2616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1403 transition count 1902
Applied a total of 201 rules in 105 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 291034 steps, run timeout after 3002 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 291034 steps, saw 288073 distinct states, run finished after 3002 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1902 rows 1403 cols
[2024-05-29 19:45:26] [INFO ] Computed 401 invariants in 11 ms
[2024-05-29 19:45:26] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:45:26] [INFO ] [Nat]Absence check using 401 positive place invariants in 79 ms returned sat
[2024-05-29 19:45:27] [INFO ] After 796ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1127 ms
[2024-05-29 19:45:28] [INFO ] After 1966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-29 19:45:29] [INFO ] After 2333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 64 ms.
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 53 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 52 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-05-29 19:45:29] [INFO ] Invariant cache hit.
[2024-05-29 19:45:30] [INFO ] Implicit Places using invariants in 802 ms returned []
[2024-05-29 19:45:30] [INFO ] Invariant cache hit.
[2024-05-29 19:45:31] [INFO ] Implicit Places using invariants and state equation in 1968 ms returned []
Implicit Place search using SMT with State Equation took 2772 ms to find 0 implicit places.
[2024-05-29 19:45:32] [INFO ] Redundant transitions in 186 ms returned []
[2024-05-29 19:45:32] [INFO ] Invariant cache hit.
[2024-05-29 19:45:33] [INFO ] Dead Transitions using invariants and state equation in 960 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3975 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 60 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 19:45:33] [INFO ] Invariant cache hit.
[2024-05-29 19:45:33] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:45:33] [INFO ] [Nat]Absence check using 401 positive place invariants in 71 ms returned sat
[2024-05-29 19:45:34] [INFO ] After 763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:45:34] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:45:34] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:45:34] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:45:34] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:45:35] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:45:35] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:45:35] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:45:35] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:45:35] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
[2024-05-29 19:45:35] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:45:35] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:45:35] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:45:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1283 ms
[2024-05-29 19:45:35] [INFO ] After 2088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-29 19:45:35] [INFO ] After 2425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 76 reset in 863 ms.
Product exploration explored 100000 steps with 75 reset in 1027 ms.
Built C files in :
/tmp/ltsmin298040499265630138
[2024-05-29 19:45:37] [INFO ] Too many transitions (1902) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:45:38] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin298040499265630138
Running compilation step : cd /tmp/ltsmin298040499265630138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin298040499265630138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin298040499265630138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 56 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
// Phase 1: matrix 1902 rows 1403 cols
[2024-05-29 19:45:41] [INFO ] Computed 401 invariants in 7 ms
[2024-05-29 19:45:41] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-29 19:45:41] [INFO ] Invariant cache hit.
[2024-05-29 19:45:43] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 2357 ms to find 0 implicit places.
[2024-05-29 19:45:43] [INFO ] Redundant transitions in 412 ms returned []
[2024-05-29 19:45:43] [INFO ] Invariant cache hit.
[2024-05-29 19:45:44] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3844 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Built C files in :
/tmp/ltsmin3300098323385615503
[2024-05-29 19:45:44] [INFO ] Too many transitions (1902) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:45:44] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3300098323385615503
Running compilation step : cd /tmp/ltsmin3300098323385615503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3300098323385615503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3300098323385615503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 19:45:48] [INFO ] Flatten gal took : 51 ms
[2024-05-29 19:45:48] [INFO ] Flatten gal took : 50 ms
[2024-05-29 19:45:48] [INFO ] Time to serialize gal into /tmp/LTL7799654282916124434.gal : 9 ms
[2024-05-29 19:45:48] [INFO ] Time to serialize properties into /tmp/LTL723413910444021028.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7799654282916124434.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10215521938769818251.hoa' '-atoms' '/tmp/LTL723413910444021028.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL723413910444021028.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10215521938769818251.hoa
Detected timeout of ITS tools.
[2024-05-29 19:46:03] [INFO ] Flatten gal took : 50 ms
[2024-05-29 19:46:03] [INFO ] Flatten gal took : 52 ms
[2024-05-29 19:46:03] [INFO ] Time to serialize gal into /tmp/LTL8562224575000148210.gal : 16 ms
[2024-05-29 19:46:03] [INFO ] Time to serialize properties into /tmp/LTL15182223361483175562.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8562224575000148210.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15182223361483175562.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G("((p1345==0)||(p3172==0))")))
Formula 0 simplified : F!"((p1345==0)||(p3172==0))"
Detected timeout of ITS tools.
[2024-05-29 19:46:18] [INFO ] Flatten gal took : 52 ms
[2024-05-29 19:46:18] [INFO ] Applying decomposition
[2024-05-29 19:46:18] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18402369687057380293.txt' '-o' '/tmp/graph18402369687057380293.bin' '-w' '/tmp/graph18402369687057380293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18402369687057380293.bin' '-l' '-1' '-v' '-w' '/tmp/graph18402369687057380293.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:46:18] [INFO ] Decomposing Gal with order
[2024-05-29 19:46:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:46:18] [INFO ] Removed a total of 2101 redundant transitions.
[2024-05-29 19:46:18] [INFO ] Flatten gal took : 81 ms
[2024-05-29 19:46:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2112 labels/synchronizations in 21 ms.
[2024-05-29 19:46:18] [INFO ] Time to serialize gal into /tmp/LTL6511699800029698554.gal : 10 ms
[2024-05-29 19:46:18] [INFO ] Time to serialize properties into /tmp/LTL2952530816763519706.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6511699800029698554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2952530816763519706.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G("((i7.i1.i1.u128.p1345==0)||(i19.i0.i1.u316.p3172==0))")))
Formula 0 simplified : F!"((i7.i1.i1.u128.p1345==0)||(i19.i0.i1.u316.p3172==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6937535941679424607
[2024-05-29 19:46:33] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6937535941679424607
Running compilation step : cd /tmp/ltsmin6937535941679424607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6937535941679424607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6937535941679424607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-14 finished in 109226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p1 U G(p2)))))'
Found a Shortening insensitive property : ShieldRVs-PT-100B-LTLFireability-00
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0))]
Support contains 8 out of 3315 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 397 transitions
Trivial Post-agglo rules discarded 397 transitions
Performed 397 trivial Post agglomeration. Transition count delta: 397
Iterating post reduction 0 with 397 rules applied. Total rules applied 397 place count 3314 transition count 3417
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 794 place count 2917 transition count 3417
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 794 place count 2917 transition count 2918
Deduced a syphon composed of 499 places in 12 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1792 place count 2418 transition count 2918
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1804 place count 2406 transition count 2906
Iterating global reduction 2 with 12 rules applied. Total rules applied 1816 place count 2406 transition count 2906
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1816 place count 2406 transition count 2902
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1824 place count 2402 transition count 2902
Performed 991 Post agglomeration using F-continuation condition.Transition count delta: 991
Deduced a syphon composed of 991 places in 4 ms
Reduce places removed 991 places and 0 transitions.
Iterating global reduction 2 with 1982 rules applied. Total rules applied 3806 place count 1411 transition count 1911
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3808 place count 1409 transition count 1909
Applied a total of 3808 rules in 550 ms. Remains 1409 /3315 variables (removed 1906) and now considering 1909/3815 (removed 1906) transitions.
// Phase 1: matrix 1909 rows 1409 cols
[2024-05-29 19:46:37] [INFO ] Computed 401 invariants in 6 ms
[2024-05-29 19:46:38] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-05-29 19:46:38] [INFO ] Invariant cache hit.
[2024-05-29 19:46:40] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 2380 ms to find 0 implicit places.
[2024-05-29 19:46:40] [INFO ] Invariant cache hit.
[2024-05-29 19:46:41] [INFO ] Dead Transitions using invariants and state equation in 919 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1409/3315 places, 1909/3815 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3852 ms. Remains : 1409/3315 places, 1909/3815 transitions.
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s730 1), p1:(EQ s744 1), p0:(OR (EQ s1086 0) (EQ s1104 0) (EQ s1115 0) (EQ s572 0) (EQ s575 0) (EQ s584 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 491 reset in 885 ms.
Product exploration explored 100000 steps with 523 reset in 1063 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 17 factoid took 514 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 19:46:44] [INFO ] Invariant cache hit.
[2024-05-29 19:46:44] [INFO ] [Real]Absence check using 401 positive place invariants in 70 ms returned sat
[2024-05-29 19:46:44] [INFO ] After 402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 19:46:45] [INFO ] [Nat]Absence check using 401 positive place invariants in 69 ms returned sat
[2024-05-29 19:46:46] [INFO ] After 1103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 19:46:46] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:46:46] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-29 19:46:46] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:46:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 491 ms
[2024-05-29 19:46:47] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:46:47] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-29 19:46:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2024-05-29 19:46:47] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:46:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2024-05-29 19:46:47] [INFO ] After 2610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 378 ms.
[2024-05-29 19:46:48] [INFO ] After 3480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 174 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1409 transition count 1909
Applied a total of 201 rules in 99 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 114683 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114683 steps, saw 111957 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1909 rows 1409 cols
[2024-05-29 19:46:52] [INFO ] Computed 401 invariants in 4 ms
[2024-05-29 19:46:52] [INFO ] [Real]Absence check using 401 positive place invariants in 81 ms returned sat
[2024-05-29 19:46:52] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 19:46:53] [INFO ] [Nat]Absence check using 401 positive place invariants in 77 ms returned sat
[2024-05-29 19:46:54] [INFO ] After 1119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 19:46:54] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:46:54] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:46:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2024-05-29 19:46:55] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:46:55] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:46:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2024-05-29 19:46:55] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:46:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-05-29 19:46:55] [INFO ] After 2312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 368 ms.
[2024-05-29 19:46:55] [INFO ] After 3220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 271 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 55 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 56 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2024-05-29 19:46:56] [INFO ] Invariant cache hit.
[2024-05-29 19:46:57] [INFO ] Implicit Places using invariants in 854 ms returned []
[2024-05-29 19:46:57] [INFO ] Invariant cache hit.
[2024-05-29 19:46:59] [INFO ] Implicit Places using invariants and state equation in 2107 ms returned []
Implicit Place search using SMT with State Equation took 2963 ms to find 0 implicit places.
[2024-05-29 19:46:59] [INFO ] Redundant transitions in 184 ms returned []
[2024-05-29 19:46:59] [INFO ] Invariant cache hit.
[2024-05-29 19:47:00] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4230 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 56 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-05-29 19:47:00] [INFO ] Invariant cache hit.
[2024-05-29 19:47:00] [INFO ] [Real]Absence check using 401 positive place invariants in 77 ms returned sat
[2024-05-29 19:47:00] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 19:47:01] [INFO ] [Nat]Absence check using 401 positive place invariants in 77 ms returned sat
[2024-05-29 19:47:02] [INFO ] After 1082ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 19:47:02] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:47:02] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:47:02] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:47:03] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:47:03] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:47:03] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:47:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 709 ms
[2024-05-29 19:47:03] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:47:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2024-05-29 19:47:04] [INFO ] After 2503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 358 ms.
[2024-05-29 19:47:04] [INFO ] After 3388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 17 factoid took 620 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 43 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
// Phase 1: matrix 1909 rows 1409 cols
[2024-05-29 19:47:05] [INFO ] Computed 401 invariants in 10 ms
[2024-05-29 19:47:06] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-05-29 19:47:06] [INFO ] Invariant cache hit.
[2024-05-29 19:47:08] [INFO ] Implicit Places using invariants and state equation in 1859 ms returned []
Implicit Place search using SMT with State Equation took 2573 ms to find 0 implicit places.
[2024-05-29 19:47:08] [INFO ] Invariant cache hit.
[2024-05-29 19:47:09] [INFO ] Dead Transitions using invariants and state equation in 1040 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3660 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (OR p1 p2)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (OR p1 p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 17 factoid took 513 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-29 19:47:10] [INFO ] Invariant cache hit.
[2024-05-29 19:47:11] [INFO ] [Real]Absence check using 401 positive place invariants in 73 ms returned sat
[2024-05-29 19:47:11] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 19:47:11] [INFO ] [Nat]Absence check using 401 positive place invariants in 73 ms returned sat
[2024-05-29 19:47:13] [INFO ] After 1270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 730 ms
[2024-05-29 19:47:14] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2024-05-29 19:47:14] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-05-29 19:47:14] [INFO ] After 3082ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 493 ms.
[2024-05-29 19:47:15] [INFO ] After 4171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 413 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1409 transition count 1909
Applied a total of 201 rules in 104 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1909 rows 1409 cols
[2024-05-29 19:47:16] [INFO ] Computed 401 invariants in 4 ms
[2024-05-29 19:47:16] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 19:47:17] [INFO ] [Nat]Absence check using 401 positive place invariants in 73 ms returned sat
[2024-05-29 19:47:18] [INFO ] After 1015ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 19:47:18] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:47:18] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:47:18] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:47:18] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:47:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 484 ms
[2024-05-29 19:47:19] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2024-05-29 19:47:19] [INFO ] After 2077ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 332 ms.
[2024-05-29 19:47:19] [INFO ] After 2868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 186 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 51 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 103683 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103683 steps, saw 101223 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 19:47:23] [INFO ] Invariant cache hit.
[2024-05-29 19:47:23] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 19:47:24] [INFO ] [Nat]Absence check using 401 positive place invariants in 74 ms returned sat
[2024-05-29 19:47:25] [INFO ] After 984ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 522 ms
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2024-05-29 19:47:26] [INFO ] After 2172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 324 ms.
[2024-05-29 19:47:26] [INFO ] After 2961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 155 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 51 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 51 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2024-05-29 19:47:27] [INFO ] Invariant cache hit.
[2024-05-29 19:47:27] [INFO ] Implicit Places using invariants in 772 ms returned []
[2024-05-29 19:47:27] [INFO ] Invariant cache hit.
[2024-05-29 19:47:30] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 2816 ms to find 0 implicit places.
[2024-05-29 19:47:30] [INFO ] Redundant transitions in 195 ms returned []
[2024-05-29 19:47:30] [INFO ] Invariant cache hit.
[2024-05-29 19:47:31] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4018 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 51 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-29 19:47:31] [INFO ] Invariant cache hit.
[2024-05-29 19:47:31] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 19:47:31] [INFO ] [Nat]Absence check using 401 positive place invariants in 79 ms returned sat
[2024-05-29 19:47:32] [INFO ] After 1009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 19:47:33] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:47:33] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:47:33] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:47:33] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:47:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 531 ms
[2024-05-29 19:47:33] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:47:33] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:47:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2024-05-29 19:47:34] [INFO ] After 2197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 317 ms.
[2024-05-29 19:47:34] [INFO ] After 2963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (OR p1 p2)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (OR p1 p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 17 factoid took 641 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 480 reset in 1088 ms.
Product exploration explored 100000 steps with 516 reset in 1200 ms.
Built C files in :
/tmp/ltsmin15257433331825201122
[2024-05-29 19:47:38] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15257433331825201122
Running compilation step : cd /tmp/ltsmin15257433331825201122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15257433331825201122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15257433331825201122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 45 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
// Phase 1: matrix 1909 rows 1409 cols
[2024-05-29 19:47:41] [INFO ] Computed 401 invariants in 4 ms
[2024-05-29 19:47:41] [INFO ] Implicit Places using invariants in 665 ms returned []
[2024-05-29 19:47:41] [INFO ] Invariant cache hit.
[2024-05-29 19:47:43] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 2342 ms to find 0 implicit places.
[2024-05-29 19:47:43] [INFO ] Invariant cache hit.
[2024-05-29 19:47:44] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3314 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Built C files in :
/tmp/ltsmin8220004544521815422
[2024-05-29 19:47:44] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8220004544521815422
Running compilation step : cd /tmp/ltsmin8220004544521815422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8220004544521815422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8220004544521815422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 19:47:47] [INFO ] Flatten gal took : 48 ms
[2024-05-29 19:47:47] [INFO ] Flatten gal took : 50 ms
[2024-05-29 19:47:47] [INFO ] Time to serialize gal into /tmp/LTL15526223777697695363.gal : 9 ms
[2024-05-29 19:47:47] [INFO ] Time to serialize properties into /tmp/LTL7134967815065238899.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15526223777697695363.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4942124222763452847.hoa' '-atoms' '/tmp/LTL7134967815065238899.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X("((((p3112==0)||(p3156==0))||((p3181==0)||(p1688==0)))||((p1696==0)||(p1722==0)))"))&&(("(p2157==1)")U(G("(p2124!=1)"))))))
Formula 0 simplified : G(X!"((((p3112==0)||(p3156==0))||((p3181==0)||(p1688==0)))||((p1696==0)||(p1722==0)))" | (!"(p2157==1)" R F!"(p2124!=1)"))
Detected timeout of ITS tools.
[2024-05-29 19:48:18] [INFO ] Flatten gal took : 49 ms
[2024-05-29 19:48:18] [INFO ] Applying decomposition
[2024-05-29 19:48:18] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6985359525718612806.txt' '-o' '/tmp/graph6985359525718612806.bin' '-w' '/tmp/graph6985359525718612806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6985359525718612806.bin' '-l' '-1' '-v' '-w' '/tmp/graph6985359525718612806.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:48:18] [INFO ] Decomposing Gal with order
[2024-05-29 19:48:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:48:18] [INFO ] Removed a total of 2118 redundant transitions.
[2024-05-29 19:48:18] [INFO ] Flatten gal took : 81 ms
[2024-05-29 19:48:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2166 labels/synchronizations in 23 ms.
[2024-05-29 19:48:18] [INFO ] Time to serialize gal into /tmp/LTL14905378031735252587.gal : 10 ms
[2024-05-29 19:48:18] [INFO ] Time to serialize properties into /tmp/LTL16534727211238483330.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14905378031735252587.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16534727211238483330.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((X("((((i18.u311.p3112==0)||(i18.u316.p3156==0))||((i18.u320.p3181==0)||(i9.i1.i1.u164.p1688==0)))||((i9.i1.i1.u165.p1696==0)||(i...246
Formula 0 simplified : G(X!"((((i18.u311.p3112==0)||(i18.u316.p3156==0))||((i18.u320.p3181==0)||(i9.i1.i1.u164.p1688==0)))||((i9.i1.i1.u165.p1696==0)||(i10...239
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12661858678018027052
[2024-05-29 19:48:33] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12661858678018027052
Running compilation step : cd /tmp/ltsmin12661858678018027052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12661858678018027052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12661858678018027052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-00 finished in 119622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Found a Shortening insensitive property : ShieldRVs-PT-100B-LTLFireability-07
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 3315 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 3314 transition count 3415
Reduce places removed 399 places and 0 transitions.
Iterating post reduction 1 with 399 rules applied. Total rules applied 798 place count 2915 transition count 3415
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 798 place count 2915 transition count 2916
Deduced a syphon composed of 499 places in 7 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1796 place count 2416 transition count 2916
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1808 place count 2404 transition count 2904
Iterating global reduction 2 with 12 rules applied. Total rules applied 1820 place count 2404 transition count 2904
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1820 place count 2404 transition count 2900
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1828 place count 2400 transition count 2900
Performed 992 Post agglomeration using F-continuation condition.Transition count delta: 992
Deduced a syphon composed of 992 places in 5 ms
Reduce places removed 992 places and 0 transitions.
Iterating global reduction 2 with 1984 rules applied. Total rules applied 3812 place count 1408 transition count 1908
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3814 place count 1406 transition count 1906
Applied a total of 3814 rules in 516 ms. Remains 1406 /3315 variables (removed 1909) and now considering 1906/3815 (removed 1909) transitions.
// Phase 1: matrix 1906 rows 1406 cols
[2024-05-29 19:48:37] [INFO ] Computed 401 invariants in 6 ms
[2024-05-29 19:48:37] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-05-29 19:48:37] [INFO ] Invariant cache hit.
[2024-05-29 19:48:39] [INFO ] Implicit Places using invariants and state equation in 1790 ms returned []
Implicit Place search using SMT with State Equation took 2456 ms to find 0 implicit places.
[2024-05-29 19:48:39] [INFO ] Invariant cache hit.
[2024-05-29 19:48:40] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1406/3315 places, 1906/3815 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3936 ms. Remains : 1406/3315 places, 1906/3815 transitions.
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s1125 0) (EQ s1368 0)), p0:(EQ s1067 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22637 reset in 1361 ms.
Product exploration explored 100000 steps with 22365 reset in 1569 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 254 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Finished random walk after 9 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 434 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 3 out of 1406 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1406/1406 places, 1906/1906 transitions.
Applied a total of 0 rules in 53 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
[2024-05-29 19:48:44] [INFO ] Invariant cache hit.
[2024-05-29 19:48:45] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-29 19:48:45] [INFO ] Invariant cache hit.
[2024-05-29 19:48:47] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2411 ms to find 0 implicit places.
[2024-05-29 19:48:47] [INFO ] Redundant transitions in 373 ms returned [1905]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1905 rows 1406 cols
[2024-05-29 19:48:47] [INFO ] Computed 401 invariants in 8 ms
[2024-05-29 19:48:48] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1406/1406 places, 1905/1906 transitions.
Applied a total of 0 rules in 52 ms. Remains 1406 /1406 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3849 ms. Remains : 1406/1406 places, 1905/1906 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 447 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Finished random walk after 1358 steps, including 1 resets, run visited all 4 properties in 15 ms. (steps per millisecond=90 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 603 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 22507 reset in 1303 ms.
Product exploration explored 100000 steps with 22525 reset in 1458 ms.
Built C files in :
/tmp/ltsmin1205459164499136016
[2024-05-29 19:48:53] [INFO ] Too many transitions (1905) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:48:53] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1205459164499136016
Running compilation step : cd /tmp/ltsmin1205459164499136016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1205459164499136016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1205459164499136016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1406 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1406/1406 places, 1905/1905 transitions.
Applied a total of 0 rules in 54 ms. Remains 1406 /1406 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
[2024-05-29 19:48:56] [INFO ] Invariant cache hit.
[2024-05-29 19:48:56] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-29 19:48:56] [INFO ] Invariant cache hit.
[2024-05-29 19:48:58] [INFO ] Implicit Places using invariants and state equation in 1746 ms returned []
Implicit Place search using SMT with State Equation took 2394 ms to find 0 implicit places.
[2024-05-29 19:48:59] [INFO ] Redundant transitions in 383 ms returned []
[2024-05-29 19:48:59] [INFO ] Invariant cache hit.
[2024-05-29 19:48:59] [INFO ] Dead Transitions using invariants and state equation in 937 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3776 ms. Remains : 1406/1406 places, 1905/1905 transitions.
Built C files in :
/tmp/ltsmin13641127390545639515
[2024-05-29 19:48:59] [INFO ] Too many transitions (1905) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:49:00] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13641127390545639515
Running compilation step : cd /tmp/ltsmin13641127390545639515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13641127390545639515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13641127390545639515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 19:49:03] [INFO ] Flatten gal took : 57 ms
[2024-05-29 19:49:03] [INFO ] Flatten gal took : 58 ms
[2024-05-29 19:49:03] [INFO ] Time to serialize gal into /tmp/LTL15912272646041984027.gal : 10 ms
[2024-05-29 19:49:03] [INFO ] Time to serialize properties into /tmp/LTL4224595330598874453.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15912272646041984027.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17707916724670634165.hoa' '-atoms' '/tmp/LTL4224595330598874453.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4224595330598874453.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17707916724670634165.hoa
Detected timeout of ITS tools.
[2024-05-29 19:49:18] [INFO ] Flatten gal took : 73 ms
[2024-05-29 19:49:18] [INFO ] Flatten gal took : 56 ms
[2024-05-29 19:49:18] [INFO ] Time to serialize gal into /tmp/LTL4293513040428763044.gal : 10 ms
[2024-05-29 19:49:18] [INFO ] Time to serialize properties into /tmp/LTL9499207238168323857.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4293513040428763044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9499207238168323857.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p3065==1)")||(G("((p3225==0)&&(p3901==0))"))))))
Formula 0 simplified : XG(!"(p3065==1)" & F!"((p3225==0)&&(p3901==0))")
Detected timeout of ITS tools.
[2024-05-29 19:49:33] [INFO ] Flatten gal took : 57 ms
[2024-05-29 19:49:33] [INFO ] Applying decomposition
[2024-05-29 19:49:33] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17396772628928898790.txt' '-o' '/tmp/graph17396772628928898790.bin' '-w' '/tmp/graph17396772628928898790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17396772628928898790.bin' '-l' '-1' '-v' '-w' '/tmp/graph17396772628928898790.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:49:33] [INFO ] Decomposing Gal with order
[2024-05-29 19:49:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:49:33] [INFO ] Removed a total of 2098 redundant transitions.
[2024-05-29 19:49:33] [INFO ] Flatten gal took : 82 ms
[2024-05-29 19:49:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2226 labels/synchronizations in 18 ms.
[2024-05-29 19:49:33] [INFO ] Time to serialize gal into /tmp/LTL5295496170082687671.gal : 10 ms
[2024-05-29 19:49:33] [INFO ] Time to serialize properties into /tmp/LTL4623390260314242798.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5295496170082687671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4623390260314242798.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i17.i0.i1.u305.p3065==1)")||(G("((i18.i0.i1.u322.p3225==0)&&(i21.i1.i0.u392.p3901==0))"))))))
Formula 0 simplified : XG(!"(i17.i0.i1.u305.p3065==1)" & F!"((i18.i0.i1.u322.p3225==0)&&(i21.i1.i0.u392.p3901==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5897540256632060423
[2024-05-29 19:49:49] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5897540256632060423
Running compilation step : cd /tmp/ltsmin5897540256632060423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5897540256632060423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5897540256632060423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-07 finished in 75392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ShieldRVs-PT-100B-LTLFireability-10
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3315 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3315/3315 places, 3815/3815 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3314 transition count 3414
Reduce places removed 400 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 401 rules applied. Total rules applied 801 place count 2914 transition count 3413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 802 place count 2913 transition count 3413
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 802 place count 2913 transition count 2913
Deduced a syphon composed of 500 places in 7 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 1802 place count 2413 transition count 2913
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1814 place count 2401 transition count 2901
Iterating global reduction 3 with 12 rules applied. Total rules applied 1826 place count 2401 transition count 2901
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1826 place count 2401 transition count 2897
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1834 place count 2397 transition count 2897
Performed 991 Post agglomeration using F-continuation condition.Transition count delta: 991
Deduced a syphon composed of 991 places in 5 ms
Reduce places removed 991 places and 0 transitions.
Iterating global reduction 3 with 1982 rules applied. Total rules applied 3816 place count 1406 transition count 1906
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3818 place count 1404 transition count 1904
Applied a total of 3818 rules in 511 ms. Remains 1404 /3315 variables (removed 1911) and now considering 1904/3815 (removed 1911) transitions.
// Phase 1: matrix 1904 rows 1404 cols
[2024-05-29 19:49:52] [INFO ] Computed 401 invariants in 8 ms
[2024-05-29 19:49:53] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-29 19:49:53] [INFO ] Invariant cache hit.
[2024-05-29 19:49:55] [INFO ] Implicit Places using invariants and state equation in 1725 ms returned []
Implicit Place search using SMT with State Equation took 2388 ms to find 0 implicit places.
[2024-05-29 19:49:55] [INFO ] Invariant cache hit.
[2024-05-29 19:49:56] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1404/3315 places, 1904/3815 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3849 ms. Remains : 1404/3315 places, 1904/3815 transitions.
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1174 1) (EQ s269 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 27231 reset in 1730 ms.
Product exploration explored 100000 steps with 26803 reset in 1872 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-29 19:50:00] [INFO ] Invariant cache hit.
[2024-05-29 19:50:01] [INFO ] [Real]Absence check using 401 positive place invariants in 280 ms returned sat
[2024-05-29 19:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 19:50:07] [INFO ] [Real]Absence check using state equation in 5404 ms returned sat
[2024-05-29 19:50:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:50:08] [INFO ] [Nat]Absence check using 401 positive place invariants in 193 ms returned sat
[2024-05-29 19:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 19:50:11] [INFO ] [Nat]Absence check using state equation in 2671 ms returned sat
[2024-05-29 19:50:11] [INFO ] Computed and/alt/rep : 1548/6606/1548 causal constraints (skipped 354 transitions) in 122 ms.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 2 places in 986 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:50:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1404/1404 places, 1904/1904 transitions.
Applied a total of 0 rules in 48 ms. Remains 1404 /1404 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
[2024-05-29 19:50:23] [INFO ] Invariant cache hit.
[2024-05-29 19:50:23] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-05-29 19:50:23] [INFO ] Invariant cache hit.
[2024-05-29 19:50:25] [INFO ] Implicit Places using invariants and state equation in 1808 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
[2024-05-29 19:50:26] [INFO ] Redundant transitions in 425 ms returned [1903]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1903 rows 1404 cols
[2024-05-29 19:50:26] [INFO ] Computed 401 invariants in 9 ms
[2024-05-29 19:50:27] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1404/1404 places, 1903/1904 transitions.
Applied a total of 0 rules in 51 ms. Remains 1404 /1404 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4078 ms. Remains : 1404/1404 places, 1903/1904 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-29 19:50:27] [INFO ] Invariant cache hit.
[2024-05-29 19:50:29] [INFO ] [Real]Absence check using 401 positive place invariants in 322 ms returned sat
[2024-05-29 19:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 19:50:34] [INFO ] [Real]Absence check using state equation in 5251 ms returned sat
[2024-05-29 19:50:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:50:36] [INFO ] [Nat]Absence check using 401 positive place invariants in 211 ms returned sat
[2024-05-29 19:50:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 19:50:39] [INFO ] [Nat]Absence check using state equation in 2670 ms returned sat
[2024-05-29 19:50:39] [INFO ] Computed and/alt/rep : 1548/6607/1548 causal constraints (skipped 353 transitions) in 105 ms.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 2 places in 956 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:50:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 26961 reset in 1703 ms.
Product exploration explored 100000 steps with 27088 reset in 1856 ms.
Built C files in :
/tmp/ltsmin1115366018404127630
[2024-05-29 19:50:54] [INFO ] Too many transitions (1903) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:50:54] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1115366018404127630
Running compilation step : cd /tmp/ltsmin1115366018404127630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1115366018404127630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1115366018404127630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1404/1404 places, 1903/1903 transitions.
Applied a total of 0 rules in 52 ms. Remains 1404 /1404 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-05-29 19:50:57] [INFO ] Invariant cache hit.
[2024-05-29 19:50:58] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-29 19:50:58] [INFO ] Invariant cache hit.
[2024-05-29 19:50:59] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2297 ms to find 0 implicit places.
[2024-05-29 19:51:00] [INFO ] Redundant transitions in 378 ms returned []
[2024-05-29 19:51:00] [INFO ] Invariant cache hit.
[2024-05-29 19:51:01] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3679 ms. Remains : 1404/1404 places, 1903/1903 transitions.
Built C files in :
/tmp/ltsmin4872460368554854013
[2024-05-29 19:51:01] [INFO ] Too many transitions (1903) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:51:01] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4872460368554854013
Running compilation step : cd /tmp/ltsmin4872460368554854013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4872460368554854013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4872460368554854013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 19:51:04] [INFO ] Flatten gal took : 51 ms
[2024-05-29 19:51:04] [INFO ] Flatten gal took : 52 ms
[2024-05-29 19:51:04] [INFO ] Time to serialize gal into /tmp/LTL5186408015754847983.gal : 9 ms
[2024-05-29 19:51:04] [INFO ] Time to serialize properties into /tmp/LTL17578812792504115779.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5186408015754847983.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5866297369416338057.hoa' '-atoms' '/tmp/LTL17578812792504115779.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F("((p3361==1)||(p844==1))"))))
Formula 0 simplified : XG!"((p3361==1)||(p844==1))"
Detected timeout of ITS tools.
[2024-05-29 19:51:34] [INFO ] Flatten gal took : 55 ms
[2024-05-29 19:51:34] [INFO ] Applying decomposition
[2024-05-29 19:51:34] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3560907449891851889.txt' '-o' '/tmp/graph3560907449891851889.bin' '-w' '/tmp/graph3560907449891851889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3560907449891851889.bin' '-l' '-1' '-v' '-w' '/tmp/graph3560907449891851889.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:51:34] [INFO ] Decomposing Gal with order
[2024-05-29 19:51:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:51:35] [INFO ] Removed a total of 2095 redundant transitions.
[2024-05-29 19:51:35] [INFO ] Flatten gal took : 83 ms
[2024-05-29 19:51:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2116 labels/synchronizations in 21 ms.
[2024-05-29 19:51:35] [INFO ] Time to serialize gal into /tmp/LTL610603829856538025.gal : 11 ms
[2024-05-29 19:51:35] [INFO ] Time to serialize properties into /tmp/LTL12474506696117151704.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL610603829856538025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12474506696117151704.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F("((i18.i1.i1.u335.p3361==1)||(i4.i1.i0.u78.p844==1))"))))
Formula 0 simplified : XG!"((i18.i1.i1.u335.p3361==1)||(i4.i1.i0.u78.p844==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11125294331955890357
[2024-05-29 19:51:50] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11125294331955890357
Running compilation step : cd /tmp/ltsmin11125294331955890357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11125294331955890357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11125294331955890357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-10 finished in 121147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||((p1 U (p2||G(p1))) U p3)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
[2024-05-29 19:51:53] [INFO ] Flatten gal took : 91 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16062809820727832980
[2024-05-29 19:51:53] [INFO ] Too many transitions (3815) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:51:53] [INFO ] Applying decomposition
[2024-05-29 19:51:53] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16062809820727832980
Running compilation step : cd /tmp/ltsmin16062809820727832980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 19:51:53] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6257350023723986135.txt' '-o' '/tmp/graph6257350023723986135.bin' '-w' '/tmp/graph6257350023723986135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6257350023723986135.bin' '-l' '-1' '-v' '-w' '/tmp/graph6257350023723986135.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:51:53] [INFO ] Decomposing Gal with order
[2024-05-29 19:51:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:51:54] [INFO ] Removed a total of 3591 redundant transitions.
[2024-05-29 19:51:54] [INFO ] Flatten gal took : 153 ms
[2024-05-29 19:51:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-29 19:51:54] [INFO ] Time to serialize gal into /tmp/LTLFireability14105296100927865882.gal : 27 ms
[2024-05-29 19:51:54] [INFO ] Time to serialize properties into /tmp/LTLFireability5011849732540034186.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14105296100927865882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5011849732540034186.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 6 LTL properties
Checking formula 0 : !((F((X("((((i24.i0.i3.u970.p3112==0)||(i24.i0.i5.u983.p3156==0))||((i24.i0.i6.u989.p3181==0)||(i12.u532.p1688==0)))||((i12.u534.p1696...254
Formula 0 simplified : G(X!"((((i24.i0.i3.u970.p3112==0)||(i24.i0.i5.u983.p3156==0))||((i24.i0.i6.u989.p3181==0)||(i12.u532.p1688==0)))||((i12.u534.p1696==...247
Compilation finished in 11991 ms.
Running link step : cd /tmp/ltsmin16062809820727832980;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin16062809820727832980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&((LTLAPp1==true) U []((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin16062809820727832980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&((LTLAPp1==true) U []((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16062809820727832980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin16062809820727832980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16062809820727832980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp5==true)||[]((LTLAPp6==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 20:18:18] [INFO ] Applying decomposition
[2024-05-29 20:18:18] [INFO ] Flatten gal took : 223 ms
[2024-05-29 20:18:18] [INFO ] Decomposing Gal with order
[2024-05-29 20:18:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:18:20] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-29 20:18:20] [INFO ] Flatten gal took : 380 ms
[2024-05-29 20:18:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 3192 labels/synchronizations in 101 ms.
[2024-05-29 20:18:22] [INFO ] Time to serialize gal into /tmp/LTLFireability10140345541318155579.gal : 82 ms
[2024-05-29 20:18:22] [INFO ] Time to serialize properties into /tmp/LTLFireability992530126975180656.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10140345541318155579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability992530126975180656.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 6 LTL properties
Checking formula 0 : !((F((X("((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u643.p3112==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...1242
Formula 0 simplified : G(X!"((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u643.p3112==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...1235
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin16062809820727832980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp5==true)||[]((LTLAPp6==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16062809820727832980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp7==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin16062809820727832980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp7==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16062809820727832980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp8==true)||(((LTLAPp9==true) U ((LTLAPp10==true)||[]((LTLAPp9==true)))) U (LTLAPp11==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8105184 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16032032 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-100B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldRVs-PT-100B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789600548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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