Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593200524.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutoFlight-PT-96b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593200524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 9.0K Feb 25 18:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 18:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 18:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 18:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.9M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678519315612

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-96b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 07:21:58] [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]
[2023-03-11 07:21:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:21:58] [INFO ] Load time of PNML (sax parser for PT used): 343 ms
[2023-03-11 07:21:58] [INFO ] Transformed 7894 places.
[2023-03-11 07:21:58] [INFO ] Transformed 7868 transitions.
[2023-03-11 07:21:58] [INFO ] Found NUPN structural information;
[2023-03-11 07:21:58] [INFO ] Parsed PT model containing 7894 places and 7868 transitions and 18200 arcs in 711 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-96b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 7894 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7894/7894 places, 7868/7868 transitions.
Discarding 1008 places :
Symmetric choice reduction at 0 with 1008 rule applications. Total rules 1008 place count 6886 transition count 6860
Iterating global reduction 0 with 1008 rules applied. Total rules applied 2016 place count 6886 transition count 6860
Ensure Unique test removed 142 transitions
Reduce isomorphic transitions removed 142 transitions.
Iterating post reduction 0 with 142 rules applied. Total rules applied 2158 place count 6886 transition count 6718
Discarding 473 places :
Symmetric choice reduction at 1 with 473 rule applications. Total rules 2631 place count 6413 transition count 6245
Iterating global reduction 1 with 473 rules applied. Total rules applied 3104 place count 6413 transition count 6245
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 3173 place count 6344 transition count 6176
Iterating global reduction 1 with 69 rules applied. Total rules applied 3242 place count 6344 transition count 6176
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 3309 place count 6277 transition count 6109
Iterating global reduction 1 with 67 rules applied. Total rules applied 3376 place count 6277 transition count 6109
Applied a total of 3376 rules in 6377 ms. Remains 6277 /7894 variables (removed 1617) and now considering 6109/7868 (removed 1759) transitions.
// Phase 1: matrix 6109 rows 6277 cols
[2023-03-11 07:22:05] [INFO ] Computed 514 place invariants in 107 ms
[2023-03-11 07:22:06] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2023-03-11 07:22:06] [INFO ] Invariant cache hit.
[2023-03-11 07:22:11] [INFO ] Implicit Places using invariants and state equation in 4333 ms returned []
Implicit Place search using SMT with State Equation took 5452 ms to find 0 implicit places.
[2023-03-11 07:22:11] [INFO ] Invariant cache hit.
[2023-03-11 07:22:18] [INFO ] Dead Transitions using invariants and state equation in 7068 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6277/7894 places, 6109/7868 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18908 ms. Remains : 6277/7894 places, 6109/7868 transitions.
Support contains 34 out of 6277 places after structural reductions.
[2023-03-11 07:22:18] [INFO ] Flatten gal took : 319 ms
[2023-03-11 07:22:19] [INFO ] Flatten gal took : 234 ms
[2023-03-11 07:22:19] [INFO ] Input system was already deterministic with 6109 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 28) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-11 07:22:20] [INFO ] Invariant cache hit.
[2023-03-11 07:22:23] [INFO ] [Real]Absence check using 513 positive place invariants in 669 ms returned sat
[2023-03-11 07:22:24] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 45 ms returned sat
[2023-03-11 07:22:30] [INFO ] After 5372ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:15
[2023-03-11 07:22:36] [INFO ] Deduced a trap composed of 194 places in 5651 ms of which 22 ms to minimize.
[2023-03-11 07:22:41] [INFO ] Deduced a trap composed of 203 places in 5403 ms of which 10 ms to minimize.
[2023-03-11 07:22:46] [INFO ] Deduced a trap composed of 71 places in 4726 ms of which 5 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 07:22:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 07:22:46] [INFO ] After 26404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 20 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 351 ms.
Support contains 25 out of 6277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Drop transitions removed 2534 transitions
Trivial Post-agglo rules discarded 2534 transitions
Performed 2534 trivial Post agglomeration. Transition count delta: 2534
Iterating post reduction 0 with 2534 rules applied. Total rules applied 2534 place count 6277 transition count 3575
Reduce places removed 2534 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2823 rules applied. Total rules applied 5357 place count 3743 transition count 3286
Reduce places removed 192 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 194 rules applied. Total rules applied 5551 place count 3551 transition count 3284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5553 place count 3549 transition count 3284
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 5553 place count 3549 transition count 2583
Deduced a syphon composed of 701 places in 31 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 4 with 1402 rules applied. Total rules applied 6955 place count 2848 transition count 2583
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 6956 place count 2847 transition count 2582
Iterating global reduction 4 with 1 rules applied. Total rules applied 6957 place count 2847 transition count 2582
Performed 1140 Post agglomeration using F-continuation condition with reduction of 141 identical transitions.
Deduced a syphon composed of 1140 places in 1 ms
Reduce places removed 1140 places and 0 transitions.
Iterating global reduction 4 with 2280 rules applied. Total rules applied 9237 place count 1707 transition count 1301
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 9240 place count 1707 transition count 1298
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 9241 place count 1707 transition count 1297
Free-agglomeration rule applied 287 times.
Iterating global reduction 5 with 287 rules applied. Total rules applied 9528 place count 1707 transition count 1010
Reduce places removed 287 places and 0 transitions.
Iterating post reduction 5 with 287 rules applied. Total rules applied 9815 place count 1420 transition count 1010
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 9816 place count 1419 transition count 1009
Reduce places removed 111 places and 0 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 6 with 166 rules applied. Total rules applied 9982 place count 1308 transition count 954
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 7 with 55 rules applied. Total rules applied 10037 place count 1253 transition count 954
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 56 Pre rules applied. Total rules applied 10037 place count 1253 transition count 898
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 8 with 112 rules applied. Total rules applied 10149 place count 1197 transition count 898
Applied a total of 10149 rules in 2015 ms. Remains 1197 /6277 variables (removed 5080) and now considering 898/6109 (removed 5211) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2015 ms. Remains : 1197/6277 places, 898/6109 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 898 rows 1197 cols
[2023-03-11 07:22:49] [INFO ] Computed 403 place invariants in 37 ms
[2023-03-11 07:22:50] [INFO ] [Real]Absence check using 401 positive place invariants in 112 ms returned sat
[2023-03-11 07:22:50] [INFO ] [Real]Absence check using 401 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-11 07:22:50] [INFO ] After 549ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-11 07:22:50] [INFO ] State equation strengthened by 639 read => feed constraints.
[2023-03-11 07:22:50] [INFO ] After 167ms SMT Verify possible using 639 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-11 07:22:50] [INFO ] After 1096ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-11 07:22:51] [INFO ] [Nat]Absence check using 401 positive place invariants in 103 ms returned sat
[2023-03-11 07:22:51] [INFO ] [Nat]Absence check using 401 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-11 07:22:51] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 07:22:52] [INFO ] After 139ms SMT Verify possible using 639 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 07:22:52] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-11 07:22:52] [INFO ] After 1492ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1197/1197 places, 898/898 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1197 transition count 891
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1190 transition count 891
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 1190 transition count 887
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 1186 transition count 887
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 56 place count 1168 transition count 871
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 1168 transition count 870
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 1167 transition count 870
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 58 place count 1167 transition count 869
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 1166 transition count 869
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 1166 transition count 866
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 66 place count 1163 transition count 866
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 67 place count 1162 transition count 865
Reduce places removed 294 places and 0 transitions.
Drop transitions removed 567 transitions
Trivial Post-agglo rules discarded 567 transitions
Performed 567 trivial Post agglomeration. Transition count delta: 567
Iterating post reduction 5 with 861 rules applied. Total rules applied 928 place count 868 transition count 298
Reduce places removed 567 places and 0 transitions.
Iterating post reduction 6 with 567 rules applied. Total rules applied 1495 place count 301 transition count 298
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 84 Pre rules applied. Total rules applied 1495 place count 301 transition count 214
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 7 with 168 rules applied. Total rules applied 1663 place count 217 transition count 214
Applied a total of 1663 rules in 504 ms. Remains 217 /1197 variables (removed 980) and now considering 214/898 (removed 684) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 217/1197 places, 214/898 transitions.
Finished random walk after 430 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=43 )
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA AutoFlight-PT-96b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1592 stabilizing places and 1592 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 6277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 6265 transition count 6097
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 6265 transition count 6097
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 6265 transition count 6095
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 6260 transition count 6090
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 6260 transition count 6090
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 6258 transition count 6088
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 6258 transition count 6088
Applied a total of 40 rules in 4303 ms. Remains 6258 /6277 variables (removed 19) and now considering 6088/6109 (removed 21) transitions.
// Phase 1: matrix 6088 rows 6258 cols
[2023-03-11 07:22:58] [INFO ] Computed 514 place invariants in 70 ms
[2023-03-11 07:23:00] [INFO ] Implicit Places using invariants in 2451 ms returned []
[2023-03-11 07:23:00] [INFO ] Invariant cache hit.
[2023-03-11 07:23:02] [INFO ] Implicit Places using invariants and state equation in 2404 ms returned []
Implicit Place search using SMT with State Equation took 4874 ms to find 0 implicit places.
[2023-03-11 07:23:02] [INFO ] Invariant cache hit.
[2023-03-11 07:23:08] [INFO ] Dead Transitions using invariants and state equation in 5972 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6258/6277 places, 6088/6109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15160 ms. Remains : 6258/6277 places, 6088/6109 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1782 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3702 steps with 0 reset in 58 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-00 finished in 15688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((X(p1)&&(p2 U (p3||G(p2)))))))'
Support contains 4 out of 6277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 6266 transition count 6098
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 6266 transition count 6098
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 6266 transition count 6097
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 6261 transition count 6092
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 6261 transition count 6092
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 6258 transition count 6089
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 6258 transition count 6089
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 6257 transition count 6088
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 6257 transition count 6088
Applied a total of 41 rules in 5400 ms. Remains 6257 /6277 variables (removed 20) and now considering 6088/6109 (removed 21) transitions.
// Phase 1: matrix 6088 rows 6257 cols
[2023-03-11 07:23:14] [INFO ] Computed 514 place invariants in 49 ms
[2023-03-11 07:23:16] [INFO ] Implicit Places using invariants in 1857 ms returned []
[2023-03-11 07:23:16] [INFO ] Invariant cache hit.
[2023-03-11 07:23:18] [INFO ] Implicit Places using invariants and state equation in 1767 ms returned []
Implicit Place search using SMT with State Equation took 3657 ms to find 0 implicit places.
[2023-03-11 07:23:18] [INFO ] Invariant cache hit.
[2023-03-11 07:23:25] [INFO ] Dead Transitions using invariants and state equation in 6820 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6257/6277 places, 6088/6109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15916 ms. Remains : 6257/6277 places, 6088/6109 transitions.
Stuttering acceptance computed with spot in 437 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (AND (NOT p0) p3) (AND (NOT p0) p2)), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p0) (AND p2 p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(OR (AND p3 p0) (AND p2 p0)), acceptance={0, 1} source=0 dest: 5}, { cond=(AND (NOT p3) p2 p0), acceptance={1} source=0 dest: 6}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p3 p0) (AND p2 p0)), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p3 p0 (NOT p1)) (AND p2 p0 (NOT p1))), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(OR (AND p3 p0 (NOT p1)) (AND p2 p0 (NOT p1))), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={1} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2 p0), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p3:(AND (NEQ s3847 1) (NEQ s1500 1)), p0:(EQ s2892 1), p2:(NEQ s1500 1), p1:(NEQ s2065 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2310 steps with 0 reset in 47 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-01 finished in 16562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(F((p0&&X((p0 U (!p1||G(p0)))))))&&G(p2))||G(F((p0&&X((p0 U (!p1||G(p0))))))))))'
Support contains 4 out of 6277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 6265 transition count 6097
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 6265 transition count 6097
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 6265 transition count 6095
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 6260 transition count 6090
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 6260 transition count 6090
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 6257 transition count 6087
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 6257 transition count 6087
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 6256 transition count 6086
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 6256 transition count 6086
Applied a total of 44 rules in 5031 ms. Remains 6256 /6277 variables (removed 21) and now considering 6086/6109 (removed 23) transitions.
// Phase 1: matrix 6086 rows 6256 cols
[2023-03-11 07:23:30] [INFO ] Computed 514 place invariants in 69 ms
[2023-03-11 07:23:33] [INFO ] Implicit Places using invariants in 2642 ms returned []
[2023-03-11 07:23:33] [INFO ] Invariant cache hit.
[2023-03-11 07:23:35] [INFO ] Implicit Places using invariants and state equation in 2079 ms returned []
Implicit Place search using SMT with State Equation took 4732 ms to find 0 implicit places.
[2023-03-11 07:23:35] [INFO ] Invariant cache hit.
[2023-03-11 07:23:41] [INFO ] Dead Transitions using invariants and state equation in 6360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6256/6277 places, 6086/6109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16125 ms. Remains : 6256/6277 places, 6086/6109 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s2951 1), p0:(EQ s1052 1), p1:(AND (EQ s1830 1) (EQ s4657 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28 reset in 831 ms.
Product exploration explored 100000 steps with 29 reset in 1032 ms.
Computed a total of 1580 stabilizing places and 1580 stable transitions
Computed a total of 1580 stabilizing places and 1580 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (OR (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1192 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 07:23:46] [INFO ] Invariant cache hit.
[2023-03-11 07:23:49] [INFO ] [Real]Absence check using 513 positive place invariants in 851 ms returned sat
[2023-03-11 07:23:49] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 41 ms returned sat
[2023-03-11 07:23:55] [INFO ] After 5933ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-11 07:24:00] [INFO ] Deduced a trap composed of 1109 places in 4232 ms of which 20 ms to minimize.
[2023-03-11 07:24:04] [INFO ] Deduced a trap composed of 1120 places in 3939 ms of which 16 ms to minimize.
[2023-03-11 07:24:08] [INFO ] Deduced a trap composed of 63 places in 4072 ms of which 4 ms to minimize.
[2023-03-11 07:24:13] [INFO ] Deduced a trap composed of 77 places in 4675 ms of which 4 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 07:24:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 07:24:13] [INFO ] After 26743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 294 ms.
Support contains 4 out of 6256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6256/6256 places, 6086/6086 transitions.
Drop transitions removed 2538 transitions
Trivial Post-agglo rules discarded 2538 transitions
Performed 2538 trivial Post agglomeration. Transition count delta: 2538
Iterating post reduction 0 with 2538 rules applied. Total rules applied 2538 place count 6256 transition count 3548
Reduce places removed 2538 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2826 rules applied. Total rules applied 5364 place count 3718 transition count 3260
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5557 place count 3526 transition count 3259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5558 place count 3525 transition count 3259
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 5558 place count 3525 transition count 2558
Deduced a syphon composed of 701 places in 32 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 4 with 1402 rules applied. Total rules applied 6960 place count 2824 transition count 2558
Performed 1145 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1145 places in 0 ms
Reduce places removed 1145 places and 0 transitions.
Iterating global reduction 4 with 2290 rules applied. Total rules applied 9250 place count 1679 transition count 1269
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 286 times.
Iterating global reduction 4 with 286 rules applied. Total rules applied 9536 place count 1679 transition count 983
Reduce places removed 286 places and 0 transitions.
Iterating post reduction 4 with 286 rules applied. Total rules applied 9822 place count 1393 transition count 983
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9823 place count 1392 transition count 982
Reduce places removed 405 places and 0 transitions.
Drop transitions removed 645 transitions
Trivial Post-agglo rules discarded 645 transitions
Performed 645 trivial Post agglomeration. Transition count delta: 645
Iterating post reduction 5 with 1050 rules applied. Total rules applied 10873 place count 987 transition count 337
Reduce places removed 645 places and 0 transitions.
Iterating post reduction 6 with 645 rules applied. Total rules applied 11518 place count 342 transition count 337
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 113 Pre rules applied. Total rules applied 11518 place count 342 transition count 224
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 7 with 226 rules applied. Total rules applied 11744 place count 229 transition count 224
Applied a total of 11744 rules in 1066 ms. Remains 229 /6256 variables (removed 6027) and now considering 224/6086 (removed 5862) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1066 ms. Remains : 229/6256 places, 224/6086 transitions.
Finished random walk after 3701 steps, including 45 resets, run visited all 6 properties in 99 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (OR (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F p0), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND (NOT p2) p0)), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 15 factoid took 1123 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
[2023-03-11 07:24:16] [INFO ] Invariant cache hit.
[2023-03-11 07:24:23] [INFO ] [Real]Absence check using 513 positive place invariants in 1630 ms returned sat
[2023-03-11 07:24:23] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 35 ms returned sat
[2023-03-11 07:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:24:31] [INFO ] [Real]Absence check using state equation in 8381 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 6256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6256/6256 places, 6086/6086 transitions.
Applied a total of 0 rules in 1121 ms. Remains 6256 /6256 variables (removed 0) and now considering 6086/6086 (removed 0) transitions.
[2023-03-11 07:24:32] [INFO ] Invariant cache hit.
[2023-03-11 07:24:34] [INFO ] Implicit Places using invariants in 1909 ms returned []
[2023-03-11 07:24:34] [INFO ] Invariant cache hit.
[2023-03-11 07:24:36] [INFO ] Implicit Places using invariants and state equation in 2226 ms returned []
Implicit Place search using SMT with State Equation took 4141 ms to find 0 implicit places.
[2023-03-11 07:24:36] [INFO ] Invariant cache hit.
[2023-03-11 07:24:42] [INFO ] Dead Transitions using invariants and state equation in 5668 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10949 ms. Remains : 6256/6256 places, 6086/6086 transitions.
Computed a total of 1580 stabilizing places and 1580 stable transitions
Computed a total of 1580 stabilizing places and 1580 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) p1))), (X (OR p2 (NOT p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p2 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 779 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 07:24:44] [INFO ] Invariant cache hit.
[2023-03-11 07:24:46] [INFO ] [Real]Absence check using 513 positive place invariants in 895 ms returned sat
[2023-03-11 07:24:46] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 27 ms returned sat
[2023-03-11 07:24:52] [INFO ] After 5491ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-11 07:24:57] [INFO ] Deduced a trap composed of 1109 places in 4072 ms of which 25 ms to minimize.
[2023-03-11 07:25:01] [INFO ] Deduced a trap composed of 1120 places in 3861 ms of which 4 ms to minimize.
[2023-03-11 07:25:05] [INFO ] Deduced a trap composed of 63 places in 4358 ms of which 4 ms to minimize.
[2023-03-11 07:25:10] [INFO ] Deduced a trap composed of 77 places in 4792 ms of which 4 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 07:25:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 07:25:10] [INFO ] After 26383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 150 ms.
Support contains 4 out of 6256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6256/6256 places, 6086/6086 transitions.
Drop transitions removed 2538 transitions
Trivial Post-agglo rules discarded 2538 transitions
Performed 2538 trivial Post agglomeration. Transition count delta: 2538
Iterating post reduction 0 with 2538 rules applied. Total rules applied 2538 place count 6256 transition count 3548
Reduce places removed 2538 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2826 rules applied. Total rules applied 5364 place count 3718 transition count 3260
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5557 place count 3526 transition count 3259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5558 place count 3525 transition count 3259
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 5558 place count 3525 transition count 2558
Deduced a syphon composed of 701 places in 26 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 4 with 1402 rules applied. Total rules applied 6960 place count 2824 transition count 2558
Performed 1145 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1145 places in 1 ms
Reduce places removed 1145 places and 0 transitions.
Iterating global reduction 4 with 2290 rules applied. Total rules applied 9250 place count 1679 transition count 1269
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 286 times.
Iterating global reduction 4 with 286 rules applied. Total rules applied 9536 place count 1679 transition count 983
Reduce places removed 286 places and 0 transitions.
Iterating post reduction 4 with 286 rules applied. Total rules applied 9822 place count 1393 transition count 983
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9823 place count 1392 transition count 982
Reduce places removed 405 places and 0 transitions.
Drop transitions removed 645 transitions
Trivial Post-agglo rules discarded 645 transitions
Performed 645 trivial Post agglomeration. Transition count delta: 645
Iterating post reduction 5 with 1050 rules applied. Total rules applied 10873 place count 987 transition count 337
Reduce places removed 645 places and 0 transitions.
Iterating post reduction 6 with 645 rules applied. Total rules applied 11518 place count 342 transition count 337
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 113 Pre rules applied. Total rules applied 11518 place count 342 transition count 224
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 7 with 226 rules applied. Total rules applied 11744 place count 229 transition count 224
Applied a total of 11744 rules in 930 ms. Remains 229 /6256 variables (removed 6027) and now considering 224/6086 (removed 5862) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 930 ms. Remains : 229/6256 places, 224/6086 transitions.
Incomplete random walk after 10000 steps, including 155 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Finished Best-First random walk after 784 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=196 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) p1))), (X (OR p2 (NOT p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p2 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F p0), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 15 factoid took 1066 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
[2023-03-11 07:25:14] [INFO ] Invariant cache hit.
[2023-03-11 07:25:20] [INFO ] [Real]Absence check using 513 positive place invariants in 1535 ms returned sat
[2023-03-11 07:25:20] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 94 ms returned sat
[2023-03-11 07:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:25:29] [INFO ] [Real]Absence check using state equation in 8487 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 29 reset in 950 ms.
Product exploration explored 100000 steps with 29 reset in 1083 ms.
Built C files in :
/tmp/ltsmin12818475270724817702
[2023-03-11 07:25:31] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12818475270724817702
Running compilation step : cd /tmp/ltsmin12818475270724817702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12818475270724817702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12818475270724817702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 6256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6256/6256 places, 6086/6086 transitions.
Applied a total of 0 rules in 1070 ms. Remains 6256 /6256 variables (removed 0) and now considering 6086/6086 (removed 0) transitions.
[2023-03-11 07:25:36] [INFO ] Invariant cache hit.
[2023-03-11 07:25:38] [INFO ] Implicit Places using invariants in 1997 ms returned []
[2023-03-11 07:25:38] [INFO ] Invariant cache hit.
[2023-03-11 07:25:40] [INFO ] Implicit Places using invariants and state equation in 2187 ms returned []
Implicit Place search using SMT with State Equation took 4188 ms to find 0 implicit places.
[2023-03-11 07:25:40] [INFO ] Invariant cache hit.
[2023-03-11 07:25:46] [INFO ] Dead Transitions using invariants and state equation in 5812 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11072 ms. Remains : 6256/6256 places, 6086/6086 transitions.
Built C files in :
/tmp/ltsmin6043507395598256680
[2023-03-11 07:25:46] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6043507395598256680
Running compilation step : cd /tmp/ltsmin6043507395598256680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6043507395598256680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6043507395598256680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 07:25:49] [INFO ] Flatten gal took : 185 ms
[2023-03-11 07:25:50] [INFO ] Flatten gal took : 176 ms
[2023-03-11 07:25:50] [INFO ] Time to serialize gal into /tmp/LTL953192929609209667.gal : 37 ms
[2023-03-11 07:25:50] [INFO ] Time to serialize properties into /tmp/LTL4380692532507626491.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL953192929609209667.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10840580407375810969.hoa' '-atoms' '/tmp/LTL4380692532507626491.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4380692532507626491.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10840580407375810969.hoa
Detected timeout of ITS tools.
[2023-03-11 07:26:05] [INFO ] Flatten gal took : 159 ms
[2023-03-11 07:26:05] [INFO ] Flatten gal took : 163 ms
[2023-03-11 07:26:05] [INFO ] Time to serialize gal into /tmp/LTL16835466463466184927.gal : 30 ms
[2023-03-11 07:26:05] [INFO ] Time to serialize properties into /tmp/LTL10734676798984504283.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16835466463466184927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10734676798984504283.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(p1497==1)")&&(X(("(p1497==1)")U((!("((p2814==1)&&(p6198==1))"))||(G("(p1497==1)"))))))))||((X(F(("(p1497==1)")&&(X(("(p14...244
Formula 0 simplified : G(FG(!"(p1497==1)" | X(!"(p1497==1)" M "((p2814==1)&&(p6198==1))")) & (F!"(p4375!=1)" | XG(!"(p1497==1)" | X(!"(p1497==1)" M "((p281...178
Detected timeout of ITS tools.
[2023-03-11 07:26:21] [INFO ] Flatten gal took : 200 ms
[2023-03-11 07:26:21] [INFO ] Applying decomposition
[2023-03-11 07:26:21] [INFO ] Flatten gal took : 176 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9939144325621437504.txt' '-o' '/tmp/graph9939144325621437504.bin' '-w' '/tmp/graph9939144325621437504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9939144325621437504.bin' '-l' '-1' '-v' '-w' '/tmp/graph9939144325621437504.weights' '-q' '0' '-e' '0.001'
[2023-03-11 07:26:21] [INFO ] Decomposing Gal with order
[2023-03-11 07:26:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:26:24] [INFO ] Removed a total of 1110 redundant transitions.
[2023-03-11 07:26:24] [INFO ] Flatten gal took : 543 ms
[2023-03-11 07:26:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2023-03-11 07:26:25] [INFO ] Time to serialize gal into /tmp/LTL2486817196743093420.gal : 69 ms
[2023-03-11 07:26:25] [INFO ] Time to serialize properties into /tmp/LTL16738689807949534341.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2486817196743093420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16738689807949534341.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(i17.u448.p1497==1)")&&(X(("(i17.u448.p1497==1)")U((!("((i23.u786.p2814==1)&&(i23.u1963.p6198==1))"))||(G("(i17.u448.p1497...355
Formula 0 simplified : G(FG(!"(i17.u448.p1497==1)" | X(!"(i17.u448.p1497==1)" M "((i23.u786.p2814==1)&&(i23.u1963.p6198==1))")) & (F!"(i37.i1.i1.i0.u1231.p...271
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7422679798552817243
[2023-03-11 07:26:40] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7422679798552817243
Running compilation step : cd /tmp/ltsmin7422679798552817243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7422679798552817243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7422679798552817243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutoFlight-PT-96b-LTLFireability-02 finished in 197467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(G(p1))))||G(p2))))'
Support contains 3 out of 6277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 6265 transition count 6097
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 6265 transition count 6097
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 6265 transition count 6095
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 6259 transition count 6089
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 6259 transition count 6089
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 6256 transition count 6086
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 6256 transition count 6086
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 6255 transition count 6085
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 6255 transition count 6085
Applied a total of 46 rules in 5386 ms. Remains 6255 /6277 variables (removed 22) and now considering 6085/6109 (removed 24) transitions.
// Phase 1: matrix 6085 rows 6255 cols
[2023-03-11 07:26:48] [INFO ] Computed 514 place invariants in 77 ms
[2023-03-11 07:26:50] [INFO ] Implicit Places using invariants in 1915 ms returned []
[2023-03-11 07:26:50] [INFO ] Invariant cache hit.
[2023-03-11 07:26:53] [INFO ] Implicit Places using invariants and state equation in 2424 ms returned []
Implicit Place search using SMT with State Equation took 4353 ms to find 0 implicit places.
[2023-03-11 07:26:53] [INFO ] Invariant cache hit.
[2023-03-11 07:26:58] [INFO ] Dead Transitions using invariants and state equation in 5114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6255/6277 places, 6085/6109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14857 ms. Remains : 6255/6277 places, 6085/6109 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s2632 0), p0:(EQ s2961 1), p1:(EQ s739 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]]
Stuttering criterion allowed to conclude after 3703 steps with 0 reset in 54 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-03 finished in 15294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 6277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2549 transitions
Trivial Post-agglo rules discarded 2549 transitions
Performed 2549 trivial Post agglomeration. Transition count delta: 2549
Iterating post reduction 0 with 2549 rules applied. Total rules applied 2549 place count 6276 transition count 3559
Reduce places removed 2549 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2839 rules applied. Total rules applied 5388 place count 3727 transition count 3269
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 5580 place count 3535 transition count 3269
Performed 702 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 702 Pre rules applied. Total rules applied 5580 place count 3535 transition count 2567
Deduced a syphon composed of 702 places in 41 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 3 with 1404 rules applied. Total rules applied 6984 place count 2833 transition count 2567
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 6992 place count 2825 transition count 2559
Iterating global reduction 3 with 8 rules applied. Total rules applied 7000 place count 2825 transition count 2559
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 7000 place count 2825 transition count 2555
Deduced a syphon composed of 4 places in 32 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 7008 place count 2821 transition count 2555
Performed 1144 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1144 places in 1 ms
Reduce places removed 1144 places and 0 transitions.
Iterating global reduction 3 with 2288 rules applied. Total rules applied 9296 place count 1677 transition count 1267
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9297 place count 1676 transition count 1266
Reduce places removed 191 places and 0 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 3 with 286 rules applied. Total rules applied 9583 place count 1485 transition count 1171
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 4 with 95 rules applied. Total rules applied 9678 place count 1390 transition count 1171
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 96 Pre rules applied. Total rules applied 9678 place count 1390 transition count 1075
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 9870 place count 1294 transition count 1075
Applied a total of 9870 rules in 1287 ms. Remains 1294 /6277 variables (removed 4983) and now considering 1075/6109 (removed 5034) transitions.
// Phase 1: matrix 1075 rows 1294 cols
[2023-03-11 07:26:59] [INFO ] Computed 323 place invariants in 9 ms
[2023-03-11 07:27:00] [INFO ] Implicit Places using invariants in 840 ms returned [507, 581, 655, 693, 731, 805, 879, 917, 955, 959, 963, 967, 971, 975, 979, 983, 987, 991, 995, 999, 1003, 1007, 1011, 1015, 1019, 1023, 1027, 1031, 1035, 1039, 1043, 1047, 1051, 1055, 1059, 1063, 1067, 1071, 1075, 1079, 1083, 1087, 1091, 1095, 1099, 1103, 1107, 1111, 1115, 1119, 1123, 1127, 1131, 1135, 1139, 1143, 1147, 1149, 1151, 1153, 1155, 1157, 1159, 1161, 1163, 1165, 1167, 1169, 1171, 1175, 1179, 1183, 1187, 1191, 1195, 1199, 1203, 1208, 1212, 1216, 1220, 1222, 1224, 1226, 1228, 1230, 1232, 1234, 1236, 1238, 1240, 1242, 1244, 1248, 1252, 1256, 1260, 1264, 1268, 1272, 1276, 1280, 1284, 1288, 1293]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 845 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1189/6277 places, 1075/6109 transitions.
Graph (trivial) has 496 edges and 1189 vertex of which 25 / 1189 are part of one of the 1 SCC in 6 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1086 transition count 949
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1086 transition count 949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 163 place count 1082 transition count 945
Iterating global reduction 0 with 4 rules applied. Total rules applied 167 place count 1082 transition count 945
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 171 place count 1078 transition count 941
Iterating global reduction 0 with 4 rules applied. Total rules applied 175 place count 1078 transition count 941
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 179 place count 1074 transition count 937
Iterating global reduction 0 with 4 rules applied. Total rules applied 183 place count 1074 transition count 937
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 187 place count 1070 transition count 933
Iterating global reduction 0 with 4 rules applied. Total rules applied 191 place count 1070 transition count 933
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 195 place count 1066 transition count 929
Iterating global reduction 0 with 4 rules applied. Total rules applied 199 place count 1066 transition count 929
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 203 place count 1062 transition count 925
Iterating global reduction 0 with 4 rules applied. Total rules applied 207 place count 1062 transition count 925
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 211 place count 1058 transition count 921
Iterating global reduction 0 with 4 rules applied. Total rules applied 215 place count 1058 transition count 921
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 219 place count 1054 transition count 917
Iterating global reduction 0 with 4 rules applied. Total rules applied 223 place count 1054 transition count 917
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 227 place count 1050 transition count 913
Iterating global reduction 0 with 4 rules applied. Total rules applied 231 place count 1050 transition count 913
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 235 place count 1046 transition count 909
Iterating global reduction 0 with 4 rules applied. Total rules applied 239 place count 1046 transition count 909
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 243 place count 1042 transition count 905
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 1042 transition count 905
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 251 place count 1038 transition count 901
Iterating global reduction 0 with 4 rules applied. Total rules applied 255 place count 1038 transition count 901
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1036 transition count 899
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1036 transition count 899
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1034 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1034 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1032 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1032 transition count 895
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1030 transition count 893
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1030 transition count 893
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1028 transition count 891
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1028 transition count 891
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1026 transition count 889
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1026 transition count 889
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1024 transition count 887
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1024 transition count 887
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1022 transition count 885
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1022 transition count 885
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1020 transition count 883
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1020 transition count 883
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1018 transition count 881
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1018 transition count 881
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1016 transition count 879
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1016 transition count 879
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1014 transition count 877
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1014 transition count 877
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 305 place count 1013 transition count 876
Applied a total of 305 rules in 877 ms. Remains 1013 /1189 variables (removed 176) and now considering 876/1075 (removed 199) transitions.
// Phase 1: matrix 876 rows 1013 cols
[2023-03-11 07:27:01] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-11 07:27:02] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-11 07:27:02] [INFO ] Invariant cache hit.
[2023-03-11 07:27:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:27:03] [INFO ] Implicit Places using invariants and state equation in 1581 ms returned []
Implicit Place search using SMT with State Equation took 2014 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1013/6277 places, 876/6109 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5023 ms. Remains : 1013/6277 places, 876/6109 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-04 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:(NEQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 449 reset in 1123 ms.
Product exploration explored 100000 steps with 446 reset in 1106 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 195 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 120 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 348592 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 348592 steps, saw 101560 distinct states, run finished after 3006 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:27:09] [INFO ] Invariant cache hit.
[2023-03-11 07:27:10] [INFO ] [Real]Absence check using 218 positive place invariants in 45 ms returned sat
[2023-03-11 07:27:10] [INFO ] After 378ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 07:27:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:27:10] [INFO ] After 43ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:27:10] [INFO ] After 650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:27:10] [INFO ] [Nat]Absence check using 218 positive place invariants in 68 ms returned sat
[2023-03-11 07:27:11] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:27:11] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:27:11] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-11 07:27:11] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 1013 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1013/1013 places, 876/876 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1013 transition count 875
Free-agglomeration rule applied 368 times.
Iterating global reduction 1 with 368 rules applied. Total rules applied 369 place count 1013 transition count 507
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t635.t1249 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 499 edges and 429 vertex of which 305 / 429 are part of one of the 1 SCC in 0 ms
Free SCC test removed 304 places
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 1 with 115 rules applied. Total rules applied 484 place count 125 transition count 393
Reduce places removed 112 places and 0 transitions.
Drop transitions removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Iterating post reduction 2 with 492 rules applied. Total rules applied 976 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 976 place count 13 transition count 11
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 980 place count 11 transition count 11
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 982 place count 9 transition count 9
Iterating global reduction 3 with 2 rules applied. Total rules applied 984 place count 9 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 986 place count 8 transition count 8
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 12 edges and 8 vertex of which 6 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 988 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 989 place count 6 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 991 place count 6 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 993 place count 4 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 994 place count 4 transition count 3
Applied a total of 994 rules in 88 ms. Remains 4 /1013 variables (removed 1009) and now considering 3/876 (removed 873) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 4/1013 places, 3/876 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1013 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1013/1013 places, 876/876 transitions.
Applied a total of 0 rules in 64 ms. Remains 1013 /1013 variables (removed 0) and now considering 876/876 (removed 0) transitions.
[2023-03-11 07:27:11] [INFO ] Invariant cache hit.
[2023-03-11 07:27:12] [INFO ] Implicit Places using invariants in 647 ms returned []
[2023-03-11 07:27:12] [INFO ] Invariant cache hit.
[2023-03-11 07:27:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:27:14] [INFO ] Implicit Places using invariants and state equation in 1692 ms returned []
Implicit Place search using SMT with State Equation took 2365 ms to find 0 implicit places.
[2023-03-11 07:27:14] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-11 07:27:14] [INFO ] Invariant cache hit.
[2023-03-11 07:27:14] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3029 ms. Remains : 1013/1013 places, 876/876 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 233 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 91 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 45 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 358991 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 358991 steps, saw 103001 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:27:18] [INFO ] Invariant cache hit.
[2023-03-11 07:27:19] [INFO ] [Real]Absence check using 218 positive place invariants in 47 ms returned sat
[2023-03-11 07:27:19] [INFO ] After 382ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 07:27:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:27:19] [INFO ] After 43ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:27:19] [INFO ] After 705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:27:19] [INFO ] [Nat]Absence check using 218 positive place invariants in 48 ms returned sat
[2023-03-11 07:27:20] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:27:20] [INFO ] After 42ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:27:20] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-11 07:27:20] [INFO ] After 913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1013 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1013/1013 places, 876/876 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1013 transition count 875
Free-agglomeration rule applied 368 times.
Iterating global reduction 1 with 368 rules applied. Total rules applied 369 place count 1013 transition count 507
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t635.t1249 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 499 edges and 429 vertex of which 305 / 429 are part of one of the 1 SCC in 0 ms
Free SCC test removed 304 places
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 1 with 115 rules applied. Total rules applied 484 place count 125 transition count 393
Reduce places removed 112 places and 0 transitions.
Drop transitions removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Iterating post reduction 2 with 492 rules applied. Total rules applied 976 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 976 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 980 place count 11 transition count 11
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 982 place count 9 transition count 9
Iterating global reduction 3 with 2 rules applied. Total rules applied 984 place count 9 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 986 place count 8 transition count 8
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 12 edges and 8 vertex of which 6 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 988 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 989 place count 6 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 991 place count 6 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 993 place count 4 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 994 place count 4 transition count 3
Applied a total of 994 rules in 118 ms. Remains 4 /1013 variables (removed 1009) and now considering 3/876 (removed 873) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 4/1013 places, 3/876 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 201 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 115 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 447 reset in 1090 ms.
Product exploration explored 100000 steps with 444 reset in 1180 ms.
Built C files in :
/tmp/ltsmin2938810977321089446
[2023-03-11 07:27:23] [INFO ] Computing symmetric may disable matrix : 876 transitions.
[2023-03-11 07:27:23] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:27:23] [INFO ] Computing symmetric may enable matrix : 876 transitions.
[2023-03-11 07:27:23] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:27:23] [INFO ] Computing Do-Not-Accords matrix : 876 transitions.
[2023-03-11 07:27:23] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:27:23] [INFO ] Built C files in 192ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2938810977321089446
Running compilation step : cd /tmp/ltsmin2938810977321089446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2938810977321089446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2938810977321089446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 1013 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1013/1013 places, 876/876 transitions.
Applied a total of 0 rules in 29 ms. Remains 1013 /1013 variables (removed 0) and now considering 876/876 (removed 0) transitions.
[2023-03-11 07:27:26] [INFO ] Invariant cache hit.
[2023-03-11 07:27:27] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-11 07:27:27] [INFO ] Invariant cache hit.
[2023-03-11 07:27:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:27:28] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
[2023-03-11 07:27:28] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-11 07:27:28] [INFO ] Invariant cache hit.
[2023-03-11 07:27:29] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2809 ms. Remains : 1013/1013 places, 876/876 transitions.
Built C files in :
/tmp/ltsmin17334871644824293115
[2023-03-11 07:27:29] [INFO ] Computing symmetric may disable matrix : 876 transitions.
[2023-03-11 07:27:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:27:29] [INFO ] Computing symmetric may enable matrix : 876 transitions.
[2023-03-11 07:27:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:27:29] [INFO ] Computing Do-Not-Accords matrix : 876 transitions.
[2023-03-11 07:27:29] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:27:29] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17334871644824293115
Running compilation step : cd /tmp/ltsmin17334871644824293115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2423 ms.
Running link step : cd /tmp/ltsmin17334871644824293115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 144 ms.
Running LTSmin : cd /tmp/ltsmin17334871644824293115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14991881010893704310.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 07:27:44] [INFO ] Flatten gal took : 22 ms
[2023-03-11 07:27:44] [INFO ] Flatten gal took : 20 ms
[2023-03-11 07:27:44] [INFO ] Time to serialize gal into /tmp/LTL6286930539068559691.gal : 3 ms
[2023-03-11 07:27:44] [INFO ] Time to serialize properties into /tmp/LTL14148050255370529154.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6286930539068559691.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7327976218020429505.hoa' '-atoms' '/tmp/LTL14148050255370529154.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F("(i21.i1.i1.u11.p551!=1)"))))
Formula 0 simplified : FG!"(i21.i1.i1.u11.p551!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4841982849376069812
[2023-03-11 07:28:30] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4841982849376069812
Running compilation step : cd /tmp/ltsmin4841982849376069812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1377 ms.
Running link step : cd /tmp/ltsmin4841982849376069812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin4841982849376069812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-96b-LTLFireability-04 finished in 106784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 6277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2548 transitions
Trivial Post-agglo rules discarded 2548 transitions
Performed 2548 trivial Post agglomeration. Transition count delta: 2548
Iterating post reduction 0 with 2548 rules applied. Total rules applied 2548 place count 6276 transition count 3560
Reduce places removed 2548 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2838 rules applied. Total rules applied 5386 place count 3728 transition count 3270
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 5578 place count 3536 transition count 3270
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 701 Pre rules applied. Total rules applied 5578 place count 3536 transition count 2569
Deduced a syphon composed of 701 places in 29 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 3 with 1402 rules applied. Total rules applied 6980 place count 2835 transition count 2569
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 6989 place count 2826 transition count 2560
Iterating global reduction 3 with 9 rules applied. Total rules applied 6998 place count 2826 transition count 2560
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 6998 place count 2826 transition count 2555
Deduced a syphon composed of 5 places in 30 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 7008 place count 2821 transition count 2555
Performed 1143 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1143 places in 1 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 3 with 2286 rules applied. Total rules applied 9294 place count 1678 transition count 1268
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9295 place count 1677 transition count 1267
Reduce places removed 191 places and 0 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 3 with 286 rules applied. Total rules applied 9581 place count 1486 transition count 1172
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 4 with 95 rules applied. Total rules applied 9676 place count 1391 transition count 1172
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 96 Pre rules applied. Total rules applied 9676 place count 1391 transition count 1076
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 9868 place count 1295 transition count 1076
Applied a total of 9868 rules in 1015 ms. Remains 1295 /6277 variables (removed 4982) and now considering 1076/6109 (removed 5033) transitions.
// Phase 1: matrix 1076 rows 1295 cols
[2023-03-11 07:28:49] [INFO ] Computed 323 place invariants in 10 ms
[2023-03-11 07:28:50] [INFO ] Implicit Places using invariants in 1231 ms returned [508, 582, 656, 694, 732, 806, 880, 918, 956, 960, 964, 968, 972, 976, 980, 984, 988, 992, 996, 1000, 1004, 1008, 1012, 1016, 1020, 1024, 1028, 1032, 1036, 1040, 1044, 1048, 1052, 1056, 1060, 1064, 1068, 1072, 1076, 1080, 1084, 1088, 1092, 1096, 1100, 1104, 1108, 1112, 1116, 1120, 1124, 1128, 1132, 1136, 1140, 1144, 1148, 1150, 1152, 1154, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1176, 1180, 1184, 1188, 1192, 1196, 1200, 1204, 1209, 1213, 1217, 1221, 1223, 1225, 1227, 1229, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1249, 1253, 1257, 1261, 1265, 1269, 1273, 1277, 1281, 1285, 1289, 1294]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1235 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1190/6277 places, 1076/6109 transitions.
Graph (trivial) has 496 edges and 1190 vertex of which 25 / 1190 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1087 transition count 950
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1087 transition count 950
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 163 place count 1083 transition count 946
Iterating global reduction 0 with 4 rules applied. Total rules applied 167 place count 1083 transition count 946
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 171 place count 1079 transition count 942
Iterating global reduction 0 with 4 rules applied. Total rules applied 175 place count 1079 transition count 942
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 179 place count 1075 transition count 938
Iterating global reduction 0 with 4 rules applied. Total rules applied 183 place count 1075 transition count 938
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 187 place count 1071 transition count 934
Iterating global reduction 0 with 4 rules applied. Total rules applied 191 place count 1071 transition count 934
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 195 place count 1067 transition count 930
Iterating global reduction 0 with 4 rules applied. Total rules applied 199 place count 1067 transition count 930
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 203 place count 1063 transition count 926
Iterating global reduction 0 with 4 rules applied. Total rules applied 207 place count 1063 transition count 926
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 211 place count 1059 transition count 922
Iterating global reduction 0 with 4 rules applied. Total rules applied 215 place count 1059 transition count 922
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 219 place count 1055 transition count 918
Iterating global reduction 0 with 4 rules applied. Total rules applied 223 place count 1055 transition count 918
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 227 place count 1051 transition count 914
Iterating global reduction 0 with 4 rules applied. Total rules applied 231 place count 1051 transition count 914
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 235 place count 1047 transition count 910
Iterating global reduction 0 with 4 rules applied. Total rules applied 239 place count 1047 transition count 910
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 243 place count 1043 transition count 906
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 1043 transition count 906
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 251 place count 1039 transition count 902
Iterating global reduction 0 with 4 rules applied. Total rules applied 255 place count 1039 transition count 902
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1037 transition count 900
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1037 transition count 900
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1035 transition count 898
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1035 transition count 898
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1033 transition count 896
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1033 transition count 896
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1031 transition count 894
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1031 transition count 894
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1029 transition count 892
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1029 transition count 892
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1027 transition count 890
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1027 transition count 890
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1025 transition count 888
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1025 transition count 888
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1023 transition count 886
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1023 transition count 886
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1021 transition count 884
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1021 transition count 884
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1019 transition count 882
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1019 transition count 882
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1017 transition count 880
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1017 transition count 880
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1015 transition count 878
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1015 transition count 878
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 305 place count 1014 transition count 877
Applied a total of 305 rules in 560 ms. Remains 1014 /1190 variables (removed 176) and now considering 877/1076 (removed 199) transitions.
// Phase 1: matrix 877 rows 1014 cols
[2023-03-11 07:28:51] [INFO ] Computed 218 place invariants in 9 ms
[2023-03-11 07:28:51] [INFO ] Implicit Places using invariants in 593 ms returned []
[2023-03-11 07:28:51] [INFO ] Invariant cache hit.
[2023-03-11 07:28:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:28:53] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 2186 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1014/6277 places, 877/6109 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4996 ms. Remains : 1014/6277 places, 877/6109 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s227 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 0 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-05 finished in 7960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 6277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 6265 transition count 6097
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 6265 transition count 6097
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 6265 transition count 6095
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 6259 transition count 6089
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 6259 transition count 6089
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 6256 transition count 6086
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 6256 transition count 6086
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 6255 transition count 6085
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 6255 transition count 6085
Applied a total of 46 rules in 4393 ms. Remains 6255 /6277 variables (removed 22) and now considering 6085/6109 (removed 24) transitions.
// Phase 1: matrix 6085 rows 6255 cols
[2023-03-11 07:28:57] [INFO ] Computed 514 place invariants in 117 ms
[2023-03-11 07:28:59] [INFO ] Implicit Places using invariants in 2178 ms returned []
[2023-03-11 07:28:59] [INFO ] Invariant cache hit.
[2023-03-11 07:29:02] [INFO ] Implicit Places using invariants and state equation in 2133 ms returned []
Implicit Place search using SMT with State Equation took 4325 ms to find 0 implicit places.
[2023-03-11 07:29:02] [INFO ] Invariant cache hit.
[2023-03-11 07:29:07] [INFO ] Dead Transitions using invariants and state equation in 5410 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6255/6277 places, 6085/6109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14134 ms. Remains : 6255/6277 places, 6085/6109 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1535 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-07 finished in 14393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 3 out of 6277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6267 transition count 6099
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6267 transition count 6099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 6267 transition count 6098
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 6263 transition count 6094
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 6263 transition count 6094
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 6261 transition count 6092
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 6261 transition count 6092
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 6260 transition count 6091
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 6260 transition count 6091
Applied a total of 35 rules in 4428 ms. Remains 6260 /6277 variables (removed 17) and now considering 6091/6109 (removed 18) transitions.
// Phase 1: matrix 6091 rows 6260 cols
[2023-03-11 07:29:12] [INFO ] Computed 514 place invariants in 63 ms
[2023-03-11 07:29:14] [INFO ] Implicit Places using invariants in 2237 ms returned []
[2023-03-11 07:29:14] [INFO ] Invariant cache hit.
[2023-03-11 07:29:15] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 3054 ms to find 0 implicit places.
[2023-03-11 07:29:15] [INFO ] Invariant cache hit.
[2023-03-11 07:29:20] [INFO ] Dead Transitions using invariants and state equation in 5521 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6260/6277 places, 6091/6109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13005 ms. Remains : 6260/6277 places, 6091/6109 transitions.
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s1038 0) (EQ s480 0)), p1:(EQ s920 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3059 ms.
Product exploration explored 100000 steps with 50000 reset in 3017 ms.
Computed a total of 1583 stabilizing places and 1583 stable transitions
Computed a total of 1583 stabilizing places and 1583 stable transitions
Detected a total of 1583/6260 stabilizing places and 1583/6091 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 209 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-96b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-96b-LTLFireability-08 finished in 20047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 4 out of 6277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 6264 transition count 6096
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 6264 transition count 6096
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 6264 transition count 6094
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 6258 transition count 6088
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 6258 transition count 6088
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 6255 transition count 6085
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 6255 transition count 6085
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 6254 transition count 6084
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 6254 transition count 6084
Applied a total of 48 rules in 4701 ms. Remains 6254 /6277 variables (removed 23) and now considering 6084/6109 (removed 25) transitions.
// Phase 1: matrix 6084 rows 6254 cols
[2023-03-11 07:29:32] [INFO ] Computed 514 place invariants in 81 ms
[2023-03-11 07:29:34] [INFO ] Implicit Places using invariants in 2302 ms returned []
[2023-03-11 07:29:34] [INFO ] Invariant cache hit.
[2023-03-11 07:29:36] [INFO ] Implicit Places using invariants and state equation in 1750 ms returned []
Implicit Place search using SMT with State Equation took 4065 ms to find 0 implicit places.
[2023-03-11 07:29:36] [INFO ] Invariant cache hit.
[2023-03-11 07:29:42] [INFO ] Dead Transitions using invariants and state equation in 5805 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6254/6277 places, 6084/6109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14581 ms. Remains : 6254/6277 places, 6084/6109 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2122 1) (EQ s4785 1)), p1:(OR (EQ s148 1) (EQ s3866 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2207 ms.
Product exploration explored 100000 steps with 33333 reset in 2141 ms.
Computed a total of 1578 stabilizing places and 1578 stable transitions
Computed a total of 1578 stabilizing places and 1578 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-96b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-96b-LTLFireability-09 finished in 19758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
Support contains 3 out of 6277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2549 transitions
Trivial Post-agglo rules discarded 2549 transitions
Performed 2549 trivial Post agglomeration. Transition count delta: 2549
Iterating post reduction 0 with 2549 rules applied. Total rules applied 2549 place count 6276 transition count 3559
Reduce places removed 2549 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2839 rules applied. Total rules applied 5388 place count 3727 transition count 3269
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 5580 place count 3535 transition count 3269
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 701 Pre rules applied. Total rules applied 5580 place count 3535 transition count 2568
Deduced a syphon composed of 701 places in 33 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 3 with 1402 rules applied. Total rules applied 6982 place count 2834 transition count 2568
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 6990 place count 2826 transition count 2560
Iterating global reduction 3 with 8 rules applied. Total rules applied 6998 place count 2826 transition count 2560
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6998 place count 2826 transition count 2556
Deduced a syphon composed of 4 places in 33 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 7006 place count 2822 transition count 2556
Performed 1143 Post agglomeration using F-continuation condition with reduction of 143 identical transitions.
Deduced a syphon composed of 1143 places in 1 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 3 with 2286 rules applied. Total rules applied 9292 place count 1679 transition count 1270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9293 place count 1679 transition count 1269
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9294 place count 1678 transition count 1268
Reduce places removed 191 places and 0 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 4 with 286 rules applied. Total rules applied 9580 place count 1487 transition count 1173
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 5 with 95 rules applied. Total rules applied 9675 place count 1392 transition count 1173
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9675 place count 1392 transition count 1077
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9867 place count 1296 transition count 1077
Applied a total of 9867 rules in 1059 ms. Remains 1296 /6277 variables (removed 4981) and now considering 1077/6109 (removed 5032) transitions.
// Phase 1: matrix 1077 rows 1296 cols
[2023-03-11 07:29:48] [INFO ] Computed 323 place invariants in 4 ms
[2023-03-11 07:29:49] [INFO ] Implicit Places using invariants in 865 ms returned [508, 582, 656, 694, 732, 806, 880, 918, 956, 960, 964, 968, 972, 976, 980, 984, 988, 992, 996, 1000, 1004, 1008, 1012, 1016, 1020, 1024, 1028, 1032, 1036, 1040, 1044, 1048, 1052, 1056, 1060, 1064, 1068, 1072, 1076, 1080, 1084, 1088, 1092, 1096, 1100, 1104, 1108, 1112, 1116, 1120, 1124, 1128, 1132, 1136, 1140, 1144, 1148, 1150, 1152, 1154, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1176, 1180, 1184, 1188, 1192, 1196, 1200, 1205, 1210, 1214, 1218, 1222, 1224, 1226, 1228, 1230, 1232, 1234, 1236, 1238, 1240, 1242, 1244, 1246, 1250, 1254, 1258, 1262, 1266, 1270, 1274, 1278, 1282, 1286, 1290, 1295]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 867 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1191/6277 places, 1077/6109 transitions.
Graph (trivial) has 496 edges and 1191 vertex of which 25 / 1191 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1167 transition count 1029
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1166 transition count 1029
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 81 place count 1088 transition count 951
Iterating global reduction 2 with 78 rules applied. Total rules applied 159 place count 1088 transition count 951
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 163 place count 1084 transition count 947
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 1084 transition count 947
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 1080 transition count 943
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 1080 transition count 943
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 179 place count 1076 transition count 939
Iterating global reduction 2 with 4 rules applied. Total rules applied 183 place count 1076 transition count 939
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 187 place count 1072 transition count 935
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 1072 transition count 935
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 1068 transition count 931
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 1068 transition count 931
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 1064 transition count 927
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 1064 transition count 927
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 211 place count 1060 transition count 923
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 1060 transition count 923
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 219 place count 1056 transition count 919
Iterating global reduction 2 with 4 rules applied. Total rules applied 223 place count 1056 transition count 919
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 227 place count 1052 transition count 915
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 1052 transition count 915
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 235 place count 1048 transition count 911
Iterating global reduction 2 with 4 rules applied. Total rules applied 239 place count 1048 transition count 911
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 243 place count 1044 transition count 907
Iterating global reduction 2 with 4 rules applied. Total rules applied 247 place count 1044 transition count 907
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 251 place count 1040 transition count 903
Iterating global reduction 2 with 4 rules applied. Total rules applied 255 place count 1040 transition count 903
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 257 place count 1038 transition count 901
Iterating global reduction 2 with 2 rules applied. Total rules applied 259 place count 1038 transition count 901
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 261 place count 1036 transition count 899
Iterating global reduction 2 with 2 rules applied. Total rules applied 263 place count 1036 transition count 899
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 265 place count 1034 transition count 897
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 1034 transition count 897
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 269 place count 1032 transition count 895
Iterating global reduction 2 with 2 rules applied. Total rules applied 271 place count 1032 transition count 895
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 273 place count 1030 transition count 893
Iterating global reduction 2 with 2 rules applied. Total rules applied 275 place count 1030 transition count 893
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 277 place count 1028 transition count 891
Iterating global reduction 2 with 2 rules applied. Total rules applied 279 place count 1028 transition count 891
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 281 place count 1026 transition count 889
Iterating global reduction 2 with 2 rules applied. Total rules applied 283 place count 1026 transition count 889
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 285 place count 1024 transition count 887
Iterating global reduction 2 with 2 rules applied. Total rules applied 287 place count 1024 transition count 887
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 289 place count 1022 transition count 885
Iterating global reduction 2 with 2 rules applied. Total rules applied 291 place count 1022 transition count 885
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 293 place count 1020 transition count 883
Iterating global reduction 2 with 2 rules applied. Total rules applied 295 place count 1020 transition count 883
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 297 place count 1018 transition count 881
Iterating global reduction 2 with 2 rules applied. Total rules applied 299 place count 1018 transition count 881
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 301 place count 1016 transition count 879
Iterating global reduction 2 with 2 rules applied. Total rules applied 303 place count 1016 transition count 879
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 305 place count 1015 transition count 878
Applied a total of 305 rules in 531 ms. Remains 1015 /1191 variables (removed 176) and now considering 878/1077 (removed 199) transitions.
// Phase 1: matrix 878 rows 1015 cols
[2023-03-11 07:29:50] [INFO ] Computed 218 place invariants in 8 ms
[2023-03-11 07:29:50] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-11 07:29:50] [INFO ] Invariant cache hit.
[2023-03-11 07:29:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:29:52] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 2030 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1015/6277 places, 878/6109 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4487 ms. Remains : 1015/6277 places, 878/6109 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s978 1), p1:(EQ s163 0), p2:(EQ s286 1)], nbAcceptance=3, 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 5065 steps with 22 reset in 101 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-11 finished in 4696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))&&(F(p1)||G(p2)))))'
Support contains 3 out of 6277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 6265 transition count 6097
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 6265 transition count 6097
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 6265 transition count 6095
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 6260 transition count 6090
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 6260 transition count 6090
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 6258 transition count 6088
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 6258 transition count 6088
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 6257 transition count 6087
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 6257 transition count 6087
Applied a total of 42 rules in 4297 ms. Remains 6257 /6277 variables (removed 20) and now considering 6087/6109 (removed 22) transitions.
// Phase 1: matrix 6087 rows 6257 cols
[2023-03-11 07:29:56] [INFO ] Computed 514 place invariants in 64 ms
[2023-03-11 07:29:58] [INFO ] Implicit Places using invariants in 2208 ms returned []
[2023-03-11 07:29:58] [INFO ] Invariant cache hit.
[2023-03-11 07:30:01] [INFO ] Implicit Places using invariants and state equation in 2313 ms returned []
Implicit Place search using SMT with State Equation took 4535 ms to find 0 implicit places.
[2023-03-11 07:30:01] [INFO ] Invariant cache hit.
[2023-03-11 07:30:06] [INFO ] Dead Transitions using invariants and state equation in 5811 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6257/6277 places, 6087/6109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14658 ms. Remains : 6257/6277 places, 6087/6109 transitions.
Stuttering acceptance computed with spot in 433 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s2039 1), p2:(NEQ s5607 1), p0:(EQ s1663 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-13 finished in 15208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1 U (!p0||G(p1))))))'
Support contains 2 out of 6277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 6264 transition count 6096
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 6264 transition count 6096
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 6264 transition count 6094
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 6258 transition count 6088
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 6258 transition count 6088
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 6255 transition count 6085
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 6255 transition count 6085
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 6254 transition count 6084
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 6254 transition count 6084
Applied a total of 48 rules in 4682 ms. Remains 6254 /6277 variables (removed 23) and now considering 6084/6109 (removed 25) transitions.
// Phase 1: matrix 6084 rows 6254 cols
[2023-03-11 07:30:12] [INFO ] Computed 514 place invariants in 59 ms
[2023-03-11 07:30:14] [INFO ] Implicit Places using invariants in 2007 ms returned []
[2023-03-11 07:30:14] [INFO ] Invariant cache hit.
[2023-03-11 07:30:15] [INFO ] Implicit Places using invariants and state equation in 1820 ms returned []
Implicit Place search using SMT with State Equation took 3853 ms to find 0 implicit places.
[2023-03-11 07:30:16] [INFO ] Invariant cache hit.
[2023-03-11 07:30:21] [INFO ] Dead Transitions using invariants and state equation in 5241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6254/6277 places, 6084/6109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13804 ms. Remains : 6254/6277 places, 6084/6109 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1295 1), p1:(NEQ s5551 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 3808 steps with 0 reset in 41 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-14 finished in 14120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(F((p0&&X((p0 U (!p1||G(p0)))))))&&G(p2))||G(F((p0&&X((p0 U (!p1||G(p0))))))))))'
Found a Shortening insensitive property : AutoFlight-PT-96b-LTLFireability-02
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Support contains 4 out of 6277 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6277/6277 places, 6109/6109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2545 transitions
Trivial Post-agglo rules discarded 2545 transitions
Performed 2545 trivial Post agglomeration. Transition count delta: 2545
Iterating post reduction 0 with 2545 rules applied. Total rules applied 2545 place count 6276 transition count 3563
Reduce places removed 2545 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2835 rules applied. Total rules applied 5380 place count 3731 transition count 3273
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5573 place count 3539 transition count 3272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5574 place count 3538 transition count 3272
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 5574 place count 3538 transition count 2571
Deduced a syphon composed of 701 places in 28 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 4 with 1402 rules applied. Total rules applied 6976 place count 2837 transition count 2571
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 6985 place count 2828 transition count 2562
Iterating global reduction 4 with 9 rules applied. Total rules applied 6994 place count 2828 transition count 2562
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 6994 place count 2828 transition count 2557
Deduced a syphon composed of 5 places in 28 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 7004 place count 2823 transition count 2557
Performed 1144 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1144 places in 1 ms
Reduce places removed 1144 places and 0 transitions.
Iterating global reduction 4 with 2288 rules applied. Total rules applied 9292 place count 1679 transition count 1269
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9293 place count 1678 transition count 1268
Reduce places removed 191 places and 0 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 4 with 286 rules applied. Total rules applied 9579 place count 1487 transition count 1173
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 5 with 95 rules applied. Total rules applied 9674 place count 1392 transition count 1173
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9674 place count 1392 transition count 1077
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9866 place count 1296 transition count 1077
Applied a total of 9866 rules in 972 ms. Remains 1296 /6277 variables (removed 4981) and now considering 1077/6109 (removed 5032) transitions.
// Phase 1: matrix 1077 rows 1296 cols
[2023-03-11 07:30:22] [INFO ] Computed 323 place invariants in 10 ms
[2023-03-11 07:30:24] [INFO ] Implicit Places using invariants in 1166 ms returned [509, 583, 657, 695, 733, 807, 881, 919, 957, 961, 965, 969, 973, 977, 981, 985, 989, 993, 997, 1001, 1005, 1009, 1013, 1017, 1021, 1025, 1029, 1033, 1037, 1041, 1045, 1049, 1053, 1057, 1061, 1065, 1069, 1073, 1077, 1081, 1085, 1089, 1093, 1097, 1101, 1105, 1109, 1113, 1117, 1121, 1125, 1129, 1133, 1137, 1141, 1145, 1149, 1151, 1153, 1155, 1157, 1159, 1161, 1163, 1165, 1167, 1169, 1171, 1173, 1177, 1181, 1185, 1189, 1193, 1197, 1201, 1205, 1210, 1214, 1218, 1222, 1224, 1226, 1228, 1230, 1232, 1234, 1236, 1238, 1240, 1242, 1244, 1246, 1250, 1254, 1258, 1262, 1266, 1270, 1274, 1278, 1282, 1286, 1290, 1295]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1183 ms to find 105 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1191/6277 places, 1077/6109 transitions.
Graph (trivial) has 494 edges and 1191 vertex of which 25 / 1191 are part of one of the 1 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1088 transition count 951
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1088 transition count 951
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 163 place count 1084 transition count 947
Iterating global reduction 0 with 4 rules applied. Total rules applied 167 place count 1084 transition count 947
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 171 place count 1080 transition count 943
Iterating global reduction 0 with 4 rules applied. Total rules applied 175 place count 1080 transition count 943
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 179 place count 1076 transition count 939
Iterating global reduction 0 with 4 rules applied. Total rules applied 183 place count 1076 transition count 939
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 187 place count 1072 transition count 935
Iterating global reduction 0 with 4 rules applied. Total rules applied 191 place count 1072 transition count 935
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 195 place count 1068 transition count 931
Iterating global reduction 0 with 4 rules applied. Total rules applied 199 place count 1068 transition count 931
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 203 place count 1064 transition count 927
Iterating global reduction 0 with 4 rules applied. Total rules applied 207 place count 1064 transition count 927
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 211 place count 1060 transition count 923
Iterating global reduction 0 with 4 rules applied. Total rules applied 215 place count 1060 transition count 923
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 219 place count 1056 transition count 919
Iterating global reduction 0 with 4 rules applied. Total rules applied 223 place count 1056 transition count 919
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 227 place count 1052 transition count 915
Iterating global reduction 0 with 4 rules applied. Total rules applied 231 place count 1052 transition count 915
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 235 place count 1048 transition count 911
Iterating global reduction 0 with 4 rules applied. Total rules applied 239 place count 1048 transition count 911
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 243 place count 1044 transition count 907
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 1044 transition count 907
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 251 place count 1040 transition count 903
Iterating global reduction 0 with 4 rules applied. Total rules applied 255 place count 1040 transition count 903
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1038 transition count 901
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1038 transition count 901
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1036 transition count 899
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1036 transition count 899
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1034 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1034 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1032 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1032 transition count 895
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1030 transition count 893
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1030 transition count 893
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1028 transition count 891
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1028 transition count 891
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1026 transition count 889
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1026 transition count 889
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1024 transition count 887
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1024 transition count 887
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1022 transition count 885
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1022 transition count 885
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1020 transition count 883
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1020 transition count 883
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1018 transition count 881
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1018 transition count 881
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1016 transition count 879
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1016 transition count 879
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 305 place count 1015 transition count 878
Applied a total of 305 rules in 610 ms. Remains 1015 /1191 variables (removed 176) and now considering 878/1077 (removed 199) transitions.
// Phase 1: matrix 878 rows 1015 cols
[2023-03-11 07:30:24] [INFO ] Computed 218 place invariants in 4 ms
[2023-03-11 07:30:25] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-11 07:30:25] [INFO ] Invariant cache hit.
[2023-03-11 07:30:26] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1015/6277 places, 878/6109 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4812 ms. Remains : 1015/6277 places, 878/6109 transitions.
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s506 1), p0:(EQ s196 1), p1:(AND (EQ s433 1) (EQ s846 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property AutoFlight-PT-96b-LTLFireability-02 finished in 5154 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-11 07:30:26] [INFO ] Flatten gal took : 121 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6229778332512672931
[2023-03-11 07:30:27] [INFO ] Too many transitions (6109) to apply POR reductions. Disabling POR matrices.
[2023-03-11 07:30:27] [INFO ] Applying decomposition
[2023-03-11 07:30:27] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6229778332512672931
Running compilation step : cd /tmp/ltsmin6229778332512672931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 07:30:27] [INFO ] Flatten gal took : 126 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4712199765169845053.txt' '-o' '/tmp/graph4712199765169845053.bin' '-w' '/tmp/graph4712199765169845053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4712199765169845053.bin' '-l' '-1' '-v' '-w' '/tmp/graph4712199765169845053.weights' '-q' '0' '-e' '0.001'
[2023-03-11 07:30:27] [INFO ] Decomposing Gal with order
[2023-03-11 07:30:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:30:29] [INFO ] Removed a total of 1104 redundant transitions.
[2023-03-11 07:30:29] [INFO ] Flatten gal took : 335 ms
[2023-03-11 07:30:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2023-03-11 07:30:30] [INFO ] Time to serialize gal into /tmp/LTLFireability177319050327843224.gal : 61 ms
[2023-03-11 07:30:30] [INFO ] Time to serialize properties into /tmp/LTLFireability3500855156601916314.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability177319050327843224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3500855156601916314.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 2 LTL properties
Checking formula 0 : !((F(((X(F(("(i19.u457.p1497==1)")&&(X(("(i19.u457.p1497==1)")U((!("((i26.u792.p2814==1)&&(i26.u1969.p6198==1))"))||(G("(i19.u457.p149...355
Formula 0 simplified : G(FG(!"(i19.u457.p1497==1)" | X(!"(i19.u457.p1497==1)" M "((i26.u792.p2814==1)&&(i26.u1969.p6198==1))")) & (F!"(i70.i0.i1.i1.u1237.p...271
Compilation finished in 28417 ms.
Running link step : cd /tmp/ltsmin6229778332512672931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 117 ms.
Running LTSmin : cd /tmp/ltsmin6229778332512672931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X(<>(((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true))))))))&&[]((LTLAPp2==true)))||[](<>(((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 07:53:21] [INFO ] Applying decomposition
[2023-03-11 07:53:23] [INFO ] Flatten gal took : 1801 ms
[2023-03-11 07:53:26] [INFO ] Decomposing Gal with order
[2023-03-11 07:54:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:54:08] [INFO ] Removed a total of 206 redundant transitions.
[2023-03-11 07:54:08] [INFO ] Flatten gal took : 508 ms
[2023-03-11 07:55:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 10710 labels/synchronizations in 89891 ms.
[2023-03-11 07:55:55] [INFO ] Time to serialize gal into /tmp/LTLFireability2983253326180027203.gal : 2150 ms
[2023-03-11 07:55:56] [INFO ] Time to serialize properties into /tmp/LTLFireability10047544290424886974.ltl : 39 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2983253326180027203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10047544290424886974.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(((X(F(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....8243
Formula 0 simplified : G(FG(!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...6217
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin6229778332512672931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X(<>(((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true))))))))&&[]((LTLAPp2==true)))||[](<>(((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6229778332512672931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2023-03-11 08:11:56] [INFO ] Flatten gal took : 876 ms
[2023-03-11 08:12:02] [INFO ] Input system was already deterministic with 6109 transitions.
[2023-03-11 08:12:02] [INFO ] Transformed 6277 places.
[2023-03-11 08:12:02] [INFO ] Transformed 6109 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 08:12:12] [INFO ] Time to serialize gal into /tmp/LTLFireability13112428425930404129.gal : 41 ms
[2023-03-11 08:12:12] [INFO ] Time to serialize properties into /tmp/LTLFireability416368481510086926.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13112428425930404129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability416368481510086926.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(((X(F(("(p1497==1)")&&(X(("(p1497==1)")U((!("((p2814==1)&&(p6198==1))"))||(G("(p1497==1)"))))))))&&(G("(p4375!=1)")))||(G(F(("(p1...244
Formula 0 simplified : G(FG(!"(p1497==1)" | X(!"(p1497==1)" M "((p2814==1)&&(p6198==1))")) & (F!"(p4375!=1)" | XG(!"(p1497==1)" | X(!"(p1497==1)" M "((p281...178
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 5645148 kB
After kill :
MemTotal: 16393236 kB
MemFree: 15050860 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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="AutoFlight-PT-96b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-96b, 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 r005-oct2-167813593200524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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