Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 22:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 22:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 22:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 22:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 956K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716296774650

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 13:06:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 13:06:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:06:17] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2024-05-21 13:06:17] [INFO ] Transformed 3950 places.
[2024-05-21 13:06:17] [INFO ] Transformed 3936 transitions.
[2024-05-21 13:06:17] [INFO ] Found NUPN structural information;
[2024-05-21 13:06:17] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 594 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutoFlight-PT-48b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 3950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Discarding 500 places :
Symmetric choice reduction at 0 with 500 rule applications. Total rules 500 place count 3450 transition count 3436
Iterating global reduction 0 with 500 rules applied. Total rules applied 1000 place count 3450 transition count 3436
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 1071 place count 3450 transition count 3365
Discarding 236 places :
Symmetric choice reduction at 1 with 236 rule applications. Total rules 1307 place count 3214 transition count 3129
Iterating global reduction 1 with 236 rules applied. Total rules applied 1543 place count 3214 transition count 3129
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 1578 place count 3179 transition count 3094
Iterating global reduction 1 with 35 rules applied. Total rules applied 1613 place count 3179 transition count 3094
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 1648 place count 3144 transition count 3059
Iterating global reduction 1 with 35 rules applied. Total rules applied 1683 place count 3144 transition count 3059
Applied a total of 1683 rules in 3399 ms. Remains 3144 /3950 variables (removed 806) and now considering 3059/3936 (removed 877) transitions.
// Phase 1: matrix 3059 rows 3144 cols
[2024-05-21 13:06:21] [INFO ] Computed 258 invariants in 147 ms
[2024-05-21 13:06:25] [INFO ] Implicit Places using invariants in 3624 ms returned []
[2024-05-21 13:06:25] [INFO ] Invariant cache hit.
[2024-05-21 13:06:27] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 5655 ms to find 0 implicit places.
[2024-05-21 13:06:27] [INFO ] Invariant cache hit.
[2024-05-21 13:06:30] [INFO ] Dead Transitions using invariants and state equation in 3509 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3144/3950 places, 3059/3936 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12575 ms. Remains : 3144/3950 places, 3059/3936 transitions.
Support contains 30 out of 3144 places after structural reductions.
[2024-05-21 13:06:32] [INFO ] Flatten gal took : 560 ms
[2024-05-21 13:06:32] [INFO ] Flatten gal took : 189 ms
[2024-05-21 13:06:32] [INFO ] Input system was already deterministic with 3059 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 634 ms. (steps per millisecond=15 ) properties (out of 28) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-21 13:06:33] [INFO ] Invariant cache hit.
[2024-05-21 13:06:36] [INFO ] After 2068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-21 13:06:38] [INFO ] [Nat]Absence check using 257 positive place invariants in 707 ms returned sat
[2024-05-21 13:06:38] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 21 ms returned sat
[2024-05-21 13:06:45] [INFO ] After 5796ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-21 13:06:48] [INFO ] Deduced a trap composed of 166 places in 2244 ms of which 8 ms to minimize.
[2024-05-21 13:06:50] [INFO ] Deduced a trap composed of 69 places in 1968 ms of which 2 ms to minimize.
[2024-05-21 13:06:52] [INFO ] Deduced a trap composed of 67 places in 1582 ms of which 14 ms to minimize.
[2024-05-21 13:06:54] [INFO ] Deduced a trap composed of 91 places in 1877 ms of which 5 ms to minimize.
[2024-05-21 13:06:56] [INFO ] Deduced a trap composed of 326 places in 1784 ms of which 3 ms to minimize.
[2024-05-21 13:06:58] [INFO ] Deduced a trap composed of 195 places in 1760 ms of which 2 ms to minimize.
[2024-05-21 13:06:59] [INFO ] Deduced a trap composed of 324 places in 1707 ms of which 3 ms to minimize.
[2024-05-21 13:07:01] [INFO ] Deduced a trap composed of 324 places in 1493 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 13:07:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-21 13:07:01] [INFO ] After 25501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 8 properties in 1368 ms.
Support contains 5 out of 3144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Drop transitions removed 1273 transitions
Trivial Post-agglo rules discarded 1273 transitions
Performed 1273 trivial Post agglomeration. Transition count delta: 1273
Iterating post reduction 0 with 1273 rules applied. Total rules applied 1273 place count 3144 transition count 1786
Reduce places removed 1273 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1418 rules applied. Total rules applied 2691 place count 1871 transition count 1641
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2788 place count 1775 transition count 1640
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2789 place count 1774 transition count 1640
Performed 351 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 351 Pre rules applied. Total rules applied 2789 place count 1774 transition count 1289
Deduced a syphon composed of 351 places in 11 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 4 with 702 rules applied. Total rules applied 3491 place count 1423 transition count 1289
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 3495 place count 1419 transition count 1285
Iterating global reduction 4 with 4 rules applied. Total rules applied 3499 place count 1419 transition count 1285
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3499 place count 1419 transition count 1283
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3503 place count 1417 transition count 1283
Performed 568 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 568 places in 0 ms
Reduce places removed 568 places and 0 transitions.
Iterating global reduction 4 with 1136 rules applied. Total rules applied 4639 place count 849 transition count 645
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 4641 place count 849 transition count 643
Free-agglomeration rule applied 144 times.
Iterating global reduction 4 with 144 rules applied. Total rules applied 4785 place count 849 transition count 499
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 4929 place count 705 transition count 499
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4930 place count 704 transition count 498
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 5 with 523 rules applied. Total rules applied 5453 place count 504 transition count 175
Reduce places removed 323 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 324 rules applied. Total rules applied 5777 place count 181 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 5778 place count 180 transition count 174
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 54 Pre rules applied. Total rules applied 5778 place count 180 transition count 120
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 8 with 108 rules applied. Total rules applied 5886 place count 126 transition count 120
Applied a total of 5886 rules in 1066 ms. Remains 126 /3144 variables (removed 3018) and now considering 120/3059 (removed 2939) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1067 ms. Remains : 126/3144 places, 120/3059 transitions.
Finished random walk after 355 steps, including 0 resets, run visited all 6 properties in 25 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 796 stabilizing places and 796 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X((G(p1)||X(p2))))))'
Support contains 3 out of 3144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3134 transition count 3049
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3134 transition count 3049
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 3134 transition count 3048
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 3132 transition count 3046
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 3132 transition count 3046
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3131 transition count 3045
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3131 transition count 3045
Applied a total of 27 rules in 1877 ms. Remains 3131 /3144 variables (removed 13) and now considering 3045/3059 (removed 14) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2024-05-21 13:07:06] [INFO ] Computed 258 invariants in 121 ms
[2024-05-21 13:07:08] [INFO ] Implicit Places using invariants in 1800 ms returned []
[2024-05-21 13:07:08] [INFO ] Invariant cache hit.
[2024-05-21 13:07:09] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 3406 ms to find 0 implicit places.
[2024-05-21 13:07:09] [INFO ] Invariant cache hit.
[2024-05-21 13:07:13] [INFO ] Dead Transitions using invariants and state equation in 3113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3144 places, 3045/3059 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8412 ms. Remains : 3131/3144 places, 3045/3059 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 1054 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=8 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=8 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p1), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=9 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 8}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s2044 0), p1:(EQ s1363 0), p2:(EQ s2458 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 120 reset in 958 ms.
Product exploration explored 100000 steps with 112 reset in 724 ms.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Detected a total of 791/3131 stabilizing places and 791/3045 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 436 ms. Reduced automaton from 10 states, 42 edges and 3 AP (stutter sensitive) to 10 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 792 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-21 13:07:18] [INFO ] Invariant cache hit.
[2024-05-21 13:07:19] [INFO ] After 1063ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-21 13:07:20] [INFO ] [Nat]Absence check using 257 positive place invariants in 407 ms returned sat
[2024-05-21 13:07:20] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 10 ms returned sat
[2024-05-21 13:07:25] [INFO ] After 3854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-21 13:07:27] [INFO ] Deduced a trap composed of 31 places in 2252 ms of which 4 ms to minimize.
[2024-05-21 13:07:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2733 ms
[2024-05-21 13:07:30] [INFO ] Deduced a trap composed of 141 places in 2018 ms of which 2 ms to minimize.
[2024-05-21 13:07:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2416 ms
[2024-05-21 13:07:32] [INFO ] Deduced a trap composed of 59 places in 2074 ms of which 3 ms to minimize.
[2024-05-21 13:07:35] [INFO ] Deduced a trap composed of 67 places in 2026 ms of which 4 ms to minimize.
[2024-05-21 13:07:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4832 ms
[2024-05-21 13:07:38] [INFO ] After 16725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1872 ms.
[2024-05-21 13:07:39] [INFO ] After 20803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 728 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=91 )
Parikh walk visited 8 properties in 272 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 18 factoid took 1771 ms. Reduced automaton from 10 states, 42 edges and 3 AP (stutter sensitive) to 10 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 631 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 596 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Applied a total of 0 rules in 331 ms. Remains 3131 /3131 variables (removed 0) and now considering 3045/3045 (removed 0) transitions.
[2024-05-21 13:07:43] [INFO ] Invariant cache hit.
[2024-05-21 13:07:44] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2024-05-21 13:07:44] [INFO ] Invariant cache hit.
[2024-05-21 13:07:46] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 2618 ms to find 0 implicit places.
[2024-05-21 13:07:46] [INFO ] Invariant cache hit.
[2024-05-21 13:07:50] [INFO ] Dead Transitions using invariants and state equation in 4041 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6994 ms. Remains : 3131/3131 places, 3045/3045 transitions.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Detected a total of 791/3131 stabilizing places and 791/3045 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 628 ms. Reduced automaton from 10 states, 42 edges and 3 AP (stutter sensitive) to 10 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 432 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-21 13:07:52] [INFO ] Invariant cache hit.
[2024-05-21 13:07:53] [INFO ] After 895ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-21 13:07:54] [INFO ] [Nat]Absence check using 257 positive place invariants in 402 ms returned sat
[2024-05-21 13:07:54] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-21 13:07:59] [INFO ] After 3808ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-21 13:08:01] [INFO ] Deduced a trap composed of 31 places in 2084 ms of which 3 ms to minimize.
[2024-05-21 13:08:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2559 ms
[2024-05-21 13:08:04] [INFO ] Deduced a trap composed of 141 places in 2177 ms of which 3 ms to minimize.
[2024-05-21 13:08:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2654 ms
[2024-05-21 13:08:06] [INFO ] Deduced a trap composed of 59 places in 1824 ms of which 2 ms to minimize.
[2024-05-21 13:08:08] [INFO ] Deduced a trap composed of 67 places in 1763 ms of which 2 ms to minimize.
[2024-05-21 13:08:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4087 ms
[2024-05-21 13:08:10] [INFO ] After 15090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1260 ms.
[2024-05-21 13:08:11] [INFO ] After 18408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 745 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=93 )
Parikh walk visited 8 properties in 237 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 18 factoid took 2223 ms. Reduced automaton from 10 states, 42 edges and 3 AP (stutter sensitive) to 10 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 761 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 657 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 654 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 115 reset in 752 ms.
Product exploration explored 100000 steps with 124 reset in 783 ms.
Built C files in :
/tmp/ltsmin2212667265974286513
[2024-05-21 13:08:18] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2212667265974286513
Running compilation step : cd /tmp/ltsmin2212667265974286513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2212667265974286513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2212667265974286513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Applied a total of 0 rules in 336 ms. Remains 3131 /3131 variables (removed 0) and now considering 3045/3045 (removed 0) transitions.
[2024-05-21 13:08:21] [INFO ] Invariant cache hit.
[2024-05-21 13:08:22] [INFO ] Implicit Places using invariants in 1297 ms returned []
[2024-05-21 13:08:22] [INFO ] Invariant cache hit.
[2024-05-21 13:08:23] [INFO ] Implicit Places using invariants and state equation in 1200 ms returned []
Implicit Place search using SMT with State Equation took 2525 ms to find 0 implicit places.
[2024-05-21 13:08:23] [INFO ] Invariant cache hit.
[2024-05-21 13:08:27] [INFO ] Dead Transitions using invariants and state equation in 3333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6209 ms. Remains : 3131/3131 places, 3045/3045 transitions.
Built C files in :
/tmp/ltsmin2521148286806449060
[2024-05-21 13:08:27] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2521148286806449060
Running compilation step : cd /tmp/ltsmin2521148286806449060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2521148286806449060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2521148286806449060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 13:08:31] [INFO ] Flatten gal took : 203 ms
[2024-05-21 13:08:31] [INFO ] Flatten gal took : 185 ms
[2024-05-21 13:08:31] [INFO ] Time to serialize gal into /tmp/LTL13113655910490720000.gal : 30 ms
[2024-05-21 13:08:31] [INFO ] Time to serialize properties into /tmp/LTL14930549097838685115.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13113655910490720000.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2631825319952002471.hoa' '-atoms' '/tmp/LTL14930549097838685115.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14930549097838685115.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2631825319952002471.hoa
Detected timeout of ITS tools.
[2024-05-21 13:08:46] [INFO ] Flatten gal took : 94 ms
[2024-05-21 13:08:46] [INFO ] Flatten gal took : 87 ms
[2024-05-21 13:08:46] [INFO ] Time to serialize gal into /tmp/LTL11164393972096278361.gal : 47 ms
[2024-05-21 13:08:46] [INFO ] Time to serialize properties into /tmp/LTL1226254523469036826.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11164393972096278361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1226254523469036826.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(p2813==0)"))&&(X((G("(p2039==0)"))||(X("(p3235==0)")))))))
Formula 0 simplified : G(F!"(p2813==0)" | X(F!"(p2039==0)" & X!"(p3235==0)"))
Detected timeout of ITS tools.
[2024-05-21 13:09:02] [INFO ] Flatten gal took : 88 ms
[2024-05-21 13:09:02] [INFO ] Applying decomposition
[2024-05-21 13:09:02] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14260538681743171029.txt' '-o' '/tmp/graph14260538681743171029.bin' '-w' '/tmp/graph14260538681743171029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14260538681743171029.bin' '-l' '-1' '-v' '-w' '/tmp/graph14260538681743171029.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:09:02] [INFO ] Decomposing Gal with order
[2024-05-21 13:09:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:09:03] [INFO ] Removed a total of 558 redundant transitions.
[2024-05-21 13:09:03] [INFO ] Flatten gal took : 269 ms
[2024-05-21 13:09:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2024-05-21 13:09:03] [INFO ] Time to serialize gal into /tmp/LTL17140711469437810623.gal : 56 ms
[2024-05-21 13:09:03] [INFO ] Time to serialize properties into /tmp/LTL12411124138742935324.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17140711469437810623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12411124138742935324.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("(i40.u855.p2813==0)"))&&(X((G("(i47.u571.p2039==0)"))||(X("(i35.u1036.p3235==0)")))))))
Formula 0 simplified : G(F!"(i40.u855.p2813==0)" | X(F!"(i47.u571.p2039==0)" & X!"(i35.u1036.p3235==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11137845575961047071
[2024-05-21 13:09:19] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11137845575961047071
Running compilation step : cd /tmp/ltsmin11137845575961047071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11137845575961047071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11137845575961047071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutoFlight-PT-48b-LTLFireability-01 finished in 137470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 2 out of 3144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1274 transitions
Trivial Post-agglo rules discarded 1274 transitions
Performed 1274 trivial Post agglomeration. Transition count delta: 1274
Iterating post reduction 0 with 1274 rules applied. Total rules applied 1274 place count 3143 transition count 1784
Reduce places removed 1274 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1421 rules applied. Total rules applied 2695 place count 1869 transition count 1637
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2792 place count 1773 transition count 1636
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2793 place count 1772 transition count 1636
Performed 353 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 353 Pre rules applied. Total rules applied 2793 place count 1772 transition count 1283
Deduced a syphon composed of 353 places in 20 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 4 with 706 rules applied. Total rules applied 3499 place count 1419 transition count 1283
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 3505 place count 1413 transition count 1277
Iterating global reduction 4 with 6 rules applied. Total rules applied 3511 place count 1413 transition count 1277
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 3511 place count 1413 transition count 1274
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 3517 place count 1410 transition count 1274
Performed 567 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 567 places in 1 ms
Reduce places removed 567 places and 0 transitions.
Iterating global reduction 4 with 1134 rules applied. Total rules applied 4651 place count 843 transition count 637
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 4652 place count 842 transition count 636
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 4 with 142 rules applied. Total rules applied 4794 place count 747 transition count 589
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 4841 place count 700 transition count 589
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 4841 place count 700 transition count 541
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 4937 place count 652 transition count 541
Applied a total of 4937 rules in 780 ms. Remains 652 /3144 variables (removed 2492) and now considering 541/3059 (removed 2518) transitions.
// Phase 1: matrix 541 rows 652 cols
[2024-05-21 13:09:22] [INFO ] Computed 163 invariants in 4 ms
[2024-05-21 13:09:23] [INFO ] Implicit Places using invariants in 891 ms returned [257, 331, 369, 443, 481, 485, 489, 493, 497, 501, 505, 509, 513, 517, 521, 525, 529, 533, 537, 541, 545, 549, 553, 557, 561, 565, 569, 573, 577, 579, 582, 584, 586, 588, 590, 592, 594, 596, 598, 600, 602, 606, 610, 614, 618, 622, 626, 630, 634, 638, 642, 646, 651]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 906 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 599/3144 places, 541/3059 transitions.
Graph (trivial) has 246 edges and 599 vertex of which 12 / 599 are part of one of the 1 SCC in 4 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 548 transition count 480
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 548 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 83 place count 546 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 85 place count 546 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 87 place count 544 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 89 place count 544 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 91 place count 542 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 542 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 540 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 540 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 99 place count 538 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 101 place count 538 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 103 place count 536 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 105 place count 536 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 107 place count 534 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 109 place count 534 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 111 place count 532 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 532 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 115 place count 530 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 530 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 119 place count 528 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 121 place count 528 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 123 place count 526 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 125 place count 526 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 127 place count 524 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 129 place count 524 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 523 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 523 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 522 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 522 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 521 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 521 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 520 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 520 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 519 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 519 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 518 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 518 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 517 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 517 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 516 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 516 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 515 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 515 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 514 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 514 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 513 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 513 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 512 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 512 transition count 444
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 155 place count 511 transition count 443
Applied a total of 155 rules in 616 ms. Remains 511 /599 variables (removed 88) and now considering 443/541 (removed 98) transitions.
// Phase 1: matrix 443 rows 511 cols
[2024-05-21 13:09:24] [INFO ] Computed 110 invariants in 4 ms
[2024-05-21 13:09:25] [INFO ] Implicit Places using invariants in 675 ms returned []
[2024-05-21 13:09:25] [INFO ] Invariant cache hit.
[2024-05-21 13:09:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 13:09:26] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1727 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 511/3144 places, 443/3059 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4029 ms. Remains : 511/3144 places, 443/3059 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s147 1), p0:(EQ s247 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 109 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-02 finished in 4219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 3144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3133 transition count 3048
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3133 transition count 3048
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 3133 transition count 3047
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 3131 transition count 3045
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 3131 transition count 3045
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3130 transition count 3044
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3130 transition count 3044
Applied a total of 29 rules in 1986 ms. Remains 3130 /3144 variables (removed 14) and now considering 3044/3059 (removed 15) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2024-05-21 13:09:28] [INFO ] Computed 258 invariants in 20 ms
[2024-05-21 13:09:29] [INFO ] Implicit Places using invariants in 1490 ms returned []
[2024-05-21 13:09:29] [INFO ] Invariant cache hit.
[2024-05-21 13:09:31] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 2847 ms to find 0 implicit places.
[2024-05-21 13:09:31] [INFO ] Invariant cache hit.
[2024-05-21 13:09:34] [INFO ] Dead Transitions using invariants and state equation in 3426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3130/3144 places, 3044/3059 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8261 ms. Remains : 3130/3144 places, 3044/3059 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s2433 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 147 reset in 474 ms.
Product exploration explored 100000 steps with 150 reset in 497 ms.
Computed a total of 790 stabilizing places and 790 stable transitions
Computed a total of 790 stabilizing places and 790 stable transitions
Detected a total of 790/3130 stabilizing places and 790/3044 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 673 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=112 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 13:09:36] [INFO ] Invariant cache hit.
[2024-05-21 13:09:40] [INFO ] [Real]Absence check using 257 positive place invariants in 788 ms returned sat
[2024-05-21 13:09:40] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 23 ms returned sat
[2024-05-21 13:09:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 13:09:51] [INFO ] [Real]Absence check using state equation in 11372 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 3130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3130/3130 places, 3044/3044 transitions.
Applied a total of 0 rules in 516 ms. Remains 3130 /3130 variables (removed 0) and now considering 3044/3044 (removed 0) transitions.
[2024-05-21 13:09:51] [INFO ] Invariant cache hit.
[2024-05-21 13:09:53] [INFO ] Implicit Places using invariants in 1591 ms returned []
[2024-05-21 13:09:53] [INFO ] Invariant cache hit.
[2024-05-21 13:09:55] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 3125 ms to find 0 implicit places.
[2024-05-21 13:09:55] [INFO ] Invariant cache hit.
[2024-05-21 13:09:58] [INFO ] Dead Transitions using invariants and state equation in 2935 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6589 ms. Remains : 3130/3130 places, 3044/3044 transitions.
Computed a total of 790 stabilizing places and 790 stable transitions
Computed a total of 790 stabilizing places and 790 stable transitions
Detected a total of 790/3130 stabilizing places and 790/3044 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 676 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=135 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 13:09:59] [INFO ] Invariant cache hit.
[2024-05-21 13:10:02] [INFO ] [Real]Absence check using 257 positive place invariants in 508 ms returned sat
[2024-05-21 13:10:02] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 30 ms returned sat
[2024-05-21 13:10:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 13:10:14] [INFO ] [Real]Absence check using state equation in 11541 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 152 reset in 572 ms.
Product exploration explored 100000 steps with 150 reset in 504 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 3130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3130/3130 places, 3044/3044 transitions.
Performed 1138 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1138 rules applied. Total rules applied 1138 place count 3130 transition count 3044
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 96 rules applied. Total rules applied 1234 place count 3130 transition count 2996
Performed 423 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 423 Pre rules applied. Total rules applied 1234 place count 3130 transition count 2996
Deduced a syphon composed of 1609 places in 26 ms
Iterating global reduction 2 with 423 rules applied. Total rules applied 1657 place count 3130 transition count 2996
Discarding 1049 places :
Symmetric choice reduction at 2 with 1049 rule applications. Total rules 2706 place count 2081 transition count 1947
Deduced a syphon composed of 560 places in 18 ms
Iterating global reduction 2 with 1049 rules applied. Total rules applied 3755 place count 2081 transition count 1947
Performed 680 Post agglomeration using F-continuation condition with reduction of 72 identical transitions.
Deduced a syphon composed of 1240 places in 0 ms
Iterating global reduction 2 with 680 rules applied. Total rules applied 4435 place count 2081 transition count 1875
Renaming transitions due to excessive name length > 1024 char.
Discarding 423 places :
Symmetric choice reduction at 2 with 423 rule applications. Total rules 4858 place count 1658 transition count 1452
Deduced a syphon composed of 817 places in 0 ms
Iterating global reduction 2 with 423 rules applied. Total rules applied 5281 place count 1658 transition count 1452
Deduced a syphon composed of 817 places in 1 ms
Applied a total of 5281 rules in 3985 ms. Remains 1658 /3130 variables (removed 1472) and now considering 1452/3044 (removed 1592) transitions.
[2024-05-21 13:10:19] [INFO ] Redundant transitions in 137 ms returned []
// Phase 1: matrix 1452 rows 1658 cols
[2024-05-21 13:10:20] [INFO ] Computed 258 invariants in 103 ms
[2024-05-21 13:10:21] [INFO ] Dead Transitions using invariants and state equation in 2003 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1658/3130 places, 1452/3044 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6173 ms. Remains : 1658/3130 places, 1452/3044 transitions.
Built C files in :
/tmp/ltsmin16516262126335891096
[2024-05-21 13:10:21] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16516262126335891096
Running compilation step : cd /tmp/ltsmin16516262126335891096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16516262126335891096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16516262126335891096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 3130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3130/3130 places, 3044/3044 transitions.
Applied a total of 0 rules in 348 ms. Remains 3130 /3130 variables (removed 0) and now considering 3044/3044 (removed 0) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2024-05-21 13:10:25] [INFO ] Computed 258 invariants in 14 ms
[2024-05-21 13:10:26] [INFO ] Implicit Places using invariants in 1414 ms returned []
[2024-05-21 13:10:26] [INFO ] Invariant cache hit.
[2024-05-21 13:10:27] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 2641 ms to find 0 implicit places.
[2024-05-21 13:10:28] [INFO ] Invariant cache hit.
[2024-05-21 13:10:30] [INFO ] Dead Transitions using invariants and state equation in 2951 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5959 ms. Remains : 3130/3130 places, 3044/3044 transitions.
Built C files in :
/tmp/ltsmin12367828390549999008
[2024-05-21 13:10:31] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12367828390549999008
Running compilation step : cd /tmp/ltsmin12367828390549999008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12367828390549999008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12367828390549999008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 13:10:34] [INFO ] Flatten gal took : 152 ms
[2024-05-21 13:10:34] [INFO ] Flatten gal took : 106 ms
[2024-05-21 13:10:34] [INFO ] Time to serialize gal into /tmp/LTL2584090728287862914.gal : 53 ms
[2024-05-21 13:10:34] [INFO ] Time to serialize properties into /tmp/LTL6173399544336072874.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2584090728287862914.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10902329001821859155.hoa' '-atoms' '/tmp/LTL6173399544336072874.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6173399544336072874.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10902329001821859155.hoa
Detected timeout of ITS tools.
[2024-05-21 13:10:49] [INFO ] Flatten gal took : 130 ms
[2024-05-21 13:10:49] [INFO ] Flatten gal took : 131 ms
[2024-05-21 13:10:49] [INFO ] Time to serialize gal into /tmp/LTL12835580771015594962.gal : 31 ms
[2024-05-21 13:10:49] [INFO ] Time to serialize properties into /tmp/LTL2467234411252337895.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12835580771015594962.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2467234411252337895.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p3210==1)")))))
Formula 0 simplified : XXG!"(p3210==1)"
Detected timeout of ITS tools.
[2024-05-21 13:11:05] [INFO ] Flatten gal took : 79 ms
[2024-05-21 13:11:05] [INFO ] Applying decomposition
[2024-05-21 13:11:05] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2830758563248648437.txt' '-o' '/tmp/graph2830758563248648437.bin' '-w' '/tmp/graph2830758563248648437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2830758563248648437.bin' '-l' '-1' '-v' '-w' '/tmp/graph2830758563248648437.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:11:05] [INFO ] Decomposing Gal with order
[2024-05-21 13:11:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:11:06] [INFO ] Removed a total of 553 redundant transitions.
[2024-05-21 13:11:06] [INFO ] Flatten gal took : 206 ms
[2024-05-21 13:11:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 33 ms.
[2024-05-21 13:11:06] [INFO ] Time to serialize gal into /tmp/LTL5552537917387232736.gal : 61 ms
[2024-05-21 13:11:06] [INFO ] Time to serialize properties into /tmp/LTL11327930758334306244.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5552537917387232736.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11327930758334306244.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i34.u1030.p3210==1)")))))
Formula 0 simplified : XXG!"(i34.u1030.p3210==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4473382613344011214
[2024-05-21 13:11:21] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4473382613344011214
Running compilation step : cd /tmp/ltsmin4473382613344011214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4473382613344011214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4473382613344011214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutoFlight-PT-48b-LTLFireability-04 finished in 118689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||(p2 U p3))))'
Support contains 2 out of 3144 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1274 transitions
Trivial Post-agglo rules discarded 1274 transitions
Performed 1274 trivial Post agglomeration. Transition count delta: 1274
Iterating post reduction 0 with 1274 rules applied. Total rules applied 1274 place count 3143 transition count 1784
Reduce places removed 1274 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 1 with 1416 rules applied. Total rules applied 2690 place count 1869 transition count 1642
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 2 with 94 rules applied. Total rules applied 2784 place count 1775 transition count 1642
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 352 Pre rules applied. Total rules applied 2784 place count 1775 transition count 1290
Deduced a syphon composed of 352 places in 10 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 704 rules applied. Total rules applied 3488 place count 1423 transition count 1290
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3494 place count 1417 transition count 1284
Iterating global reduction 3 with 6 rules applied. Total rules applied 3500 place count 1417 transition count 1284
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 3500 place count 1417 transition count 1281
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 3506 place count 1414 transition count 1281
Performed 567 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 567 places in 0 ms
Reduce places removed 567 places and 0 transitions.
Iterating global reduction 3 with 1134 rules applied. Total rules applied 4640 place count 847 transition count 644
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4642 place count 846 transition count 644
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4643 place count 846 transition count 644
Applied a total of 4643 rules in 599 ms. Remains 846 /3144 variables (removed 2298) and now considering 644/3059 (removed 2415) transitions.
// Phase 1: matrix 644 rows 846 cols
[2024-05-21 13:11:25] [INFO ] Computed 258 invariants in 4 ms
[2024-05-21 13:11:28] [INFO ] Implicit Places using invariants in 2529 ms returned [256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 352, 353, 354, 355, 429, 467, 541, 579, 585, 591, 597, 603, 609, 615, 621, 627, 633, 639, 645, 651, 657, 663, 669, 675, 681, 687, 693, 699, 705, 711, 717, 723, 727, 731, 735, 739, 743, 747, 751, 755, 759, 763, 767, 771, 777, 784, 790, 796, 802, 808, 814, 820, 826, 832, 838, 845]
Discarding 147 places :
Implicit Place search using SMT only with invariants took 2542 ms to find 147 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 699/3144 places, 644/3059 transitions.
Graph (trivial) has 341 edges and 699 vertex of which 34 / 699 are part of one of the 1 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 666 transition count 530
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 595 transition count 530
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 183 place count 555 transition count 490
Iterating global reduction 2 with 40 rules applied. Total rules applied 223 place count 555 transition count 490
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 225 place count 553 transition count 488
Iterating global reduction 2 with 2 rules applied. Total rules applied 227 place count 553 transition count 488
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 229 place count 551 transition count 486
Iterating global reduction 2 with 2 rules applied. Total rules applied 231 place count 551 transition count 486
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 233 place count 549 transition count 484
Iterating global reduction 2 with 2 rules applied. Total rules applied 235 place count 549 transition count 484
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 237 place count 547 transition count 482
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 547 transition count 482
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 241 place count 545 transition count 480
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 545 transition count 480
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 245 place count 543 transition count 478
Iterating global reduction 2 with 2 rules applied. Total rules applied 247 place count 543 transition count 478
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 249 place count 541 transition count 476
Iterating global reduction 2 with 2 rules applied. Total rules applied 251 place count 541 transition count 476
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 253 place count 539 transition count 474
Iterating global reduction 2 with 2 rules applied. Total rules applied 255 place count 539 transition count 474
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 257 place count 537 transition count 472
Iterating global reduction 2 with 2 rules applied. Total rules applied 259 place count 537 transition count 472
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 261 place count 535 transition count 470
Iterating global reduction 2 with 2 rules applied. Total rules applied 263 place count 535 transition count 470
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 265 place count 533 transition count 468
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 533 transition count 468
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 269 place count 531 transition count 466
Iterating global reduction 2 with 2 rules applied. Total rules applied 271 place count 531 transition count 466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 272 place count 530 transition count 465
Iterating global reduction 2 with 1 rules applied. Total rules applied 273 place count 530 transition count 465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 274 place count 529 transition count 464
Iterating global reduction 2 with 1 rules applied. Total rules applied 275 place count 529 transition count 464
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 276 place count 528 transition count 463
Iterating global reduction 2 with 1 rules applied. Total rules applied 277 place count 528 transition count 463
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 278 place count 527 transition count 462
Iterating global reduction 2 with 1 rules applied. Total rules applied 279 place count 527 transition count 462
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 280 place count 526 transition count 461
Iterating global reduction 2 with 1 rules applied. Total rules applied 281 place count 526 transition count 461
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 282 place count 525 transition count 460
Iterating global reduction 2 with 1 rules applied. Total rules applied 283 place count 525 transition count 460
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 284 place count 524 transition count 459
Iterating global reduction 2 with 1 rules applied. Total rules applied 285 place count 524 transition count 459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 286 place count 523 transition count 458
Iterating global reduction 2 with 1 rules applied. Total rules applied 287 place count 523 transition count 458
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 288 place count 522 transition count 457
Iterating global reduction 2 with 1 rules applied. Total rules applied 289 place count 522 transition count 457
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 290 place count 521 transition count 456
Iterating global reduction 2 with 1 rules applied. Total rules applied 291 place count 521 transition count 456
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 292 place count 520 transition count 455
Iterating global reduction 2 with 1 rules applied. Total rules applied 293 place count 520 transition count 455
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 294 place count 519 transition count 454
Iterating global reduction 2 with 1 rules applied. Total rules applied 295 place count 519 transition count 454
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 297 place count 518 transition count 453
Applied a total of 297 rules in 550 ms. Remains 518 /699 variables (removed 181) and now considering 453/644 (removed 191) transitions.
// Phase 1: matrix 453 rows 518 cols
[2024-05-21 13:11:28] [INFO ] Computed 111 invariants in 3 ms
[2024-05-21 13:11:29] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-05-21 13:11:29] [INFO ] Invariant cache hit.
[2024-05-21 13:11:29] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:11:30] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 2118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 518/3144 places, 453/3059 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5821 ms. Remains : 518/3144 places, 453/3059 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s66 1), p3:(EQ s494 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-05 finished in 5877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1278 transitions
Trivial Post-agglo rules discarded 1278 transitions
Performed 1278 trivial Post agglomeration. Transition count delta: 1278
Iterating post reduction 0 with 1278 rules applied. Total rules applied 1278 place count 3143 transition count 1780
Reduce places removed 1278 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1425 rules applied. Total rules applied 2703 place count 1865 transition count 1633
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2799 place count 1769 transition count 1633
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 352 Pre rules applied. Total rules applied 2799 place count 1769 transition count 1281
Deduced a syphon composed of 352 places in 15 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 704 rules applied. Total rules applied 3503 place count 1417 transition count 1281
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3509 place count 1411 transition count 1275
Iterating global reduction 3 with 6 rules applied. Total rules applied 3515 place count 1411 transition count 1275
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 3515 place count 1411 transition count 1271
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 3523 place count 1407 transition count 1271
Performed 566 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 566 places in 0 ms
Reduce places removed 566 places and 0 transitions.
Iterating global reduction 3 with 1132 rules applied. Total rules applied 4655 place count 841 transition count 635
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 4656 place count 840 transition count 634
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 3 with 142 rules applied. Total rules applied 4798 place count 745 transition count 587
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 4845 place count 698 transition count 587
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4845 place count 698 transition count 539
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4941 place count 650 transition count 539
Applied a total of 4941 rules in 817 ms. Remains 650 /3144 variables (removed 2494) and now considering 539/3059 (removed 2520) transitions.
// Phase 1: matrix 539 rows 650 cols
[2024-05-21 13:11:31] [INFO ] Computed 163 invariants in 3 ms
[2024-05-21 13:11:32] [INFO ] Implicit Places using invariants in 890 ms returned [255, 329, 367, 441, 479, 483, 487, 491, 495, 499, 503, 507, 511, 515, 519, 523, 527, 531, 535, 539, 543, 547, 551, 555, 559, 563, 567, 571, 575, 577, 580, 582, 584, 586, 588, 590, 592, 594, 596, 598, 600, 604, 608, 612, 616, 620, 624, 628, 632, 636, 640, 644, 649]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 892 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 597/3144 places, 539/3059 transitions.
Graph (trivial) has 248 edges and 597 vertex of which 12 / 597 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 546 transition count 478
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 546 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 83 place count 544 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 85 place count 544 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 87 place count 542 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 89 place count 542 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 91 place count 540 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 540 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 538 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 538 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 99 place count 536 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 101 place count 536 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 103 place count 534 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 105 place count 534 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 107 place count 532 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 109 place count 532 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 111 place count 530 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 530 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 115 place count 528 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 528 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 119 place count 526 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 121 place count 526 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 123 place count 524 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 125 place count 524 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 127 place count 522 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 129 place count 522 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 521 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 521 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 520 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 520 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 519 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 519 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 518 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 518 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 517 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 517 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 516 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 516 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 515 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 515 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 514 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 514 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 513 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 513 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 512 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 512 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 511 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 511 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 510 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 510 transition count 442
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 155 place count 509 transition count 441
Applied a total of 155 rules in 330 ms. Remains 509 /597 variables (removed 88) and now considering 441/539 (removed 98) transitions.
// Phase 1: matrix 441 rows 509 cols
[2024-05-21 13:11:32] [INFO ] Computed 110 invariants in 2 ms
[2024-05-21 13:11:33] [INFO ] Implicit Places using invariants in 727 ms returned []
[2024-05-21 13:11:33] [INFO ] Invariant cache hit.
[2024-05-21 13:11:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:11:34] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 509/3144 places, 441/3059 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3806 ms. Remains : 509/3144 places, 441/3059 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 870 reset in 808 ms.
Product exploration explored 100000 steps with 870 reset in 1055 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 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Finished random walk after 1452 steps, including 11 resets, run visited all 1 properties in 14 ms. (steps per millisecond=103 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 1 out of 509 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 509/509 places, 441/441 transitions.
Applied a total of 0 rules in 19 ms. Remains 509 /509 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-21 13:11:37] [INFO ] Invariant cache hit.
[2024-05-21 13:11:37] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-05-21 13:11:37] [INFO ] Invariant cache hit.
[2024-05-21 13:11:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:11:39] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1890 ms to find 0 implicit places.
[2024-05-21 13:11:39] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-21 13:11:39] [INFO ] Invariant cache hit.
[2024-05-21 13:11:39] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2344 ms. Remains : 509/509 places, 441/441 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 254 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 419488 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 419488 steps, saw 68740 distinct states, run finished after 3006 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 13:11:43] [INFO ] Invariant cache hit.
[2024-05-21 13:11:43] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 13:11:43] [INFO ] [Nat]Absence check using 110 positive place invariants in 25 ms returned sat
[2024-05-21 13:11:43] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 13:11:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:11:43] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 13:11:43] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-21 13:11:43] [INFO ] After 493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 116 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 869 reset in 1116 ms.
Product exploration explored 100000 steps with 868 reset in 947 ms.
Built C files in :
/tmp/ltsmin11001540933796273758
[2024-05-21 13:11:46] [INFO ] Computing symmetric may disable matrix : 441 transitions.
[2024-05-21 13:11:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:11:46] [INFO ] Computing symmetric may enable matrix : 441 transitions.
[2024-05-21 13:11:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:11:46] [INFO ] Computing Do-Not-Accords matrix : 441 transitions.
[2024-05-21 13:11:46] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:11:46] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11001540933796273758
Running compilation step : cd /tmp/ltsmin11001540933796273758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1625 ms.
Running link step : cd /tmp/ltsmin11001540933796273758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin11001540933796273758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15791607868233169549.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 509 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 509/509 places, 441/441 transitions.
Applied a total of 0 rules in 13 ms. Remains 509 /509 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-21 13:12:01] [INFO ] Invariant cache hit.
[2024-05-21 13:12:01] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-21 13:12:01] [INFO ] Invariant cache hit.
[2024-05-21 13:12:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:12:02] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
[2024-05-21 13:12:02] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 13:12:02] [INFO ] Invariant cache hit.
[2024-05-21 13:12:03] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1963 ms. Remains : 509/509 places, 441/441 transitions.
Built C files in :
/tmp/ltsmin6625227325521084227
[2024-05-21 13:12:03] [INFO ] Computing symmetric may disable matrix : 441 transitions.
[2024-05-21 13:12:03] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:12:03] [INFO ] Computing symmetric may enable matrix : 441 transitions.
[2024-05-21 13:12:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:12:03] [INFO ] Computing Do-Not-Accords matrix : 441 transitions.
[2024-05-21 13:12:03] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:12:03] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6625227325521084227
Running compilation step : cd /tmp/ltsmin6625227325521084227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1524 ms.
Running link step : cd /tmp/ltsmin6625227325521084227;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin6625227325521084227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17948105593353826075.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 13:12:18] [INFO ] Flatten gal took : 14 ms
[2024-05-21 13:12:18] [INFO ] Flatten gal took : 13 ms
[2024-05-21 13:12:18] [INFO ] Time to serialize gal into /tmp/LTL10661455387239401934.gal : 2 ms
[2024-05-21 13:12:18] [INFO ] Time to serialize properties into /tmp/LTL7879017019921194613.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10661455387239401934.gal' '-t' 'CGAL' '-hoa' '/tmp/aut578078171461985506.hoa' '-atoms' '/tmp/LTL7879017019921194613.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7879017019921194613.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut578078171461985506.hoa
Detected timeout of ITS tools.
[2024-05-21 13:12:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 13:12:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 13:12:33] [INFO ] Time to serialize gal into /tmp/LTL18091706940339797440.gal : 3 ms
[2024-05-21 13:12:33] [INFO ] Time to serialize properties into /tmp/LTL3669916173789337134.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18091706940339797440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3669916173789337134.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p209==0)"))))
Formula 0 simplified : GF!"(p209==0)"
Detected timeout of ITS tools.
[2024-05-21 13:12:48] [INFO ] Flatten gal took : 12 ms
[2024-05-21 13:12:48] [INFO ] Applying decomposition
[2024-05-21 13:12:48] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1846330135272909937.txt' '-o' '/tmp/graph1846330135272909937.bin' '-w' '/tmp/graph1846330135272909937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1846330135272909937.bin' '-l' '-1' '-v' '-w' '/tmp/graph1846330135272909937.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:12:48] [INFO ] Decomposing Gal with order
[2024-05-21 13:12:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:12:48] [INFO ] Removed a total of 3 redundant transitions.
[2024-05-21 13:12:48] [INFO ] Flatten gal took : 31 ms
[2024-05-21 13:12:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 13:12:48] [INFO ] Time to serialize gal into /tmp/LTL3070347554921600944.gal : 5 ms
[2024-05-21 13:12:48] [INFO ] Time to serialize properties into /tmp/LTL7996238224431663395.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3070347554921600944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7996238224431663395.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(i10.u0.p209==0)"))))
Formula 0 simplified : GF!"(i10.u0.p209==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.97912e+13 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14070464735232236554
[2024-05-21 13:13:03] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14070464735232236554
Running compilation step : cd /tmp/ltsmin14070464735232236554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1209 ms.
Running link step : cd /tmp/ltsmin14070464735232236554;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14070464735232236554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-48b-LTLFireability-06 finished in 108018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1||X((G(p0) U (p1&&G(p0))))))))'
Support contains 2 out of 3144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3134 transition count 3049
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3134 transition count 3049
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 3132 transition count 3047
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 3132 transition count 3047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 3131 transition count 3046
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 3131 transition count 3046
Applied a total of 26 rules in 1534 ms. Remains 3131 /3144 variables (removed 13) and now considering 3046/3059 (removed 13) transitions.
// Phase 1: matrix 3046 rows 3131 cols
[2024-05-21 13:13:20] [INFO ] Computed 258 invariants in 24 ms
[2024-05-21 13:13:21] [INFO ] Implicit Places using invariants in 1415 ms returned []
[2024-05-21 13:13:21] [INFO ] Invariant cache hit.
[2024-05-21 13:13:23] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 2745 ms to find 0 implicit places.
[2024-05-21 13:13:23] [INFO ] Invariant cache hit.
[2024-05-21 13:13:26] [INFO ] Dead Transitions using invariants and state equation in 3380 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3144 places, 3046/3059 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7675 ms. Remains : 3131/3144 places, 3046/3059 transitions.
Stuttering acceptance computed with spot in 409 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s73 1), p1:(EQ s1015 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 899 steps with 0 reset in 6 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-07 finished in 8144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 3144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1274 transitions
Trivial Post-agglo rules discarded 1274 transitions
Performed 1274 trivial Post agglomeration. Transition count delta: 1274
Iterating post reduction 0 with 1274 rules applied. Total rules applied 1274 place count 3143 transition count 1784
Reduce places removed 1274 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 1 with 1417 rules applied. Total rules applied 2691 place count 1869 transition count 1641
Reduce places removed 93 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 95 rules applied. Total rules applied 2786 place count 1776 transition count 1639
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 2790 place count 1774 transition count 1637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2791 place count 1773 transition count 1637
Performed 351 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 351 Pre rules applied. Total rules applied 2791 place count 1773 transition count 1286
Deduced a syphon composed of 351 places in 16 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 5 with 702 rules applied. Total rules applied 3493 place count 1422 transition count 1286
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 3500 place count 1415 transition count 1279
Iterating global reduction 5 with 7 rules applied. Total rules applied 3507 place count 1415 transition count 1279
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 3507 place count 1415 transition count 1275
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 3515 place count 1411 transition count 1275
Performed 566 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 566 places in 0 ms
Reduce places removed 566 places and 0 transitions.
Iterating global reduction 5 with 1132 rules applied. Total rules applied 4647 place count 845 transition count 639
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4648 place count 844 transition count 638
Reduce places removed 93 places and 0 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 5 with 138 rules applied. Total rules applied 4786 place count 751 transition count 593
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 6 with 45 rules applied. Total rules applied 4831 place count 706 transition count 593
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 48 Pre rules applied. Total rules applied 4831 place count 706 transition count 545
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 4927 place count 658 transition count 545
Applied a total of 4927 rules in 711 ms. Remains 658 /3144 variables (removed 2486) and now considering 545/3059 (removed 2514) transitions.
// Phase 1: matrix 545 rows 658 cols
[2024-05-21 13:13:27] [INFO ] Computed 165 invariants in 3 ms
[2024-05-21 13:13:28] [INFO ] Implicit Places using invariants in 768 ms returned [260, 334, 372, 446, 484, 488, 492, 496, 500, 504, 508, 512, 516, 520, 524, 528, 532, 536, 540, 544, 548, 552, 556, 560, 564, 568, 572, 576, 581, 583, 586, 588, 590, 592, 594, 596, 598, 600, 602, 604, 606, 610, 614, 618, 623, 627, 631, 635, 639, 643, 647, 652, 657]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 770 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/3144 places, 545/3059 transitions.
Graph (trivial) has 248 edges and 605 vertex of which 12 / 605 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 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 594 transition count 523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 593 transition count 523
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 42 place count 554 transition count 484
Iterating global reduction 2 with 39 rules applied. Total rules applied 81 place count 554 transition count 484
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 552 transition count 482
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 552 transition count 482
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 550 transition count 480
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 550 transition count 480
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 548 transition count 478
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 548 transition count 478
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 546 transition count 476
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 546 transition count 476
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 544 transition count 474
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 544 transition count 474
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 542 transition count 472
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 542 transition count 472
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 540 transition count 470
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 540 transition count 470
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 538 transition count 468
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 538 transition count 468
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 536 transition count 466
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 536 transition count 466
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 534 transition count 464
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 534 transition count 464
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 532 transition count 462
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 532 transition count 462
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 530 transition count 460
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 530 transition count 460
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 529 transition count 459
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 529 transition count 459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 528 transition count 458
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 528 transition count 458
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 527 transition count 457
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 527 transition count 457
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 526 transition count 456
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 526 transition count 456
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 138 place count 525 transition count 455
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 525 transition count 455
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 524 transition count 454
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 524 transition count 454
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 523 transition count 453
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 523 transition count 453
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 522 transition count 452
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 522 transition count 452
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 521 transition count 451
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 521 transition count 451
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 520 transition count 450
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 520 transition count 450
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 519 transition count 449
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 519 transition count 449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 518 transition count 448
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 518 transition count 448
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 155 place count 517 transition count 447
Applied a total of 155 rules in 435 ms. Remains 517 /605 variables (removed 88) and now considering 447/545 (removed 98) transitions.
// Phase 1: matrix 447 rows 517 cols
[2024-05-21 13:13:28] [INFO ] Computed 112 invariants in 6 ms
[2024-05-21 13:13:29] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-21 13:13:29] [INFO ] Invariant cache hit.
[2024-05-21 13:13:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:13:30] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1583 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 517/3144 places, 447/3059 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3499 ms. Remains : 517/3144 places, 447/3059 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s259 0) (EQ s254 0)), p1:(EQ s511 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-09 finished in 3679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(X((p2||G(p3)))))))'
Support contains 3 out of 3144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3134 transition count 3049
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3134 transition count 3049
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 3134 transition count 3048
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 3132 transition count 3046
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 3132 transition count 3046
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3131 transition count 3045
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3131 transition count 3045
Applied a total of 27 rules in 1767 ms. Remains 3131 /3144 variables (removed 13) and now considering 3045/3059 (removed 14) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2024-05-21 13:13:32] [INFO ] Computed 258 invariants in 14 ms
[2024-05-21 13:13:33] [INFO ] Implicit Places using invariants in 1172 ms returned []
[2024-05-21 13:13:33] [INFO ] Invariant cache hit.
[2024-05-21 13:13:35] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned []
Implicit Place search using SMT with State Equation took 2550 ms to find 0 implicit places.
[2024-05-21 13:13:35] [INFO ] Invariant cache hit.
[2024-05-21 13:13:38] [INFO ] Dead Transitions using invariants and state equation in 3167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3144 places, 3045/3059 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7486 ms. Remains : 3131/3144 places, 3045/3059 transitions.
Stuttering acceptance computed with spot in 398 ms :[true, (NOT p1), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=p3, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={} source=7 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 4}]], initial=6, aps=[p1:(EQ s2339 1), p0:(EQ s1318 1), p3:(EQ s751 0), p2:(EQ s1318 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 2227 ms.
Product exploration explored 100000 steps with 25000 reset in 2003 ms.
Computed a total of 790 stabilizing places and 790 stable transitions
Computed a total of 790 stabilizing places and 790 stable transitions
Detected a total of 790/3131 stabilizing places and 790/3045 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 203 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 147105 steps, run timeout after 3002 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147105 steps, saw 146086 distinct states, run finished after 3003 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-21 13:13:46] [INFO ] Invariant cache hit.
[2024-05-21 13:13:47] [INFO ] After 743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 13:13:48] [INFO ] [Nat]Absence check using 257 positive place invariants in 436 ms returned sat
[2024-05-21 13:13:48] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 10 ms returned sat
[2024-05-21 13:13:52] [INFO ] After 2919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 13:13:53] [INFO ] Deduced a trap composed of 67 places in 1733 ms of which 3 ms to minimize.
[2024-05-21 13:13:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2185 ms
[2024-05-21 13:13:57] [INFO ] Deduced a trap composed of 81 places in 2033 ms of which 10 ms to minimize.
[2024-05-21 13:13:59] [INFO ] Deduced a trap composed of 180 places in 1922 ms of which 2 ms to minimize.
[2024-05-21 13:13:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4536 ms
[2024-05-21 13:13:59] [INFO ] After 10445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 443 ms.
[2024-05-21 13:14:00] [INFO ] After 12363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1022 steps, including 0 resets, run visited all 3 properties in 24 ms. (steps per millisecond=42 )
Parikh walk visited 3 properties in 24 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND (NOT p2) p3)), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 2 out of 3131 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Applied a total of 0 rules in 363 ms. Remains 3131 /3131 variables (removed 0) and now considering 3045/3045 (removed 0) transitions.
[2024-05-21 13:14:01] [INFO ] Invariant cache hit.
[2024-05-21 13:14:02] [INFO ] Implicit Places using invariants in 1277 ms returned []
[2024-05-21 13:14:02] [INFO ] Invariant cache hit.
[2024-05-21 13:14:04] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 2713 ms to find 0 implicit places.
[2024-05-21 13:14:04] [INFO ] Invariant cache hit.
[2024-05-21 13:14:07] [INFO ] Dead Transitions using invariants and state equation in 3073 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6162 ms. Remains : 3131/3131 places, 3045/3045 transitions.
Computed a total of 790 stabilizing places and 790 stable transitions
Computed a total of 790 stabilizing places and 790 stable transitions
Knowledge obtained : [(AND p3 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 160443 steps, run timeout after 3003 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160443 steps, saw 159349 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-21 13:14:11] [INFO ] Invariant cache hit.
[2024-05-21 13:14:11] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 13:14:12] [INFO ] [Nat]Absence check using 257 positive place invariants in 310 ms returned sat
[2024-05-21 13:14:12] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 11 ms returned sat
[2024-05-21 13:14:16] [INFO ] After 3365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 13:14:18] [INFO ] Deduced a trap composed of 67 places in 1545 ms of which 2 ms to minimize.
[2024-05-21 13:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2109 ms
[2024-05-21 13:14:21] [INFO ] Deduced a trap composed of 81 places in 2096 ms of which 2 ms to minimize.
[2024-05-21 13:14:23] [INFO ] Deduced a trap composed of 180 places in 1995 ms of which 3 ms to minimize.
[2024-05-21 13:14:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4798 ms
[2024-05-21 13:14:24] [INFO ] After 11123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 561 ms.
[2024-05-21 13:14:24] [INFO ] After 12911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 114 ms.
Support contains 2 out of 3131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Drop transitions removed 1270 transitions
Trivial Post-agglo rules discarded 1270 transitions
Performed 1270 trivial Post agglomeration. Transition count delta: 1270
Iterating post reduction 0 with 1270 rules applied. Total rules applied 1270 place count 3131 transition count 1775
Reduce places removed 1270 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1414 rules applied. Total rules applied 2684 place count 1861 transition count 1631
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2780 place count 1765 transition count 1631
Performed 351 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 351 Pre rules applied. Total rules applied 2780 place count 1765 transition count 1280
Deduced a syphon composed of 351 places in 10 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 3 with 702 rules applied. Total rules applied 3482 place count 1414 transition count 1280
Performed 572 Post agglomeration using F-continuation condition with reduction of 72 identical transitions.
Deduced a syphon composed of 572 places in 0 ms
Reduce places removed 572 places and 0 transitions.
Iterating global reduction 3 with 1144 rules applied. Total rules applied 4626 place count 842 transition count 636
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 144 times.
Iterating global reduction 3 with 144 rules applied. Total rules applied 4770 place count 842 transition count 492
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 4914 place count 698 transition count 492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4915 place count 697 transition count 491
Reduce places removed 202 places and 0 transitions.
Drop transitions removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 4 with 525 rules applied. Total rules applied 5440 place count 495 transition count 168
Reduce places removed 323 places and 0 transitions.
Iterating post reduction 5 with 323 rules applied. Total rules applied 5763 place count 172 transition count 168
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 56 Pre rules applied. Total rules applied 5763 place count 172 transition count 112
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 5875 place count 116 transition count 112
Applied a total of 5875 rules in 394 ms. Remains 116 /3131 variables (removed 3015) and now considering 112/3045 (removed 2933) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 116/3131 places, 112/3045 transitions.
Finished random walk after 8070 steps, including 2 resets, run visited all 2 properties in 109 ms. (steps per millisecond=74 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 p2), true]
False Knowledge obtained : [(F (NOT p3)), (F (AND (NOT p2) p3)), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 2 factoid took 308 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 1772 ms.
Product exploration explored 100000 steps with 25000 reset in 1987 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 2 out of 3131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Performed 1139 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1139 rules applied. Total rules applied 1139 place count 3131 transition count 3045
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 96 rules applied. Total rules applied 1235 place count 3131 transition count 2997
Performed 421 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 421 Pre rules applied. Total rules applied 1235 place count 3131 transition count 2997
Deduced a syphon composed of 1608 places in 33 ms
Iterating global reduction 2 with 421 rules applied. Total rules applied 1656 place count 3131 transition count 2997
Discarding 1050 places :
Symmetric choice reduction at 2 with 1050 rule applications. Total rules 2706 place count 2081 transition count 1947
Deduced a syphon composed of 558 places in 21 ms
Iterating global reduction 2 with 1050 rules applied. Total rules applied 3756 place count 2081 transition count 1947
Performed 681 Post agglomeration using F-continuation condition with reduction of 72 identical transitions.
Deduced a syphon composed of 1239 places in 1 ms
Iterating global reduction 2 with 681 rules applied. Total rules applied 4437 place count 2081 transition count 1875
Renaming transitions due to excessive name length > 1024 char.
Discarding 424 places :
Symmetric choice reduction at 2 with 424 rule applications. Total rules 4861 place count 1657 transition count 1451
Deduced a syphon composed of 815 places in 1 ms
Iterating global reduction 2 with 424 rules applied. Total rules applied 5285 place count 1657 transition count 1451
Deduced a syphon composed of 815 places in 1 ms
Applied a total of 5285 rules in 2183 ms. Remains 1657 /3131 variables (removed 1474) and now considering 1451/3045 (removed 1594) transitions.
[2024-05-21 13:14:32] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1451 rows 1657 cols
[2024-05-21 13:14:32] [INFO ] Computed 258 invariants in 97 ms
[2024-05-21 13:14:35] [INFO ] Dead Transitions using invariants and state equation in 2276 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1657/3131 places, 1451/3045 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4491 ms. Remains : 1657/3131 places, 1451/3045 transitions.
Built C files in :
/tmp/ltsmin3898928452064478342
[2024-05-21 13:14:35] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3898928452064478342
Running compilation step : cd /tmp/ltsmin3898928452064478342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3898928452064478342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3898928452064478342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 3131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Applied a total of 0 rules in 581 ms. Remains 3131 /3131 variables (removed 0) and now considering 3045/3045 (removed 0) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2024-05-21 13:14:38] [INFO ] Computed 258 invariants in 14 ms
[2024-05-21 13:14:40] [INFO ] Implicit Places using invariants in 1442 ms returned []
[2024-05-21 13:14:40] [INFO ] Invariant cache hit.
[2024-05-21 13:14:41] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 2749 ms to find 0 implicit places.
[2024-05-21 13:14:41] [INFO ] Invariant cache hit.
[2024-05-21 13:14:44] [INFO ] Dead Transitions using invariants and state equation in 3522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6857 ms. Remains : 3131/3131 places, 3045/3045 transitions.
Built C files in :
/tmp/ltsmin10687906376321657942
[2024-05-21 13:14:45] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10687906376321657942
Running compilation step : cd /tmp/ltsmin10687906376321657942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10687906376321657942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10687906376321657942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 13:14:48] [INFO ] Flatten gal took : 65 ms
[2024-05-21 13:14:48] [INFO ] Flatten gal took : 69 ms
[2024-05-21 13:14:48] [INFO ] Time to serialize gal into /tmp/LTL9178765352386902508.gal : 12 ms
[2024-05-21 13:14:48] [INFO ] Time to serialize properties into /tmp/LTL17404089886865378251.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9178765352386902508.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16906081046916323537.hoa' '-atoms' '/tmp/LTL17404089886865378251.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17404089886865378251.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16906081046916323537.hoa
Detected timeout of ITS tools.
[2024-05-21 13:15:03] [INFO ] Flatten gal took : 67 ms
[2024-05-21 13:15:03] [INFO ] Flatten gal took : 68 ms
[2024-05-21 13:15:03] [INFO ] Time to serialize gal into /tmp/LTL477819825064034476.gal : 13 ms
[2024-05-21 13:15:03] [INFO ] Time to serialize properties into /tmp/LTL14553430756657296528.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL477819825064034476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14553430756657296528.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((("(p1981==1)")U("(p3110==1)"))||(X(X(("(p1981==0)")||(G("(p1127==0)"))))))))
Formula 0 simplified : X((!"(p1981==1)" R !"(p3110==1)") & XX(!"(p1981==0)" & F!"(p1127==0)"))
Detected timeout of ITS tools.
[2024-05-21 13:15:18] [INFO ] Flatten gal took : 60 ms
[2024-05-21 13:15:18] [INFO ] Applying decomposition
[2024-05-21 13:15:18] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10604573638818197221.txt' '-o' '/tmp/graph10604573638818197221.bin' '-w' '/tmp/graph10604573638818197221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10604573638818197221.bin' '-l' '-1' '-v' '-w' '/tmp/graph10604573638818197221.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:15:18] [INFO ] Decomposing Gal with order
[2024-05-21 13:15:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:15:19] [INFO ] Removed a total of 553 redundant transitions.
[2024-05-21 13:15:19] [INFO ] Flatten gal took : 143 ms
[2024-05-21 13:15:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-21 13:15:20] [INFO ] Time to serialize gal into /tmp/LTL10065734871928723016.gal : 202 ms
[2024-05-21 13:15:20] [INFO ] Time to serialize properties into /tmp/LTL7121820693489246.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10065734871928723016.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7121820693489246.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...252
Read 1 LTL properties
Checking formula 0 : !((X((("(i25.u554.p1981==1)")U("(i41.u989.p3110==1)"))||(X(X(("(i25.u554.p1981==0)")||(G("(i17.u324.p1127==0)"))))))))
Formula 0 simplified : X((!"(i25.u554.p1981==1)" R !"(i41.u989.p3110==1)") & XX(!"(i25.u554.p1981==0)" & F!"(i17.u324.p1127==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6129938672244186513
[2024-05-21 13:15:35] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6129938672244186513
Running compilation step : cd /tmp/ltsmin6129938672244186513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6129938672244186513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6129938672244186513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutoFlight-PT-48b-LTLFireability-10 finished in 127421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 2 out of 3144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3134 transition count 3049
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3134 transition count 3049
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 3134 transition count 3048
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 3132 transition count 3046
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 3132 transition count 3046
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3131 transition count 3045
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3131 transition count 3045
Applied a total of 27 rules in 1951 ms. Remains 3131 /3144 variables (removed 13) and now considering 3045/3059 (removed 14) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2024-05-21 13:15:40] [INFO ] Computed 258 invariants in 13 ms
[2024-05-21 13:15:41] [INFO ] Implicit Places using invariants in 1477 ms returned []
[2024-05-21 13:15:41] [INFO ] Invariant cache hit.
[2024-05-21 13:15:42] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 2823 ms to find 0 implicit places.
[2024-05-21 13:15:42] [INFO ] Invariant cache hit.
[2024-05-21 13:15:46] [INFO ] Dead Transitions using invariants and state equation in 3066 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3144 places, 3045/3059 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7858 ms. Remains : 3131/3144 places, 3045/3059 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s1583 1), p0:(EQ s2155 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-11 finished in 8084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1276 transitions
Trivial Post-agglo rules discarded 1276 transitions
Performed 1276 trivial Post agglomeration. Transition count delta: 1276
Iterating post reduction 0 with 1276 rules applied. Total rules applied 1276 place count 3143 transition count 1782
Reduce places removed 1276 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1423 rules applied. Total rules applied 2699 place count 1867 transition count 1635
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2795 place count 1771 transition count 1635
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 352 Pre rules applied. Total rules applied 2795 place count 1771 transition count 1283
Deduced a syphon composed of 352 places in 10 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 704 rules applied. Total rules applied 3499 place count 1419 transition count 1283
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 3506 place count 1412 transition count 1276
Iterating global reduction 3 with 7 rules applied. Total rules applied 3513 place count 1412 transition count 1276
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 3513 place count 1412 transition count 1272
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 3521 place count 1408 transition count 1272
Performed 564 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 564 places in 0 ms
Reduce places removed 564 places and 0 transitions.
Iterating global reduction 3 with 1128 rules applied. Total rules applied 4649 place count 844 transition count 638
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 4650 place count 843 transition count 637
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 3 with 142 rules applied. Total rules applied 4792 place count 748 transition count 590
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 4839 place count 701 transition count 590
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4839 place count 701 transition count 542
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4935 place count 653 transition count 542
Applied a total of 4935 rules in 694 ms. Remains 653 /3144 variables (removed 2491) and now considering 542/3059 (removed 2517) transitions.
// Phase 1: matrix 542 rows 653 cols
[2024-05-21 13:15:46] [INFO ] Computed 163 invariants in 3 ms
[2024-05-21 13:15:47] [INFO ] Implicit Places using invariants in 723 ms returned [258, 332, 370, 444, 482, 486, 490, 494, 498, 502, 506, 510, 514, 518, 522, 526, 530, 534, 538, 542, 546, 550, 554, 558, 562, 566, 570, 574, 578, 580, 583, 585, 587, 589, 591, 593, 595, 597, 599, 601, 603, 607, 611, 615, 619, 623, 627, 631, 635, 639, 643, 647, 652]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 738 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 600/3144 places, 542/3059 transitions.
Graph (trivial) has 248 edges and 600 vertex of which 12 / 600 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 549 transition count 481
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 549 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 83 place count 547 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 85 place count 547 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 87 place count 545 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 89 place count 545 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 91 place count 543 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 543 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 541 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 541 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 99 place count 539 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 101 place count 539 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 103 place count 537 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 105 place count 537 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 107 place count 535 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 109 place count 535 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 111 place count 533 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 533 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 115 place count 531 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 531 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 119 place count 529 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 121 place count 529 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 123 place count 527 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 125 place count 527 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 127 place count 525 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 129 place count 525 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 524 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 524 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 523 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 523 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 522 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 522 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 521 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 521 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 520 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 520 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 519 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 519 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 518 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 518 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 517 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 517 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 516 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 516 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 515 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 515 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 514 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 514 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 513 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 513 transition count 445
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 155 place count 512 transition count 444
Applied a total of 155 rules in 263 ms. Remains 512 /600 variables (removed 88) and now considering 444/542 (removed 98) transitions.
// Phase 1: matrix 444 rows 512 cols
[2024-05-21 13:15:47] [INFO ] Computed 110 invariants in 2 ms
[2024-05-21 13:15:48] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-21 13:15:48] [INFO ] Invariant cache hit.
[2024-05-21 13:15:48] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 13:15:49] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 2079 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/3144 places, 444/3059 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3775 ms. Remains : 512/3144 places, 444/3059 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-13 finished in 3858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))&&F(p2)))))'
Support contains 3 out of 3144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3133 transition count 3048
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3133 transition count 3048
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 3133 transition count 3047
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 3131 transition count 3045
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 3131 transition count 3045
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3130 transition count 3044
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3130 transition count 3044
Applied a total of 29 rules in 1438 ms. Remains 3130 /3144 variables (removed 14) and now considering 3044/3059 (removed 15) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2024-05-21 13:15:51] [INFO ] Computed 258 invariants in 14 ms
[2024-05-21 13:15:52] [INFO ] Implicit Places using invariants in 1367 ms returned []
[2024-05-21 13:15:52] [INFO ] Invariant cache hit.
[2024-05-21 13:15:54] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned []
Implicit Place search using SMT with State Equation took 2694 ms to find 0 implicit places.
[2024-05-21 13:15:54] [INFO ] Invariant cache hit.
[2024-05-21 13:15:57] [INFO ] Dead Transitions using invariants and state equation in 3094 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3130/3144 places, 3044/3059 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7231 ms. Remains : 3130/3144 places, 3044/3059 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1264 1), p2:(EQ s1670 0), p1:(AND (EQ s1577 0) (EQ s1264 0))], 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 53 reset in 806 ms.
Stuttering criterion allowed to conclude after 76920 steps with 40 reset in 729 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-14 finished in 9076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X((G(p1)||X(p2))))))'
Found a Shortening insensitive property : AutoFlight-PT-48b-LTLFireability-01
Stuttering acceptance computed with spot in 765 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3144 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1275 transitions
Trivial Post-agglo rules discarded 1275 transitions
Performed 1275 trivial Post agglomeration. Transition count delta: 1275
Iterating post reduction 0 with 1275 rules applied. Total rules applied 1275 place count 3143 transition count 1783
Reduce places removed 1275 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1422 rules applied. Total rules applied 2697 place count 1868 transition count 1636
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2794 place count 1772 transition count 1635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2795 place count 1771 transition count 1635
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 350 Pre rules applied. Total rules applied 2795 place count 1771 transition count 1285
Deduced a syphon composed of 350 places in 16 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 4 with 700 rules applied. Total rules applied 3495 place count 1421 transition count 1285
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 3501 place count 1415 transition count 1279
Iterating global reduction 4 with 6 rules applied. Total rules applied 3507 place count 1415 transition count 1279
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 3507 place count 1415 transition count 1275
Deduced a syphon composed of 4 places in 16 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3515 place count 1411 transition count 1275
Performed 568 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 568 places in 0 ms
Reduce places removed 568 places and 0 transitions.
Iterating global reduction 4 with 1136 rules applied. Total rules applied 4651 place count 843 transition count 637
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 4652 place count 842 transition count 636
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 4 with 142 rules applied. Total rules applied 4794 place count 747 transition count 589
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 4841 place count 700 transition count 589
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 4841 place count 700 transition count 541
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 4937 place count 652 transition count 541
Applied a total of 4937 rules in 694 ms. Remains 652 /3144 variables (removed 2492) and now considering 541/3059 (removed 2518) transitions.
// Phase 1: matrix 541 rows 652 cols
[2024-05-21 13:16:00] [INFO ] Computed 163 invariants in 2 ms
[2024-05-21 13:16:01] [INFO ] Implicit Places using invariants in 987 ms returned [254, 368, 442, 480, 484, 488, 492, 496, 500, 504, 509, 513, 517, 521, 525, 529, 533, 537, 541, 545, 549, 553, 557, 561, 565, 569, 573, 577, 579, 582, 584, 586, 588, 590, 592, 594, 596, 598, 600, 602, 606, 610, 614, 618, 622, 626, 630, 634, 638, 642, 646, 651]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 1001 ms to find 52 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 600/3144 places, 541/3059 transitions.
Graph (trivial) has 246 edges and 600 vertex of which 12 / 600 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 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 589 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 588 transition count 519
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 41 place count 550 transition count 481
Iterating global reduction 2 with 38 rules applied. Total rules applied 79 place count 550 transition count 481
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 549 transition count 480
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 549 transition count 480
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 548 transition count 479
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 548 transition count 479
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 547 transition count 478
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 547 transition count 478
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 546 transition count 477
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 546 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 545 transition count 476
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 545 transition count 476
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 544 transition count 475
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 544 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 543 transition count 474
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 543 transition count 474
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 542 transition count 473
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 542 transition count 473
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 541 transition count 472
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 541 transition count 472
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 540 transition count 471
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 540 transition count 471
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 539 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 539 transition count 470
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 538 transition count 469
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 538 transition count 469
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 537 transition count 468
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 537 transition count 468
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 536 transition count 467
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 536 transition count 467
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 535 transition count 466
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 535 transition count 466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 534 transition count 465
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 534 transition count 465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 533 transition count 464
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 533 transition count 464
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 532 transition count 463
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 532 transition count 463
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 531 transition count 462
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 531 transition count 462
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 530 transition count 461
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 530 transition count 461
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 529 transition count 460
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 529 transition count 460
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 528 transition count 459
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 528 transition count 459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 527 transition count 458
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 527 transition count 458
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 526 transition count 457
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 526 transition count 457
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 131 place count 524 transition count 455
Applied a total of 131 rules in 396 ms. Remains 524 /600 variables (removed 76) and now considering 455/541 (removed 86) transitions.
// Phase 1: matrix 455 rows 524 cols
[2024-05-21 13:16:02] [INFO ] Computed 111 invariants in 3 ms
[2024-05-21 13:16:02] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-05-21 13:16:02] [INFO ] Invariant cache hit.
[2024-05-21 13:16:03] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 524/3144 places, 455/3059 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3823 ms. Remains : 524/3144 places, 455/3059 transitions.
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=8 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=8 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p1), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=9 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 8}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s364 0), p1:(EQ s253 0), p2:(EQ s461 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
Treatment of property AutoFlight-PT-48b-LTLFireability-01 finished in 4728 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : AutoFlight-PT-48b-LTLFireability-04
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 3144 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3144/3144 places, 3059/3059 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1275 transitions
Trivial Post-agglo rules discarded 1275 transitions
Performed 1275 trivial Post agglomeration. Transition count delta: 1275
Iterating post reduction 0 with 1275 rules applied. Total rules applied 1275 place count 3143 transition count 1783
Reduce places removed 1275 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1422 rules applied. Total rules applied 2697 place count 1868 transition count 1636
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2794 place count 1772 transition count 1635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2795 place count 1771 transition count 1635
Performed 353 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 353 Pre rules applied. Total rules applied 2795 place count 1771 transition count 1282
Deduced a syphon composed of 353 places in 17 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 4 with 706 rules applied. Total rules applied 3501 place count 1418 transition count 1282
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 3508 place count 1411 transition count 1275
Iterating global reduction 4 with 7 rules applied. Total rules applied 3515 place count 1411 transition count 1275
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 3515 place count 1411 transition count 1271
Deduced a syphon composed of 4 places in 16 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3523 place count 1407 transition count 1271
Performed 565 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 565 places in 0 ms
Reduce places removed 565 places and 0 transitions.
Iterating global reduction 4 with 1130 rules applied. Total rules applied 4653 place count 842 transition count 636
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 4654 place count 841 transition count 635
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 4 with 142 rules applied. Total rules applied 4796 place count 746 transition count 588
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 4843 place count 699 transition count 588
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 4843 place count 699 transition count 540
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 4939 place count 651 transition count 540
Applied a total of 4939 rules in 876 ms. Remains 651 /3144 variables (removed 2493) and now considering 540/3059 (removed 2519) transitions.
// Phase 1: matrix 540 rows 651 cols
[2024-05-21 13:16:05] [INFO ] Computed 163 invariants in 6 ms
[2024-05-21 13:16:06] [INFO ] Implicit Places using invariants in 947 ms returned [254, 328, 366, 440, 478, 482, 486, 490, 500, 504, 508, 512, 516, 520, 524, 528, 532, 536, 540, 544, 548, 552, 556, 560, 564, 568, 572, 576, 578, 581, 583, 585, 587, 589, 591, 593, 595, 597, 599, 601, 605, 609, 613, 617, 621, 625, 629, 633, 637, 641, 645, 650]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 949 ms to find 52 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 599/3144 places, 540/3059 transitions.
Graph (trivial) has 246 edges and 599 vertex of which 12 / 599 are part of one of the 1 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 549 transition count 480
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 549 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 81 place count 547 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 83 place count 547 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 545 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 545 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 543 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 543 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 541 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 541 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 539 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 539 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 537 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 537 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 535 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 535 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 533 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 533 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 531 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 531 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 529 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 529 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 527 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 527 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 125 place count 525 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 525 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 128 place count 524 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 129 place count 524 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 523 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 523 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 522 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 522 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 521 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 521 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 520 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 520 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 519 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 519 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 518 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 518 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 517 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 517 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 516 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 516 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 515 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 515 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 514 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 514 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 513 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 513 transition count 444
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 155 place count 511 transition count 442
Applied a total of 155 rules in 257 ms. Remains 511 /599 variables (removed 88) and now considering 442/540 (removed 98) transitions.
// Phase 1: matrix 442 rows 511 cols
[2024-05-21 13:16:06] [INFO ] Computed 111 invariants in 1 ms
[2024-05-21 13:16:06] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-21 13:16:06] [INFO ] Invariant cache hit.
[2024-05-21 13:16:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:16:08] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1814 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 511/3144 places, 442/3059 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3901 ms. Remains : 511/3144 places, 442/3059 transitions.
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s446 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property AutoFlight-PT-48b-LTLFireability-04 finished in 4316 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(X((p2||G(p3)))))))'
[2024-05-21 13:16:08] [INFO ] Flatten gal took : 89 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8465783640052996604
[2024-05-21 13:16:08] [INFO ] Too many transitions (3059) to apply POR reductions. Disabling POR matrices.
[2024-05-21 13:16:08] [INFO ] Applying decomposition
[2024-05-21 13:16:08] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8465783640052996604
Running compilation step : cd /tmp/ltsmin8465783640052996604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 13:16:08] [INFO ] Flatten gal took : 138 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9619117155465299330.txt' '-o' '/tmp/graph9619117155465299330.bin' '-w' '/tmp/graph9619117155465299330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9619117155465299330.bin' '-l' '-1' '-v' '-w' '/tmp/graph9619117155465299330.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:16:09] [INFO ] Decomposing Gal with order
[2024-05-21 13:16:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:16:09] [INFO ] Removed a total of 551 redundant transitions.
[2024-05-21 13:16:09] [INFO ] Flatten gal took : 150 ms
[2024-05-21 13:16:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-21 13:16:10] [INFO ] Time to serialize gal into /tmp/LTLFireability10684459952863760452.gal : 42 ms
[2024-05-21 13:16:10] [INFO ] Time to serialize properties into /tmp/LTLFireability15247693842310945326.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10684459952863760452.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15247693842310945326.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !((F((G("(i36.i0.i0.i1.u857.p2813==0)"))&&(X((G("(i45.u568.p2039==0)"))||(X("(i12.u1040.p3235==0)")))))))
Formula 0 simplified : G(F!"(i36.i0.i0.i1.u857.p2813==0)" | X(F!"(i45.u568.p2039==0)" & X!"(i12.u1040.p3235==0)"))
Compilation finished in 13681 ms.
Running link step : cd /tmp/ltsmin8465783640052996604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin8465783640052996604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&X(([]((LTLAPp1==true))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8465783640052996604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&X(([]((LTLAPp1==true))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8465783640052996604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 13:39:29] [INFO ] Applying decomposition
[2024-05-21 13:39:29] [INFO ] Flatten gal took : 395 ms
[2024-05-21 13:39:29] [INFO ] Decomposing Gal with order
[2024-05-21 13:39:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:39:33] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-21 13:39:33] [INFO ] Flatten gal took : 234 ms
[2024-05-21 13:39:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2754 labels/synchronizations in 9768 ms.
[2024-05-21 13:39:46] [INFO ] Time to serialize gal into /tmp/LTLFireability18328050215794675955.gal : 275 ms
[2024-05-21 13:39:46] [INFO ] Time to serialize properties into /tmp/LTLFireability15716621756488122105.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18328050215794675955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15716621756488122105.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !((F((G("(i1.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...527
Formula 0 simplified : G(F!"(i1.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....515
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8465783640052996604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8465783640052996604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8465783640052996604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8465783640052996604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp5==true) U (LTLAPp6==true))||X(X(((LTLAPp7==true)||[]((LTLAPp8==true)))))))' '--buchi-type=spotba'
LTSmin run took 7271 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin8465783640052996604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&X(([]((LTLAPp1==true))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 14:03:07] [INFO ] Flatten gal took : 894 ms
[2024-05-21 14:03:14] [INFO ] Input system was already deterministic with 3059 transitions.
[2024-05-21 14:03:14] [INFO ] Transformed 3144 places.
[2024-05-21 14:03:14] [INFO ] Transformed 3059 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
[2024-05-21 14:03:18] [INFO ] Time to serialize gal into /tmp/LTLFireability18290560392623924987.gal : 60 ms
[2024-05-21 14:03:18] [INFO ] Time to serialize properties into /tmp/LTLFireability6967960776161304760.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18290560392623924987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6967960776161304760.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("(p2813==0)"))&&(X((G("(p2039==0)"))||(X("(p3235==0)")))))))
Formula 0 simplified : G(F!"(p2813==0)" | X(F!"(p2039==0)" & X!"(p3235==0)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12953168 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15698944 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AutoFlight-PT-48b, 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 r043-smll-171620180100123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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