Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r007-oct2-167813595600508.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r007-oct2-167813595600508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 18:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 18:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 18:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 18:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 18:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 956K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-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 1678350256339

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:24:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:24:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:24:19] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2023-03-09 08:24:19] [INFO ] Transformed 3950 places.
[2023-03-09 08:24:19] [INFO ] Transformed 3936 transitions.
[2023-03-09 08:24:19] [INFO ] Found NUPN structural information;
[2023-03-09 08:24:19] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 417 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA AutoFlight-PT-48b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 3950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Discarding 503 places :
Symmetric choice reduction at 0 with 503 rule applications. Total rules 503 place count 3447 transition count 3433
Iterating global reduction 0 with 503 rules applied. Total rules applied 1006 place count 3447 transition count 3433
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 1078 place count 3447 transition count 3361
Discarding 237 places :
Symmetric choice reduction at 1 with 237 rule applications. Total rules 1315 place count 3210 transition count 3124
Iterating global reduction 1 with 237 rules applied. Total rules applied 1552 place count 3210 transition count 3124
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 1588 place count 3174 transition count 3088
Iterating global reduction 1 with 36 rules applied. Total rules applied 1624 place count 3174 transition count 3088
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 1659 place count 3139 transition count 3053
Iterating global reduction 1 with 35 rules applied. Total rules applied 1694 place count 3139 transition count 3053
Applied a total of 1694 rules in 2113 ms. Remains 3139 /3950 variables (removed 811) and now considering 3053/3936 (removed 883) transitions.
// Phase 1: matrix 3053 rows 3139 cols
[2023-03-09 08:24:22] [INFO ] Computed 258 place invariants in 53 ms
[2023-03-09 08:24:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-09 08:24:23] [INFO ] Implicit Places using invariants in 1498 ms returned []
[2023-03-09 08:24:23] [INFO ] Invariant cache hit.
[2023-03-09 08:24:32] [INFO ] Implicit Places using invariants and state equation in 8286 ms returned []
Implicit Place search using SMT with State Equation took 9877 ms to find 0 implicit places.
[2023-03-09 08:24:32] [INFO ] Invariant cache hit.
[2023-03-09 08:24:35] [INFO ] Dead Transitions using invariants and state equation in 3018 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3139/3950 places, 3053/3936 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15012 ms. Remains : 3139/3950 places, 3053/3936 transitions.
Support contains 25 out of 3139 places after structural reductions.
[2023-03-09 08:24:35] [INFO ] Flatten gal took : 251 ms
[2023-03-09 08:24:35] [INFO ] Flatten gal took : 110 ms
[2023-03-09 08:24:35] [INFO ] Input system was already deterministic with 3053 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 21) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-09 08:24:36] [INFO ] Invariant cache hit.
[2023-03-09 08:24:38] [INFO ] After 1219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 08:24:39] [INFO ] [Nat]Absence check using 257 positive place invariants in 304 ms returned sat
[2023-03-09 08:24:39] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 12 ms returned sat
[2023-03-09 08:24:44] [INFO ] After 4125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-09 08:24:46] [INFO ] Deduced a trap composed of 142 places in 1243 ms of which 36 ms to minimize.
[2023-03-09 08:24:47] [INFO ] Deduced a trap composed of 69 places in 1473 ms of which 2 ms to minimize.
[2023-03-09 08:24:49] [INFO ] Deduced a trap composed of 97 places in 1364 ms of which 4 ms to minimize.
[2023-03-09 08:24:50] [INFO ] Deduced a trap composed of 162 places in 1253 ms of which 2 ms to minimize.
[2023-03-09 08:24:51] [INFO ] Deduced a trap composed of 243 places in 888 ms of which 12 ms to minimize.
[2023-03-09 08:24:52] [INFO ] Deduced a trap composed of 241 places in 828 ms of which 2 ms to minimize.
[2023-03-09 08:24:53] [INFO ] Deduced a trap composed of 238 places in 812 ms of which 18 ms to minimize.
[2023-03-09 08:24:54] [INFO ] Deduced a trap composed of 227 places in 957 ms of which 1 ms to minimize.
[2023-03-09 08:24:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 10109 ms
[2023-03-09 08:24:55] [INFO ] Deduced a trap composed of 67 places in 617 ms of which 1 ms to minimize.
[2023-03-09 08:24:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1017 ms
[2023-03-09 08:24:59] [INFO ] Deduced a trap composed of 241 places in 1746 ms of which 2 ms to minimize.
[2023-03-09 08:25:00] [INFO ] Deduced a trap composed of 241 places in 1199 ms of which 18 ms to minimize.
[2023-03-09 08:25:01] [INFO ] Deduced a trap composed of 556 places in 1379 ms of which 8 ms to minimize.
[2023-03-09 08:25:03] [INFO ] Deduced a trap composed of 251 places in 1301 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:25:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 08:25:03] [INFO ] After 25151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 7 properties in 705 ms.
Support contains 5 out of 3139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Drop transitions removed 1272 transitions
Trivial Post-agglo rules discarded 1272 transitions
Performed 1272 trivial Post agglomeration. Transition count delta: 1272
Iterating post reduction 0 with 1272 rules applied. Total rules applied 1272 place count 3139 transition count 1781
Reduce places removed 1272 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 1417 rules applied. Total rules applied 2689 place count 1867 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 2786 place count 1771 transition count 1635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2787 place count 1770 transition count 1635
Performed 349 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 349 Pre rules applied. Total rules applied 2787 place count 1770 transition count 1286
Deduced a syphon composed of 349 places in 6 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 4 with 698 rules applied. Total rules applied 3485 place count 1421 transition count 1286
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 3489 place count 1417 transition count 1282
Iterating global reduction 4 with 4 rules applied. Total rules applied 3493 place count 1417 transition count 1282
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3493 place count 1417 transition count 1280
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3497 place count 1415 transition count 1280
Performed 568 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 568 places in 1 ms
Reduce places removed 568 places and 0 transitions.
Iterating global reduction 4 with 1136 rules applied. Total rules applied 4633 place count 847 transition count 641
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 144 times.
Iterating global reduction 4 with 144 rules applied. Total rules applied 4777 place count 847 transition count 497
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 4921 place count 703 transition count 497
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4922 place count 702 transition count 496
Reduce places removed 202 places and 0 transitions.
Drop transitions removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 5 with 524 rules applied. Total rules applied 5446 place count 500 transition count 174
Reduce places removed 322 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 323 rules applied. Total rules applied 5769 place count 178 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 5770 place count 177 transition count 173
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 56 Pre rules applied. Total rules applied 5770 place count 177 transition count 117
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 8 with 112 rules applied. Total rules applied 5882 place count 121 transition count 117
Applied a total of 5882 rules in 664 ms. Remains 121 /3139 variables (removed 3018) and now considering 117/3053 (removed 2936) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 664 ms. Remains : 121/3139 places, 117/3053 transitions.
Finished random walk after 398 steps, including 0 resets, run visited all 4 properties in 11 ms. (steps per millisecond=36 )
FORMULA AutoFlight-PT-48b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 797 stabilizing places and 797 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 3139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Reduce places removed 1 places and 1 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 3138 transition count 1779
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 1865 transition count 1634
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2787 place count 1769 transition count 1634
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 352 Pre rules applied. Total rules applied 2787 place count 1769 transition count 1282
Deduced a syphon composed of 352 places in 21 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 704 rules applied. Total rules applied 3491 place count 1417 transition count 1282
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3497 place count 1411 transition count 1276
Iterating global reduction 3 with 6 rules applied. Total rules applied 3503 place count 1411 transition count 1276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3503 place count 1411 transition count 1274
Deduced a syphon composed of 2 places in 20 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3507 place count 1409 transition count 1274
Performed 567 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 567 places in 1 ms
Reduce places removed 567 places and 0 transitions.
Iterating global reduction 3 with 1134 rules applied. Total rules applied 4641 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 3 with 1 rules applied. Total rules applied 4642 place count 841 transition count 635
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 3 with 140 rules applied. Total rules applied 4782 place count 747 transition count 589
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 4828 place count 701 transition count 589
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4828 place count 701 transition count 541
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4924 place count 653 transition count 541
Applied a total of 4924 rules in 490 ms. Remains 653 /3139 variables (removed 2486) and now considering 541/3053 (removed 2512) transitions.
// Phase 1: matrix 541 rows 653 cols
[2023-03-09 08:25:05] [INFO ] Computed 164 place invariants in 6 ms
[2023-03-09 08:25:06] [INFO ] Implicit Places using invariants in 381 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, 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 386 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 600/3139 places, 541/3053 transitions.
Graph (trivial) has 248 edges and 600 vertex of which 11 / 600 are part of one of the 1 SCC in 2 ms
Free SCC test removed 10 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 42 place count 549 transition count 481
Iterating global reduction 0 with 41 rules applied. Total rules applied 83 place count 549 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 547 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 547 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 545 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 545 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 543 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 543 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 541 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 541 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 539 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 539 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 537 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 537 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 535 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 535 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 533 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 533 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 531 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 531 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 529 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 529 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 125 place count 527 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 527 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 129 place count 525 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 131 place count 525 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 524 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 524 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 523 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 523 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 522 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 522 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 521 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 521 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 520 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 520 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 519 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 519 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 518 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 518 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 517 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 517 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 516 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 516 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 515 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 515 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 514 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 514 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 154 place count 513 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 155 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 157 place count 512 transition count 444
Applied a total of 157 rules in 430 ms. Remains 512 /600 variables (removed 88) and now considering 444/541 (removed 97) transitions.
// Phase 1: matrix 444 rows 512 cols
[2023-03-09 08:25:06] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-09 08:25:06] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-09 08:25:06] [INFO ] Invariant cache hit.
[2023-03-09 08:25:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:25:07] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/3139 places, 444/3053 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2170 ms. Remains : 512/3139 places, 444/3053 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s256 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 3 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-00 finished in 2568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X((G(p1)||X(p2))))))'
Support contains 3 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3133 transition count 3047
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3133 transition count 3047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3131 transition count 3045
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3131 transition count 3045
Applied a total of 16 rules in 768 ms. Remains 3131 /3139 variables (removed 8) and now considering 3045/3053 (removed 8) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2023-03-09 08:25:08] [INFO ] Computed 258 place invariants in 83 ms
[2023-03-09 08:25:09] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2023-03-09 08:25:09] [INFO ] Invariant cache hit.
[2023-03-09 08:25:16] [INFO ] Implicit Places using invariants and state equation in 6171 ms returned []
Implicit Place search using SMT with State Equation took 7513 ms to find 0 implicit places.
[2023-03-09 08:25:16] [INFO ] Invariant cache hit.
[2023-03-09 08:25:18] [INFO ] Dead Transitions using invariants and state equation in 2110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3139 places, 3045/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10408 ms. Remains : 3131/3139 places, 3045/3053 transitions.
Stuttering acceptance computed with spot in 685 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 138 reset in 612 ms.
Product exploration explored 100000 steps with 121 reset in 648 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 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 (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) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1485 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 547 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 264 ms. (steps per millisecond=37 ) properties (out of 11) seen :3
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 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-09 08:25:22] [INFO ] Invariant cache hit.
[2023-03-09 08:25:23] [INFO ] After 717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 08:25:24] [INFO ] [Nat]Absence check using 257 positive place invariants in 311 ms returned sat
[2023-03-09 08:25:24] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 23 ms returned sat
[2023-03-09 08:25:27] [INFO ] After 2572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 08:25:29] [INFO ] Deduced a trap composed of 31 places in 1176 ms of which 2 ms to minimize.
[2023-03-09 08:25:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1477 ms
[2023-03-09 08:25:30] [INFO ] Deduced a trap composed of 141 places in 1157 ms of which 2 ms to minimize.
[2023-03-09 08:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1497 ms
[2023-03-09 08:25:32] [INFO ] Deduced a trap composed of 59 places in 1289 ms of which 1 ms to minimize.
[2023-03-09 08:25:33] [INFO ] Deduced a trap composed of 67 places in 910 ms of which 2 ms to minimize.
[2023-03-09 08:25:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2606 ms
[2023-03-09 08:25:35] [INFO ] After 10420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1344 ms.
[2023-03-09 08:25:36] [INFO ] After 13408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 7 properties in 202 ms.
Support contains 3 out of 3131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Drop transitions removed 1268 transitions
Trivial Post-agglo rules discarded 1268 transitions
Performed 1268 trivial Post agglomeration. Transition count delta: 1268
Iterating post reduction 0 with 1268 rules applied. Total rules applied 1268 place count 3131 transition count 1777
Reduce places removed 1268 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 1412 rules applied. Total rules applied 2680 place count 1863 transition count 1633
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 2777 place count 1767 transition count 1632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2778 place count 1766 transition count 1632
Performed 351 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 351 Pre rules applied. Total rules applied 2778 place count 1766 transition count 1281
Deduced a syphon composed of 351 places in 7 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 4 with 702 rules applied. Total rules applied 3480 place count 1415 transition count 1281
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 4 with 1144 rules applied. Total rules applied 4624 place count 843 transition count 637
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 144 times.
Iterating global reduction 4 with 144 rules applied. Total rules applied 4768 place count 843 transition count 493
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 4912 place count 699 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4913 place count 698 transition count 492
Reduce places removed 203 places and 0 transitions.
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 5 with 533 rules applied. Total rules applied 5446 place count 495 transition count 162
Reduce places removed 330 places and 0 transitions.
Iterating post reduction 6 with 330 rules applied. Total rules applied 5776 place count 165 transition count 162
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 52 Pre rules applied. Total rules applied 5776 place count 165 transition count 110
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 5880 place count 113 transition count 110
Applied a total of 5880 rules in 344 ms. Remains 113 /3131 variables (removed 3018) and now considering 110/3045 (removed 2935) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 113/3131 places, 110/3045 transitions.
Finished random walk after 6798 steps, including 2 resets, run visited all 1 properties in 62 ms. (steps per millisecond=109 )
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 (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) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 18 factoid took 1869 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 551 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 468 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 258 ms. Remains 3131 /3131 variables (removed 0) and now considering 3045/3045 (removed 0) transitions.
[2023-03-09 08:25:40] [INFO ] Invariant cache hit.
[2023-03-09 08:25:42] [INFO ] Implicit Places using invariants in 1406 ms returned []
[2023-03-09 08:25:42] [INFO ] Invariant cache hit.
[2023-03-09 08:25:46] [INFO ] Implicit Places using invariants and state equation in 4246 ms returned []
Implicit Place search using SMT with State Equation took 5658 ms to find 0 implicit places.
[2023-03-09 08:25:46] [INFO ] Invariant cache hit.
[2023-03-09 08:25:48] [INFO ] Dead Transitions using invariants and state equation in 1937 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7865 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 (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1227 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 904 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 439 ms. (steps per millisecond=22 ) properties (out of 11) seen :3
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 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-09 08:25:51] [INFO ] Invariant cache hit.
[2023-03-09 08:25:52] [INFO ] After 968ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 08:25:53] [INFO ] [Nat]Absence check using 257 positive place invariants in 213 ms returned sat
[2023-03-09 08:25:53] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-09 08:25:57] [INFO ] After 2970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 08:25:58] [INFO ] Deduced a trap composed of 31 places in 1162 ms of which 1 ms to minimize.
[2023-03-09 08:25:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1559 ms
[2023-03-09 08:26:00] [INFO ] Deduced a trap composed of 141 places in 1272 ms of which 2 ms to minimize.
[2023-03-09 08:26:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1638 ms
[2023-03-09 08:26:02] [INFO ] Deduced a trap composed of 59 places in 1459 ms of which 2 ms to minimize.
[2023-03-09 08:26:03] [INFO ] Deduced a trap composed of 67 places in 1045 ms of which 2 ms to minimize.
[2023-03-09 08:26:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3030 ms
[2023-03-09 08:26:05] [INFO ] After 11377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1155 ms.
[2023-03-09 08:26:06] [INFO ] After 14379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 7 properties in 194 ms.
Support contains 3 out of 3131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Drop transitions removed 1268 transitions
Trivial Post-agglo rules discarded 1268 transitions
Performed 1268 trivial Post agglomeration. Transition count delta: 1268
Iterating post reduction 0 with 1268 rules applied. Total rules applied 1268 place count 3131 transition count 1777
Reduce places removed 1268 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 1412 rules applied. Total rules applied 2680 place count 1863 transition count 1633
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 2777 place count 1767 transition count 1632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2778 place count 1766 transition count 1632
Performed 351 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 351 Pre rules applied. Total rules applied 2778 place count 1766 transition count 1281
Deduced a syphon composed of 351 places in 9 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 4 with 702 rules applied. Total rules applied 3480 place count 1415 transition count 1281
Performed 572 Post agglomeration using F-continuation condition with reduction of 72 identical transitions.
Deduced a syphon composed of 572 places in 1 ms
Reduce places removed 572 places and 0 transitions.
Iterating global reduction 4 with 1144 rules applied. Total rules applied 4624 place count 843 transition count 637
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 144 times.
Iterating global reduction 4 with 144 rules applied. Total rules applied 4768 place count 843 transition count 493
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 4912 place count 699 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4913 place count 698 transition count 492
Reduce places removed 203 places and 0 transitions.
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 5 with 533 rules applied. Total rules applied 5446 place count 495 transition count 162
Reduce places removed 330 places and 0 transitions.
Iterating post reduction 6 with 330 rules applied. Total rules applied 5776 place count 165 transition count 162
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 52 Pre rules applied. Total rules applied 5776 place count 165 transition count 110
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 5880 place count 113 transition count 110
Applied a total of 5880 rules in 319 ms. Remains 113 /3131 variables (removed 3018) and now considering 110/3045 (removed 2935) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 113/3131 places, 110/3045 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Finished Best-First random walk after 5188 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=576 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 18 factoid took 1861 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 707 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 770 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 552 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 118 reset in 514 ms.
Product exploration explored 100000 steps with 122 reset in 521 ms.
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 231 ms. Remains 3131 /3131 variables (removed 0) and now considering 3045/3045 (removed 0) transitions.
[2023-03-09 08:26:12] [INFO ] Invariant cache hit.
[2023-03-09 08:26:14] [INFO ] Implicit Places using invariants in 1398 ms returned []
[2023-03-09 08:26:14] [INFO ] Invariant cache hit.
[2023-03-09 08:26:19] [INFO ] Implicit Places using invariants and state equation in 4943 ms returned []
Implicit Place search using SMT with State Equation took 6346 ms to find 0 implicit places.
[2023-03-09 08:26:19] [INFO ] Invariant cache hit.
[2023-03-09 08:26:22] [INFO ] Dead Transitions using invariants and state equation in 2955 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9545 ms. Remains : 3131/3131 places, 3045/3045 transitions.
Treatment of property AutoFlight-PT-48b-LTLFireability-01 finished in 74721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3139/3139 places, 3053/3053 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 3138 transition count 1777
Reduce places removed 1275 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 1420 rules applied. Total rules applied 2695 place count 1863 transition count 1632
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2791 place count 1767 transition count 1632
Performed 351 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 351 Pre rules applied. Total rules applied 2791 place count 1767 transition count 1281
Deduced a syphon composed of 351 places in 7 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 3 with 702 rules applied. Total rules applied 3493 place count 1416 transition count 1281
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3499 place count 1410 transition count 1275
Iterating global reduction 3 with 6 rules applied. Total rules applied 3505 place count 1410 transition count 1275
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3505 place count 1410 transition count 1273
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3509 place count 1408 transition count 1273
Performed 567 Post agglomeration using F-continuation condition with reduction of 71 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 4643 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 4644 place count 840 transition count 634
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 3 with 140 rules applied. Total rules applied 4784 place count 746 transition count 588
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 4830 place count 700 transition count 588
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4830 place count 700 transition count 540
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4926 place count 652 transition count 540
Applied a total of 4926 rules in 343 ms. Remains 652 /3139 variables (removed 2487) and now considering 540/3053 (removed 2513) transitions.
// Phase 1: matrix 540 rows 652 cols
[2023-03-09 08:26:22] [INFO ] Computed 164 place invariants in 5 ms
[2023-03-09 08:26:23] [INFO ] Implicit Places using invariants in 389 ms returned [256, 330, 368, 442, 480, 484, 488, 492, 496, 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, 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 390 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 599/3139 places, 540/3053 transitions.
Graph (trivial) has 247 edges and 599 vertex of which 11 / 599 are part of one of the 1 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 42 place count 548 transition count 480
Iterating global reduction 0 with 41 rules applied. Total rules applied 83 place count 548 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 546 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 546 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 544 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 544 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 542 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 542 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 540 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 540 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 538 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 538 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 536 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 536 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 534 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 534 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 532 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 532 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 530 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 530 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 528 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 528 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 125 place count 526 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 526 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 129 place count 524 transition count 456
Iterating global reduction 0 with 2 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 154 place count 512 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 155 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 157 place count 511 transition count 443
Applied a total of 157 rules in 197 ms. Remains 511 /599 variables (removed 88) and now considering 443/540 (removed 97) transitions.
// Phase 1: matrix 443 rows 511 cols
[2023-03-09 08:26:23] [INFO ] Computed 111 place invariants in 4 ms
[2023-03-09 08:26:23] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-09 08:26:23] [INFO ] Invariant cache hit.
[2023-03-09 08:26:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:26:24] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 511/3139 places, 443/3053 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2013 ms. Remains : 511/3139 places, 443/3053 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s255 0) (EQ s485 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 858 reset in 657 ms.
Product exploration explored 100000 steps with 856 reset in 640 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)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 206 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 42 ms :[(NOT p0)]
Finished random walk after 5387 steps, including 46 resets, run visited all 1 properties in 63 ms. (steps per millisecond=85 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 141 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 72 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Support contains 2 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 443/443 transitions.
Applied a total of 0 rules in 21 ms. Remains 511 /511 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2023-03-09 08:26:26] [INFO ] Invariant cache hit.
[2023-03-09 08:26:26] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-09 08:26:26] [INFO ] Invariant cache hit.
[2023-03-09 08:26:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:26:27] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
[2023-03-09 08:26:27] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-09 08:26:27] [INFO ] Invariant cache hit.
[2023-03-09 08:26:28] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1603 ms. Remains : 511/511 places, 443/443 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)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 153 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 26 ms :[(NOT p0)]
Finished random walk after 5422 steps, including 46 resets, run visited all 1 properties in 33 ms. (steps per millisecond=164 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 216 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 83 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 856 reset in 549 ms.
Stack based approach found an accepted trace after 14120 steps with 121 reset with depth 110 and stack size 110 in 78 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-03 finished in 7151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(G(p1)))))'
Support contains 2 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3133 transition count 3047
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3133 transition count 3047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3132 transition count 3046
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3132 transition count 3046
Applied a total of 14 rules in 728 ms. Remains 3132 /3139 variables (removed 7) and now considering 3046/3053 (removed 7) transitions.
// Phase 1: matrix 3046 rows 3132 cols
[2023-03-09 08:26:30] [INFO ] Computed 258 place invariants in 13 ms
[2023-03-09 08:26:31] [INFO ] Implicit Places using invariants in 1444 ms returned []
[2023-03-09 08:26:31] [INFO ] Invariant cache hit.
[2023-03-09 08:26:37] [INFO ] Implicit Places using invariants and state equation in 5227 ms returned []
Implicit Place search using SMT with State Equation took 6687 ms to find 0 implicit places.
[2023-03-09 08:26:37] [INFO ] Invariant cache hit.
[2023-03-09 08:26:39] [INFO ] Dead Transitions using invariants and state equation in 1886 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3132/3139 places, 3046/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9303 ms. Remains : 3132/3139 places, 3046/3053 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s365 1), p1:(EQ s950 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, 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-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-06 finished in 9529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&F(p2)))))'
Support contains 4 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3133 transition count 3047
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3133 transition count 3047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3131 transition count 3045
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3131 transition count 3045
Applied a total of 16 rules in 698 ms. Remains 3131 /3139 variables (removed 8) and now considering 3045/3053 (removed 8) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2023-03-09 08:26:39] [INFO ] Computed 258 place invariants in 30 ms
[2023-03-09 08:26:41] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2023-03-09 08:26:41] [INFO ] Invariant cache hit.
[2023-03-09 08:26:46] [INFO ] Implicit Places using invariants and state equation in 5326 ms returned []
Implicit Place search using SMT with State Equation took 6514 ms to find 0 implicit places.
[2023-03-09 08:26:46] [INFO ] Invariant cache hit.
[2023-03-09 08:26:49] [INFO ] Dead Transitions using invariants and state equation in 2795 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3139 places, 3045/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10016 ms. Remains : 3131/3139 places, 3045/3053 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s3031 1), p1:(EQ s48 1), p2:(AND (EQ s2488 1) (EQ s3129 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1858 steps with 0 reset in 9 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-07 finished in 10350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(X(!(p0 U p1)))||!(p1 U X((p1 U p2)))))))'
Support contains 3 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3133 transition count 3047
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3133 transition count 3047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3132 transition count 3046
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3132 transition count 3046
Applied a total of 14 rules in 726 ms. Remains 3132 /3139 variables (removed 7) and now considering 3046/3053 (removed 7) transitions.
// Phase 1: matrix 3046 rows 3132 cols
[2023-03-09 08:26:50] [INFO ] Computed 258 place invariants in 28 ms
[2023-03-09 08:26:51] [INFO ] Implicit Places using invariants in 1558 ms returned []
[2023-03-09 08:26:51] [INFO ] Invariant cache hit.
[2023-03-09 08:26:57] [INFO ] Implicit Places using invariants and state equation in 5556 ms returned []
Implicit Place search using SMT with State Equation took 7151 ms to find 0 implicit places.
[2023-03-09 08:26:57] [INFO ] Invariant cache hit.
[2023-03-09 08:27:00] [INFO ] Dead Transitions using invariants and state equation in 3080 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3132/3139 places, 3046/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10974 ms. Remains : 3132/3139 places, 3046/3053 transitions.
Stuttering acceptance computed with spot in 279 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), false]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={1, 2} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1, 2} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1967 1), p2:(EQ s524 1), p0:(EQ s1125 1)], nbAcceptance=3, 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 33333 reset in 1328 ms.
Product exploration explored 100000 steps with 33333 reset in 1257 ms.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p2) (NOT p0))
Knowledge based reduction with 6 factoid took 307 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLFireability-10 finished in 14290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U G((p0 U p1))))'
Support contains 3 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3132 transition count 3046
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3132 transition count 3046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 3130 transition count 3044
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 3130 transition count 3044
Applied a total of 18 rules in 792 ms. Remains 3130 /3139 variables (removed 9) and now considering 3044/3053 (removed 9) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2023-03-09 08:27:04] [INFO ] Computed 258 place invariants in 16 ms
[2023-03-09 08:27:05] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2023-03-09 08:27:05] [INFO ] Invariant cache hit.
[2023-03-09 08:27:11] [INFO ] Implicit Places using invariants and state equation in 5876 ms returned []
Implicit Place search using SMT with State Equation took 7074 ms to find 0 implicit places.
[2023-03-09 08:27:11] [INFO ] Invariant cache hit.
[2023-03-09 08:27:14] [INFO ] Dead Transitions using invariants and state equation in 2749 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3130/3139 places, 3044/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10621 ms. Remains : 3130/3139 places, 3044/3053 transitions.
Stuttering acceptance computed with spot in 497 ms :[(NOT p1), p0, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s250 1), p0:(AND (EQ s2831 1) (EQ s3126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33367 reset in 1321 ms.
Product exploration explored 100000 steps with 33298 reset in 1229 ms.
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 (NOT p1) (NOT p0)), (X (NOT (OR p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 814 ms. Reduced automaton from 8 states, 18 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 4978 steps, including 2 resets, run visited all 5 properties in 115 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (OR p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p0), (F (OR p1 p0)), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 11 factoid took 1011 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 298 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
[2023-03-09 08:27:20] [INFO ] Invariant cache hit.
[2023-03-09 08:27:22] [INFO ] [Real]Absence check using 257 positive place invariants in 486 ms returned sat
[2023-03-09 08:27:22] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-09 08:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:27:35] [INFO ] [Real]Absence check using state equation in 13046 ms returned unknown
Could not prove EG (NOT p1)
Support contains 3 out of 3130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3130/3130 places, 3044/3044 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1269 transitions
Trivial Post-agglo rules discarded 1269 transitions
Performed 1269 trivial Post agglomeration. Transition count delta: 1269
Iterating post reduction 0 with 1269 rules applied. Total rules applied 1269 place count 3129 transition count 1774
Reduce places removed 1269 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 1413 rules applied. Total rules applied 2682 place count 1860 transition count 1630
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 2779 place count 1764 transition count 1629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2780 place count 1763 transition count 1629
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 350 Pre rules applied. Total rules applied 2780 place count 1763 transition count 1279
Deduced a syphon composed of 350 places in 8 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 4 with 700 rules applied. Total rules applied 3480 place count 1413 transition count 1279
Performed 570 Post agglomeration using F-continuation condition with reduction of 72 identical transitions.
Deduced a syphon composed of 570 places in 1 ms
Reduce places removed 570 places and 0 transitions.
Iterating global reduction 4 with 1140 rules applied. Total rules applied 4620 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 4621 place count 842 transition count 636
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 4 with 144 rules applied. Total rules applied 4765 place count 746 transition count 588
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 4813 place count 698 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 4813 place count 698 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 4909 place count 650 transition count 540
Applied a total of 4909 rules in 311 ms. Remains 650 /3130 variables (removed 2480) and now considering 540/3044 (removed 2504) transitions.
// Phase 1: matrix 540 rows 650 cols
[2023-03-09 08:27:35] [INFO ] Computed 162 place invariants in 4 ms
[2023-03-09 08:27:36] [INFO ] Implicit Places using invariants in 426 ms returned [254, 328, 366, 440, 478, 482, 486, 490, 494, 498, 502, 506, 510, 514, 518, 522, 526, 530, 534, 538, 542, 546, 550, 554, 558, 562, 566, 570, 574, 576, 578, 580, 582, 587, 589, 591, 593, 595, 597, 599, 603, 607, 611, 615, 619, 623, 627, 631, 635, 639, 643, 649]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 428 ms to find 52 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 598/3130 places, 540/3044 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 598 transition count 528
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 34 place count 586 transition count 518
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 73 place count 547 transition count 479
Iterating global reduction 2 with 39 rules applied. Total rules applied 112 place count 547 transition count 479
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 545 transition count 477
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 545 transition count 477
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 543 transition count 475
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 543 transition count 475
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 541 transition count 473
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 541 transition count 473
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 539 transition count 471
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 539 transition count 471
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 537 transition count 469
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 537 transition count 469
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 535 transition count 467
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 535 transition count 467
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 533 transition count 465
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 533 transition count 465
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 142 place count 531 transition count 463
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 531 transition count 463
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 529 transition count 461
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 529 transition count 461
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 527 transition count 459
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 527 transition count 459
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 525 transition count 457
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 525 transition count 457
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 523 transition count 455
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 523 transition count 455
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 522 transition count 454
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 522 transition count 454
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 521 transition count 453
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 521 transition count 453
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 520 transition count 452
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 520 transition count 452
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 519 transition count 451
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 519 transition count 451
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 518 transition count 450
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 518 transition count 450
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 517 transition count 449
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 517 transition count 449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 516 transition count 448
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 516 transition count 448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 515 transition count 447
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 515 transition count 447
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 514 transition count 446
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 514 transition count 446
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 513 transition count 445
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 513 transition count 445
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 512 transition count 444
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 512 transition count 444
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 511 transition count 443
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 511 transition count 443
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 186 place count 510 transition count 442
Applied a total of 186 rules in 163 ms. Remains 510 /598 variables (removed 88) and now considering 442/540 (removed 98) transitions.
// Phase 1: matrix 442 rows 510 cols
[2023-03-09 08:27:36] [INFO ] Computed 110 place invariants in 4 ms
[2023-03-09 08:27:36] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-09 08:27:36] [INFO ] Invariant cache hit.
[2023-03-09 08:27:37] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 510/3130 places, 442/3044 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2144 ms. Remains : 510/3130 places, 442/3044 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true]
False Knowledge obtained : [(X (OR p1 p0)), (X (NOT (OR p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 820 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 2503 steps, including 21 resets, run visited all 5 properties in 89 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true]
False Knowledge obtained : [(X (OR p1 p0)), (X (NOT (OR p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F (AND p1 (NOT p0))), (F p0), (F (OR p1 p0)), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 876 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
[2023-03-09 08:27:40] [INFO ] Invariant cache hit.
[2023-03-09 08:27:40] [INFO ] [Real]Absence check using 110 positive place invariants in 29 ms returned sat
[2023-03-09 08:27:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:27:41] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2023-03-09 08:27:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:27:41] [INFO ] [Nat]Absence check using 110 positive place invariants in 52 ms returned sat
[2023-03-09 08:27:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:27:42] [INFO ] [Nat]Absence check using state equation in 958 ms returned sat
[2023-03-09 08:27:42] [INFO ] Computed and/alt/rep : 297/488/297 causal constraints (skipped 1 transitions) in 34 ms.
[2023-03-09 08:27:43] [INFO ] Added : 3 causal constraints over 2 iterations in 263 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 30295 reset in 773 ms.
Entered a terminal (fully accepting) state of product in 96022 steps with 29171 reset in 733 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-13 finished in 41220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 2 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3132 transition count 3046
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3132 transition count 3046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 3130 transition count 3044
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 3130 transition count 3044
Applied a total of 18 rules in 829 ms. Remains 3130 /3139 variables (removed 9) and now considering 3044/3053 (removed 9) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2023-03-09 08:27:45] [INFO ] Computed 258 place invariants in 11 ms
[2023-03-09 08:27:47] [INFO ] Implicit Places using invariants in 1720 ms returned []
[2023-03-09 08:27:47] [INFO ] Invariant cache hit.
[2023-03-09 08:27:54] [INFO ] Implicit Places using invariants and state equation in 6524 ms returned []
Implicit Place search using SMT with State Equation took 8276 ms to find 0 implicit places.
[2023-03-09 08:27:54] [INFO ] Invariant cache hit.
[2023-03-09 08:27:56] [INFO ] Dead Transitions using invariants and state equation in 1831 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3130/3139 places, 3044/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10950 ms. Remains : 3130/3139 places, 3044/3053 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(NEQ s1699 1), p0:(EQ s2436 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 50000 reset in 1771 ms.
Product exploration explored 100000 steps with 50000 reset in 1556 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 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 9 factoid took 207 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLFireability-14 finished in 14777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X((G(p1)||X(p2))))))'
Found a Shortening insensitive property : AutoFlight-PT-48b-LTLFireability-01
Stuttering acceptance computed with spot in 703 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 3139 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1272 transitions
Trivial Post-agglo rules discarded 1272 transitions
Performed 1272 trivial Post agglomeration. Transition count delta: 1272
Iterating post reduction 0 with 1272 rules applied. Total rules applied 1272 place count 3138 transition count 1780
Reduce places removed 1272 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 1417 rules applied. Total rules applied 2689 place count 1866 transition count 1635
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 2786 place count 1770 transition count 1634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2787 place count 1769 transition count 1634
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 350 Pre rules applied. Total rules applied 2787 place count 1769 transition count 1284
Deduced a syphon composed of 350 places in 8 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 4 with 700 rules applied. Total rules applied 3487 place count 1419 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 3492 place count 1414 transition count 1279
Iterating global reduction 4 with 5 rules applied. Total rules applied 3497 place count 1414 transition count 1279
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3497 place count 1414 transition count 1277
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3501 place count 1412 transition count 1277
Performed 569 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 569 places in 0 ms
Reduce places removed 569 places and 0 transitions.
Iterating global reduction 4 with 1138 rules applied. Total rules applied 4639 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 4640 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 4782 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 4829 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 4829 place count 700 transition count 541
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 4925 place count 652 transition count 541
Applied a total of 4925 rules in 443 ms. Remains 652 /3139 variables (removed 2487) and now considering 541/3053 (removed 2512) transitions.
// Phase 1: matrix 541 rows 652 cols
[2023-03-09 08:28:01] [INFO ] Computed 163 place invariants in 3 ms
[2023-03-09 08:28:01] [INFO ] Implicit Places using invariants in 588 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 598 ms to find 52 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 600/3139 places, 541/3053 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 1 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 187 ms. Remains 524 /600 variables (removed 76) and now considering 455/541 (removed 86) transitions.
// Phase 1: matrix 455 rows 524 cols
[2023-03-09 08:28:01] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-09 08:28:02] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-09 08:28:02] [INFO ] Invariant cache hit.
[2023-03-09 08:28:02] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 524/3139 places, 455/3053 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2361 ms. Remains : 524/3139 places, 455/3053 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 1170 steps with 22 reset in 9 ms.
Treatment of property AutoFlight-PT-48b-LTLFireability-01 finished in 3184 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-09 08:28:03] [INFO ] Flatten gal took : 86 ms
[2023-03-09 08:28:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-09 08:28:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3139 places, 3053 transitions and 7338 arcs took 15 ms.
Total runtime 223821 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutoFlight-PT-48b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

BK_STOP 1678350748902

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 AutoFlight-PT-48b-LTLFireability-01
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3599 5/32 AutoFlight-PT-48b-LTLFireability-01 150209 m, 30041 m/sec, 211206 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3599 5/32 AutoFlight-PT-48b-LTLFireability-01 208599 m, 11678 m/sec, 533474 t fired, .

Time elapsed: 10 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3599 6/32 AutoFlight-PT-48b-LTLFireability-01 265161 m, 11312 m/sec, 857005 t fired, .

Time elapsed: 15 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3599 7/32 AutoFlight-PT-48b-LTLFireability-01 317939 m, 10555 m/sec, 1180307 t fired, .

Time elapsed: 20 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3599 7/32 AutoFlight-PT-48b-LTLFireability-01 365438 m, 9499 m/sec, 1504682 t fired, .

Time elapsed: 25 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3599 8/32 AutoFlight-PT-48b-LTLFireability-01 416310 m, 10174 m/sec, 1829466 t fired, .

Time elapsed: 30 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3599 8/32 AutoFlight-PT-48b-LTLFireability-01 468151 m, 10368 m/sec, 2153051 t fired, .

Time elapsed: 35 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/3599 9/32 AutoFlight-PT-48b-LTLFireability-01 515479 m, 9465 m/sec, 2476880 t fired, .

Time elapsed: 40 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/3599 9/32 AutoFlight-PT-48b-LTLFireability-01 565031 m, 9910 m/sec, 2800502 t fired, .

Time elapsed: 45 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/3599 10/32 AutoFlight-PT-48b-LTLFireability-01 608691 m, 8732 m/sec, 3123216 t fired, .

Time elapsed: 50 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/3599 10/32 AutoFlight-PT-48b-LTLFireability-01 649732 m, 8208 m/sec, 3447672 t fired, .

Time elapsed: 55 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/3599 11/32 AutoFlight-PT-48b-LTLFireability-01 692793 m, 8612 m/sec, 3772419 t fired, .

Time elapsed: 60 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/3599 11/32 AutoFlight-PT-48b-LTLFireability-01 745401 m, 10521 m/sec, 4096491 t fired, .

Time elapsed: 65 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 69/3599 12/32 AutoFlight-PT-48b-LTLFireability-01 792981 m, 9516 m/sec, 4420960 t fired, .

Time elapsed: 70 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 74/3599 13/32 AutoFlight-PT-48b-LTLFireability-01 842838 m, 9971 m/sec, 4744923 t fired, .

Time elapsed: 75 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 79/3599 13/32 AutoFlight-PT-48b-LTLFireability-01 886764 m, 8785 m/sec, 5069000 t fired, .

Time elapsed: 80 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 84/3599 14/32 AutoFlight-PT-48b-LTLFireability-01 927893 m, 8225 m/sec, 5394820 t fired, .

Time elapsed: 85 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 89/3599 14/32 AutoFlight-PT-48b-LTLFireability-01 971260 m, 8673 m/sec, 5721546 t fired, .

Time elapsed: 90 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 94/3599 15/32 AutoFlight-PT-48b-LTLFireability-01 1023667 m, 10481 m/sec, 6045288 t fired, .

Time elapsed: 95 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 99/3599 15/32 AutoFlight-PT-48b-LTLFireability-01 1071140 m, 9494 m/sec, 6369844 t fired, .

Time elapsed: 100 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 104/3599 16/32 AutoFlight-PT-48b-LTLFireability-01 1121282 m, 10028 m/sec, 6693919 t fired, .

Time elapsed: 105 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 109/3599 16/32 AutoFlight-PT-48b-LTLFireability-01 1165467 m, 8837 m/sec, 7019928 t fired, .

Time elapsed: 110 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 114/3599 17/32 AutoFlight-PT-48b-LTLFireability-01 1206659 m, 8238 m/sec, 7346380 t fired, .

Time elapsed: 115 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 119/3599 17/32 AutoFlight-PT-48b-LTLFireability-01 1250212 m, 8710 m/sec, 7673375 t fired, .

Time elapsed: 120 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 124/3599 18/32 AutoFlight-PT-48b-LTLFireability-01 1302389 m, 10435 m/sec, 7997426 t fired, .

Time elapsed: 125 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 129/3599 18/32 AutoFlight-PT-48b-LTLFireability-01 1349986 m, 9519 m/sec, 8322119 t fired, .

Time elapsed: 130 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 134/3599 19/32 AutoFlight-PT-48b-LTLFireability-01 1400106 m, 10024 m/sec, 8646992 t fired, .

Time elapsed: 135 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 139/3599 20/32 AutoFlight-PT-48b-LTLFireability-01 1444204 m, 8819 m/sec, 8971171 t fired, .

Time elapsed: 140 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 144/3599 20/32 AutoFlight-PT-48b-LTLFireability-01 1485303 m, 8219 m/sec, 9296900 t fired, .

Time elapsed: 145 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 149/3599 21/32 AutoFlight-PT-48b-LTLFireability-01 1528913 m, 8722 m/sec, 9622237 t fired, .

Time elapsed: 150 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 154/3599 21/32 AutoFlight-PT-48b-LTLFireability-01 1574372 m, 9091 m/sec, 9946491 t fired, .

Time elapsed: 155 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 159/3599 22/32 AutoFlight-PT-48b-LTLFireability-01 1616853 m, 8496 m/sec, 10272077 t fired, .

Time elapsed: 160 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 164/3599 22/32 AutoFlight-PT-48b-LTLFireability-01 1659028 m, 8435 m/sec, 10598373 t fired, .

Time elapsed: 165 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 169/3599 23/32 AutoFlight-PT-48b-LTLFireability-01 1700685 m, 8331 m/sec, 10924132 t fired, .

Time elapsed: 170 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 174/3599 23/32 AutoFlight-PT-48b-LTLFireability-01 1739232 m, 7709 m/sec, 11250488 t fired, .

Time elapsed: 175 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 179/3599 23/32 AutoFlight-PT-48b-LTLFireability-01 1775867 m, 7327 m/sec, 11576943 t fired, .

Time elapsed: 180 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 184/3599 24/32 AutoFlight-PT-48b-LTLFireability-01 1815292 m, 7885 m/sec, 11903819 t fired, .

Time elapsed: 185 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 189/3599 24/32 AutoFlight-PT-48b-LTLFireability-01 1867334 m, 10408 m/sec, 12227771 t fired, .

Time elapsed: 190 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 194/3599 25/32 AutoFlight-PT-48b-LTLFireability-01 1914889 m, 9511 m/sec, 12552764 t fired, .

Time elapsed: 195 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 199/3599 26/32 AutoFlight-PT-48b-LTLFireability-01 1964650 m, 9952 m/sec, 12877965 t fired, .

Time elapsed: 200 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 204/3599 26/32 AutoFlight-PT-48b-LTLFireability-01 2008710 m, 8812 m/sec, 13203740 t fired, .

Time elapsed: 205 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 209/3599 27/32 AutoFlight-PT-48b-LTLFireability-01 2049940 m, 8246 m/sec, 13529473 t fired, .

Time elapsed: 210 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 214/3599 27/32 AutoFlight-PT-48b-LTLFireability-01 2093845 m, 8781 m/sec, 13856536 t fired, .

Time elapsed: 215 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 219/3599 28/32 AutoFlight-PT-48b-LTLFireability-01 2146215 m, 10474 m/sec, 14181178 t fired, .

Time elapsed: 220 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 224/3599 28/32 AutoFlight-PT-48b-LTLFireability-01 2194027 m, 9562 m/sec, 14507007 t fired, .

Time elapsed: 225 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 229/3599 29/32 AutoFlight-PT-48b-LTLFireability-01 2243992 m, 9993 m/sec, 14833045 t fired, .

Time elapsed: 230 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 234/3599 29/32 AutoFlight-PT-48b-LTLFireability-01 2288216 m, 8844 m/sec, 15160062 t fired, .

Time elapsed: 235 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 239/3599 30/32 AutoFlight-PT-48b-LTLFireability-01 2329643 m, 8285 m/sec, 15487390 t fired, .

Time elapsed: 240 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 244/3599 30/32 AutoFlight-PT-48b-LTLFireability-01 2373599 m, 8791 m/sec, 15815080 t fired, .

Time elapsed: 245 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 249/3599 31/32 AutoFlight-PT-48b-LTLFireability-01 2426096 m, 10499 m/sec, 16140516 t fired, .

Time elapsed: 250 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 254/3599 31/32 AutoFlight-PT-48b-LTLFireability-01 2473972 m, 9575 m/sec, 16466688 t fired, .

Time elapsed: 255 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 259/3599 32/32 AutoFlight-PT-48b-LTLFireability-01 2524008 m, 10007 m/sec, 16793291 t fired, .

Time elapsed: 260 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for AutoFlight-PT-48b-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-48b-LTLFireability-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 265 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-48b-LTLFireability-01: LTL unknown AGGR


Time elapsed: 265 secs. Pages in use: 32

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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
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 r007-oct2-167813595600508"
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 ;