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.r009-oct2-167813598000492.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 ltsminxred
Input is AutoFlight-PT-24b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598000492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:17 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.9K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 18:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 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 538K 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-24b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678632115450

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:41:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 14:41:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:41:59] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-12 14:41:59] [INFO ] Transformed 2230 places.
[2023-03-12 14:41:59] [INFO ] Transformed 2228 transitions.
[2023-03-12 14:41:59] [INFO ] Found NUPN structural information;
[2023-03-12 14:41:59] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 443 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 4 formulas.
FORMULA AutoFlight-PT-24b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 2230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Discarding 307 places :
Symmetric choice reduction at 0 with 307 rule applications. Total rules 307 place count 1923 transition count 1921
Iterating global reduction 0 with 307 rules applied. Total rules applied 614 place count 1923 transition count 1921
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 661 place count 1923 transition count 1874
Discarding 138 places :
Symmetric choice reduction at 1 with 138 rule applications. Total rules 799 place count 1785 transition count 1736
Iterating global reduction 1 with 138 rules applied. Total rules applied 937 place count 1785 transition count 1736
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 959 place count 1763 transition count 1714
Iterating global reduction 1 with 22 rules applied. Total rules applied 981 place count 1763 transition count 1714
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1001 place count 1743 transition count 1694
Iterating global reduction 1 with 20 rules applied. Total rules applied 1021 place count 1743 transition count 1694
Applied a total of 1021 rules in 1151 ms. Remains 1743 /2230 variables (removed 487) and now considering 1694/2228 (removed 534) transitions.
// Phase 1: matrix 1694 rows 1743 cols
[2023-03-12 14:42:01] [INFO ] Computed 148 place invariants in 43 ms
[2023-03-12 14:42:06] [INFO ] Implicit Places using invariants in 6000 ms returned []
[2023-03-12 14:42:07] [INFO ] Invariant cache hit.
[2023-03-12 14:42:12] [INFO ] Implicit Places using invariants and state equation in 5862 ms returned []
Implicit Place search using SMT with State Equation took 11974 ms to find 0 implicit places.
[2023-03-12 14:42:12] [INFO ] Invariant cache hit.
[2023-03-12 14:42:16] [INFO ] Dead Transitions using invariants and state equation in 3724 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1743/2230 places, 1694/2228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16865 ms. Remains : 1743/2230 places, 1694/2228 transitions.
Support contains 32 out of 1743 places after structural reductions.
[2023-03-12 14:42:17] [INFO ] Flatten gal took : 228 ms
[2023-03-12 14:42:17] [INFO ] Flatten gal took : 67 ms
[2023-03-12 14:42:17] [INFO ] Input system was already deterministic with 1694 transitions.
Support contains 31 out of 1743 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 26) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-12 14:42:18] [INFO ] Invariant cache hit.
[2023-03-12 14:42:19] [INFO ] After 875ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 14:42:20] [INFO ] [Nat]Absence check using 147 positive place invariants in 211 ms returned sat
[2023-03-12 14:42:21] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 41 ms returned sat
[2023-03-12 14:42:29] [INFO ] After 7353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-12 14:42:32] [INFO ] Deduced a trap composed of 19 places in 3155 ms of which 20 ms to minimize.
[2023-03-12 14:42:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3373 ms
[2023-03-12 14:42:33] [INFO ] Deduced a trap composed of 31 places in 726 ms of which 2 ms to minimize.
[2023-03-12 14:42:35] [INFO ] Deduced a trap composed of 93 places in 2046 ms of which 15 ms to minimize.
[2023-03-12 14:42:37] [INFO ] Deduced a trap composed of 92 places in 1747 ms of which 3 ms to minimize.
[2023-03-12 14:42:39] [INFO ] Deduced a trap composed of 204 places in 1691 ms of which 23 ms to minimize.
[2023-03-12 14:42:40] [INFO ] Deduced a trap composed of 287 places in 1158 ms of which 1 ms to minimize.
[2023-03-12 14:42:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 7791 ms
[2023-03-12 14:42:42] [INFO ] Deduced a trap composed of 281 places in 1040 ms of which 25 ms to minimize.
[2023-03-12 14:42:43] [INFO ] Deduced a trap composed of 382 places in 919 ms of which 1 ms to minimize.
[2023-03-12 14:42:47] [INFO ] Deduced a trap composed of 281 places in 4065 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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-12 14:42:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 14:42:47] [INFO ] After 27913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 9 properties in 524 ms.
Support contains 5 out of 1743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 1743 transition count 1065
Reduce places removed 629 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 1 with 702 rules applied. Total rules applied 1331 place count 1114 transition count 992
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1379 place count 1066 transition count 992
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1379 place count 1066 transition count 793
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1777 place count 867 transition count 793
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1780 place count 864 transition count 790
Iterating global reduction 3 with 3 rules applied. Total rules applied 1783 place count 864 transition count 790
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1783 place count 864 transition count 788
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1787 place count 862 transition count 788
Performed 341 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 2469 place count 521 transition count 400
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2470 place count 521 transition count 399
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2472 place count 520 transition count 398
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2568 place count 520 transition count 302
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2664 place count 424 transition count 302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2665 place count 423 transition count 301
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 4 with 302 rules applied. Total rules applied 2967 place count 308 transition count 114
Reduce places removed 187 places and 0 transitions.
Iterating post reduction 5 with 187 rules applied. Total rules applied 3154 place count 121 transition count 114
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 35 Pre rules applied. Total rules applied 3154 place count 121 transition count 79
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 3224 place count 86 transition count 79
Applied a total of 3224 rules in 419 ms. Remains 86 /1743 variables (removed 1657) and now considering 79/1694 (removed 1615) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 86/1743 places, 79/1694 transitions.
Finished random walk after 63 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=21 )
Computed a total of 430 stabilizing places and 430 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 2 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 1742 transition count 1063
Reduce places removed 630 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 1 with 703 rules applied. Total rules applied 1333 place count 1112 transition count 990
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1381 place count 1064 transition count 990
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 1381 place count 1064 transition count 792
Deduced a syphon composed of 198 places in 4 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 1777 place count 866 transition count 792
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1784 place count 859 transition count 785
Iterating global reduction 3 with 7 rules applied. Total rules applied 1791 place count 859 transition count 785
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1791 place count 859 transition count 780
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1801 place count 854 transition count 780
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 2481 place count 514 transition count 392
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 2482 place count 513 transition count 391
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2554 place count 465 transition count 367
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2578 place count 441 transition count 367
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2578 place count 441 transition count 343
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2626 place count 417 transition count 343
Applied a total of 2626 rules in 331 ms. Remains 417 /1743 variables (removed 1326) and now considering 343/1694 (removed 1351) transitions.
// Phase 1: matrix 343 rows 417 cols
[2023-03-12 14:42:49] [INFO ] Computed 100 place invariants in 3 ms
[2023-03-12 14:42:51] [INFO ] Implicit Places using invariants in 1821 ms returned [171, 245, 319, 323, 327, 331, 335, 339, 343, 347, 351, 355, 359, 363, 367, 371, 375, 379, 383, 387, 391, 395, 399, 403, 407, 411, 416]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 1834 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 390/1743 places, 343/1694 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 365 transition count 318
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 365 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 364 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 362 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 357 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 356 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 355 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 354 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 353 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 352 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 351 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 350 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 349 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 348 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 347 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 346 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 345 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 344 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 344 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 343 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 343 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 342 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 342 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 341 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 341 transition count 294
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 100 place count 340 transition count 293
Applied a total of 100 rules in 261 ms. Remains 340 /390 variables (removed 50) and now considering 293/343 (removed 50) transitions.
// Phase 1: matrix 293 rows 340 cols
[2023-03-12 14:42:51] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-12 14:42:51] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-12 14:42:51] [INFO ] Invariant cache hit.
[2023-03-12 14:42:53] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 1917 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 340/1743 places, 293/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4343 ms. Remains : 340/1743 places, 293/1694 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-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:(OR (EQ s137 1) (EQ s36 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1243 reset in 792 ms.
Product exploration explored 100000 steps with 1233 reset in 1038 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1463 steps, including 17 resets, run visited all 1 properties in 16 ms. (steps per millisecond=91 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 274 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 340 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 340/340 places, 293/293 transitions.
Applied a total of 0 rules in 26 ms. Remains 340 /340 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-12 14:42:56] [INFO ] Invariant cache hit.
[2023-03-12 14:42:56] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-12 14:42:56] [INFO ] Invariant cache hit.
[2023-03-12 14:43:00] [INFO ] Implicit Places using invariants and state equation in 3633 ms returned []
Implicit Place search using SMT with State Equation took 3995 ms to find 0 implicit places.
[2023-03-12 14:43:00] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-12 14:43:00] [INFO ] Invariant cache hit.
[2023-03-12 14:43:02] [INFO ] Dead Transitions using invariants and state equation in 1421 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5479 ms. Remains : 340/340 places, 293/293 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7437 steps, including 94 resets, run visited all 1 properties in 59 ms. (steps per millisecond=126 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1233 reset in 537 ms.
Product exploration explored 100000 steps with 1230 reset in 426 ms.
Support contains 2 out of 340 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 340/340 places, 293/293 transitions.
Applied a total of 0 rules in 38 ms. Remains 340 /340 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-12 14:43:04] [INFO ] Invariant cache hit.
[2023-03-12 14:43:04] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-12 14:43:04] [INFO ] Invariant cache hit.
[2023-03-12 14:43:05] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
[2023-03-12 14:43:05] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-12 14:43:05] [INFO ] Invariant cache hit.
[2023-03-12 14:43:05] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1453 ms. Remains : 340/340 places, 293/293 transitions.
Treatment of property AutoFlight-PT-24b-LTLFireability-00 finished in 16883 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&&G((F(p1)&&X(p2))))))'
Support contains 3 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 1742 transition count 1067
Reduce places removed 626 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 1 with 699 rules applied. Total rules applied 1325 place count 1116 transition count 994
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 50 rules applied. Total rules applied 1375 place count 1068 transition count 992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1377 place count 1066 transition count 992
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1377 place count 1066 transition count 792
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1777 place count 866 transition count 792
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1784 place count 859 transition count 785
Iterating global reduction 4 with 7 rules applied. Total rules applied 1791 place count 859 transition count 785
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1791 place count 859 transition count 781
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1799 place count 855 transition count 781
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 676 rules applied. Total rules applied 2475 place count 517 transition count 395
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 2476 place count 516 transition count 394
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 72 rules applied. Total rules applied 2548 place count 468 transition count 370
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2572 place count 444 transition count 370
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2572 place count 444 transition count 346
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2620 place count 420 transition count 346
Applied a total of 2620 rules in 263 ms. Remains 420 /1743 variables (removed 1323) and now considering 346/1694 (removed 1348) transitions.
// Phase 1: matrix 346 rows 420 cols
[2023-03-12 14:43:06] [INFO ] Computed 100 place invariants in 19 ms
[2023-03-12 14:43:06] [INFO ] Implicit Places using invariants in 715 ms returned [378, 382, 386, 390, 394, 398, 402, 406, 410, 414, 419]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 729 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 409/1743 places, 346/1694 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 400 transition count 337
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 400 transition count 337
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 52 place count 383 transition count 320
Applied a total of 52 rules in 23 ms. Remains 383 /409 variables (removed 26) and now considering 320/346 (removed 26) transitions.
// Phase 1: matrix 320 rows 383 cols
[2023-03-12 14:43:06] [INFO ] Computed 89 place invariants in 2 ms
[2023-03-12 14:43:07] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-12 14:43:07] [INFO ] Invariant cache hit.
[2023-03-12 14:43:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 14:43:09] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 383/1743 places, 320/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3179 ms. Remains : 383/1743 places, 320/1694 transitions.
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) p2))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s358 1), p1:(EQ s245 0), p2:(EQ s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 965 steps with 19 reset in 8 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-03 finished in 3531 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(G(p1))&&p0)))'
Support contains 2 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 631 transitions
Trivial Post-agglo rules discarded 631 transitions
Performed 631 trivial Post agglomeration. Transition count delta: 631
Iterating post reduction 0 with 631 rules applied. Total rules applied 631 place count 1742 transition count 1062
Reduce places removed 631 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 1 with 704 rules applied. Total rules applied 1335 place count 1111 transition count 989
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1383 place count 1063 transition count 989
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1383 place count 1063 transition count 790
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1781 place count 864 transition count 790
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1789 place count 856 transition count 782
Iterating global reduction 3 with 8 rules applied. Total rules applied 1797 place count 856 transition count 782
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1797 place count 856 transition count 777
Deduced a syphon composed of 5 places in 48 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1807 place count 851 transition count 777
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 2487 place count 511 transition count 389
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 2488 place count 510 transition count 388
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2560 place count 462 transition count 364
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2584 place count 438 transition count 364
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2584 place count 438 transition count 340
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2632 place count 414 transition count 340
Applied a total of 2632 rules in 311 ms. Remains 414 /1743 variables (removed 1329) and now considering 340/1694 (removed 1354) transitions.
// Phase 1: matrix 340 rows 414 cols
[2023-03-12 14:43:09] [INFO ] Computed 100 place invariants in 4 ms
[2023-03-12 14:43:10] [INFO ] Implicit Places using invariants in 449 ms returned [168, 242, 316, 320, 324, 328, 332, 336, 340, 344, 348, 352, 356, 360, 364, 368, 372, 376, 380, 384, 388, 392, 396, 400, 404, 408, 413]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 452 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 387/1743 places, 340/1694 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 362 transition count 315
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 357 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 356 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 355 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 354 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 353 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 352 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 351 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 350 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 349 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 348 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 347 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 346 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 345 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 344 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 344 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 343 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 343 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 342 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 342 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 341 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 341 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 340 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 340 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 339 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 339 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 338 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 338 transition count 291
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 100 place count 337 transition count 290
Applied a total of 100 rules in 145 ms. Remains 337 /387 variables (removed 50) and now considering 290/340 (removed 50) transitions.
// Phase 1: matrix 290 rows 337 cols
[2023-03-12 14:43:10] [INFO ] Computed 73 place invariants in 4 ms
[2023-03-12 14:43:10] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-12 14:43:10] [INFO ] Invariant cache hit.
[2023-03-12 14:43:11] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 337/1743 places, 290/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2388 ms. Remains : 337/1743 places, 290/1694 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s146 1) (EQ s212 1)), p1:(AND (EQ s146 1) (EQ s212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-04 finished in 2557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1734 transition count 1685
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1734 transition count 1685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1734 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 1728 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1726 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1724 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1724 transition count 1674
Applied a total of 39 rules in 620 ms. Remains 1724 /1743 variables (removed 19) and now considering 1674/1694 (removed 20) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2023-03-12 14:43:12] [INFO ] Computed 148 place invariants in 27 ms
[2023-03-12 14:43:14] [INFO ] Implicit Places using invariants in 1849 ms returned []
[2023-03-12 14:43:14] [INFO ] Invariant cache hit.
[2023-03-12 14:43:20] [INFO ] Implicit Places using invariants and state equation in 5916 ms returned []
Implicit Place search using SMT with State Equation took 7780 ms to find 0 implicit places.
[2023-03-12 14:43:20] [INFO ] Invariant cache hit.
[2023-03-12 14:43:21] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1724/1743 places, 1674/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9349 ms. Remains : 1724/1743 places, 1674/1694 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s1188 0)], 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 526 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-05 finished in 9581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1734 transition count 1685
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1734 transition count 1685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1734 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 1728 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1726 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1724 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1724 transition count 1674
Applied a total of 39 rules in 497 ms. Remains 1724 /1743 variables (removed 19) and now considering 1674/1694 (removed 20) transitions.
[2023-03-12 14:43:21] [INFO ] Invariant cache hit.
[2023-03-12 14:43:25] [INFO ] Implicit Places using invariants in 3299 ms returned []
[2023-03-12 14:43:25] [INFO ] Invariant cache hit.
[2023-03-12 14:43:28] [INFO ] Implicit Places using invariants and state equation in 2773 ms returned []
Implicit Place search using SMT with State Equation took 6090 ms to find 0 implicit places.
[2023-03-12 14:43:28] [INFO ] Invariant cache hit.
[2023-03-12 14:43:29] [INFO ] Dead Transitions using invariants and state equation in 1573 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1724/1743 places, 1674/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8161 ms. Remains : 1724/1743 places, 1674/1694 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s1352 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 347 reset in 267 ms.
Product exploration explored 100000 steps with 348 reset in 361 ms.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Detected a total of 414/1724 stabilizing places and 414/1674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 226 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=113 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 349 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 14:43:31] [INFO ] Invariant cache hit.
[2023-03-12 14:43:33] [INFO ] [Real]Absence check using 147 positive place invariants in 615 ms returned sat
[2023-03-12 14:43:33] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 23 ms returned sat
[2023-03-12 14:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:43:46] [INFO ] [Real]Absence check using state equation in 13203 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Applied a total of 0 rules in 105 ms. Remains 1724 /1724 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-12 14:43:46] [INFO ] Invariant cache hit.
[2023-03-12 14:43:52] [INFO ] Implicit Places using invariants in 5699 ms returned []
[2023-03-12 14:43:52] [INFO ] Invariant cache hit.
[2023-03-12 14:43:57] [INFO ] Implicit Places using invariants and state equation in 4940 ms returned []
Implicit Place search using SMT with State Equation took 10641 ms to find 0 implicit places.
[2023-03-12 14:43:57] [INFO ] Invariant cache hit.
[2023-03-12 14:43:59] [INFO ] Dead Transitions using invariants and state equation in 1457 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12217 ms. Remains : 1724/1724 places, 1674/1674 transitions.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Detected a total of 414/1724 stabilizing places and 414/1674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 269 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=134 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 14:44:00] [INFO ] Invariant cache hit.
[2023-03-12 14:44:01] [INFO ] [Real]Absence check using 147 positive place invariants in 192 ms returned sat
[2023-03-12 14:44:01] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 13 ms returned sat
[2023-03-12 14:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:44:15] [INFO ] [Real]Absence check using state equation in 13936 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 344 reset in 360 ms.
Product exploration explored 100000 steps with 344 reset in 305 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Performed 554 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 554 rules applied. Total rules applied 554 place count 1724 transition count 1674
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 48 rules applied. Total rules applied 602 place count 1724 transition count 1650
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 222 Pre rules applied. Total rules applied 602 place count 1724 transition count 1650
Deduced a syphon composed of 800 places in 12 ms
Iterating global reduction 2 with 222 rules applied. Total rules applied 824 place count 1724 transition count 1650
Discarding 479 places :
Symmetric choice reduction at 2 with 479 rule applications. Total rules 1303 place count 1245 transition count 1171
Deduced a syphon composed of 321 places in 5 ms
Iterating global reduction 2 with 479 rules applied. Total rules applied 1782 place count 1245 transition count 1171
Performed 411 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 732 places in 0 ms
Iterating global reduction 2 with 411 rules applied. Total rules applied 2193 place count 1245 transition count 1123
Renaming transitions due to excessive name length > 1024 char.
Discarding 265 places :
Symmetric choice reduction at 2 with 265 rule applications. Total rules 2458 place count 980 transition count 858
Deduced a syphon composed of 467 places in 0 ms
Iterating global reduction 2 with 265 rules applied. Total rules applied 2723 place count 980 transition count 858
Deduced a syphon composed of 467 places in 1 ms
Applied a total of 2723 rules in 909 ms. Remains 980 /1724 variables (removed 744) and now considering 858/1674 (removed 816) transitions.
[2023-03-12 14:44:17] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 858 rows 980 cols
[2023-03-12 14:44:17] [INFO ] Computed 148 place invariants in 40 ms
[2023-03-12 14:44:18] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 980/1724 places, 858/1674 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1692 ms. Remains : 980/1724 places, 858/1674 transitions.
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Applied a total of 0 rules in 110 ms. Remains 1724 /1724 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2023-03-12 14:44:18] [INFO ] Computed 148 place invariants in 8 ms
[2023-03-12 14:44:19] [INFO ] Implicit Places using invariants in 654 ms returned []
[2023-03-12 14:44:19] [INFO ] Invariant cache hit.
[2023-03-12 14:44:22] [INFO ] Implicit Places using invariants and state equation in 3383 ms returned []
Implicit Place search using SMT with State Equation took 4065 ms to find 0 implicit places.
[2023-03-12 14:44:22] [INFO ] Invariant cache hit.
[2023-03-12 14:44:25] [INFO ] Dead Transitions using invariants and state equation in 3000 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7181 ms. Remains : 1724/1724 places, 1674/1674 transitions.
Treatment of property AutoFlight-PT-24b-LTLFireability-06 finished in 64048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)&&F(p2)))))'
Support contains 4 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1735 transition count 1686
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 1735 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 1730 transition count 1680
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 1730 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1729 transition count 1679
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1729 transition count 1679
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1728 transition count 1678
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1728 transition count 1678
Applied a total of 31 rules in 578 ms. Remains 1728 /1743 variables (removed 15) and now considering 1678/1694 (removed 16) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2023-03-12 14:44:26] [INFO ] Computed 148 place invariants in 7 ms
[2023-03-12 14:44:27] [INFO ] Implicit Places using invariants in 1784 ms returned []
[2023-03-12 14:44:27] [INFO ] Invariant cache hit.
[2023-03-12 14:44:31] [INFO ] Implicit Places using invariants and state equation in 3880 ms returned []
Implicit Place search using SMT with State Equation took 5671 ms to find 0 implicit places.
[2023-03-12 14:44:31] [INFO ] Invariant cache hit.
[2023-03-12 14:44:33] [INFO ] Dead Transitions using invariants and state equation in 1390 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1728/1743 places, 1678/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7641 ms. Remains : 1728/1743 places, 1678/1694 transitions.
Stuttering acceptance computed with spot in 621 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=6 dest: 2}, { cond=(NOT p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(EQ s206 0), p2:(EQ s48 1), p0:(OR (EQ s703 0) (EQ s1364 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 93 reset in 369 ms.
Product exploration explored 100000 steps with 93 reset in 430 ms.
Computed a total of 418 stabilizing places and 418 stable transitions
Computed a total of 418 stabilizing places and 418 stable transitions
Detected a total of 418/1728 stabilizing places and 418/1678 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 640 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 501 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:44:35] [INFO ] Invariant cache hit.
[2023-03-12 14:44:36] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:44:36] [INFO ] [Nat]Absence check using 147 positive place invariants in 88 ms returned sat
[2023-03-12 14:44:36] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 16 ms returned sat
[2023-03-12 14:44:39] [INFO ] After 2750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:44:40] [INFO ] Deduced a trap composed of 37 places in 486 ms of which 1 ms to minimize.
[2023-03-12 14:44:42] [INFO ] Deduced a trap composed of 245 places in 2082 ms of which 1 ms to minimize.
[2023-03-12 14:44:42] [INFO ] Deduced a trap composed of 281 places in 469 ms of which 1 ms to minimize.
[2023-03-12 14:44:43] [INFO ] Deduced a trap composed of 214 places in 838 ms of which 1 ms to minimize.
[2023-03-12 14:44:44] [INFO ] Deduced a trap composed of 214 places in 470 ms of which 1 ms to minimize.
[2023-03-12 14:44:45] [INFO ] Deduced a trap composed of 214 places in 708 ms of which 16 ms to minimize.
[2023-03-12 14:44:46] [INFO ] Deduced a trap composed of 214 places in 1682 ms of which 24 ms to minimize.
[2023-03-12 14:44:47] [INFO ] Deduced a trap composed of 216 places in 471 ms of which 3 ms to minimize.
[2023-03-12 14:44:48] [INFO ] Deduced a trap composed of 214 places in 1017 ms of which 1 ms to minimize.
[2023-03-12 14:44:52] [INFO ] Deduced a trap composed of 251 places in 4210 ms of which 15 ms to minimize.
[2023-03-12 14:44:54] [INFO ] Deduced a trap composed of 216 places in 1312 ms of which 27 ms to minimize.
[2023-03-12 14:44:55] [INFO ] Deduced a trap composed of 255 places in 1394 ms of which 3 ms to minimize.
[2023-03-12 14:44:57] [INFO ] Deduced a trap composed of 216 places in 1470 ms of which 2 ms to minimize.
[2023-03-12 14:44:57] [INFO ] Deduced a trap composed of 243 places in 476 ms of which 1 ms to minimize.
[2023-03-12 14:44:58] [INFO ] Deduced a trap composed of 291 places in 501 ms of which 1 ms to minimize.
[2023-03-12 14:44:58] [INFO ] Deduced a trap composed of 214 places in 459 ms of which 1 ms to minimize.
[2023-03-12 14:44:59] [INFO ] Deduced a trap composed of 214 places in 469 ms of which 1 ms to minimize.
[2023-03-12 14:44:59] [INFO ] Deduced a trap composed of 243 places in 636 ms of which 2 ms to minimize.
[2023-03-12 14:45:00] [INFO ] Deduced a trap composed of 285 places in 770 ms of which 3 ms to minimize.
[2023-03-12 14:45:01] [INFO ] Deduced a trap composed of 281 places in 482 ms of which 1 ms to minimize.
[2023-03-12 14:45:01] [INFO ] Deduced a trap composed of 281 places in 534 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:45:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 14:45:01] [INFO ] After 25560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 1728 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Drop transitions removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 1728 transition count 1051
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 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 1 with 699 rules applied. Total rules applied 1326 place count 1101 transition count 979
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1374 place count 1053 transition count 979
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1374 place count 1053 transition count 780
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1772 place count 854 transition count 780
Performed 341 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 2454 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2550 place count 513 transition count 295
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2646 place count 417 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2647 place count 416 transition count 294
Reduce places removed 119 places and 0 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 4 with 325 rules applied. Total rules applied 2972 place count 297 transition count 88
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 5 with 206 rules applied. Total rules applied 3178 place count 91 transition count 88
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 30 Pre rules applied. Total rules applied 3178 place count 91 transition count 58
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 3238 place count 61 transition count 58
Applied a total of 3238 rules in 127 ms. Remains 61 /1728 variables (removed 1667) and now considering 58/1678 (removed 1620) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 61/1728 places, 58/1678 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 7 factoid took 590 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
[2023-03-12 14:45:03] [INFO ] Invariant cache hit.
[2023-03-12 14:45:05] [INFO ] [Real]Absence check using 147 positive place invariants in 150 ms returned sat
[2023-03-12 14:45:05] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-12 14:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:45:18] [INFO ] [Real]Absence check using state equation in 13357 ms returned unknown
Could not prove EG (NOT p2)
Support contains 2 out of 1728 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Applied a total of 0 rules in 101 ms. Remains 1728 /1728 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
[2023-03-12 14:45:18] [INFO ] Invariant cache hit.
[2023-03-12 14:45:20] [INFO ] Implicit Places using invariants in 2137 ms returned []
[2023-03-12 14:45:20] [INFO ] Invariant cache hit.
[2023-03-12 14:45:27] [INFO ] Implicit Places using invariants and state equation in 6658 ms returned []
Implicit Place search using SMT with State Equation took 8821 ms to find 0 implicit places.
[2023-03-12 14:45:27] [INFO ] Invariant cache hit.
[2023-03-12 14:45:29] [INFO ] Dead Transitions using invariants and state equation in 1840 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10776 ms. Remains : 1728/1728 places, 1678/1678 transitions.
Computed a total of 418 stabilizing places and 418 stable transitions
Computed a total of 418 stabilizing places and 418 stable transitions
Detected a total of 418/1728 stabilizing places and 418/1678 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 253 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 437 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:45:30] [INFO ] Invariant cache hit.
[2023-03-12 14:45:30] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:45:31] [INFO ] [Nat]Absence check using 147 positive place invariants in 255 ms returned sat
[2023-03-12 14:45:31] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 30 ms returned sat
[2023-03-12 14:45:33] [INFO ] After 2278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:45:34] [INFO ] Deduced a trap composed of 37 places in 555 ms of which 1 ms to minimize.
[2023-03-12 14:45:35] [INFO ] Deduced a trap composed of 245 places in 1678 ms of which 1 ms to minimize.
[2023-03-12 14:45:38] [INFO ] Deduced a trap composed of 281 places in 2295 ms of which 2 ms to minimize.
[2023-03-12 14:45:39] [INFO ] Deduced a trap composed of 214 places in 1069 ms of which 3 ms to minimize.
[2023-03-12 14:45:40] [INFO ] Deduced a trap composed of 214 places in 582 ms of which 1 ms to minimize.
[2023-03-12 14:45:40] [INFO ] Deduced a trap composed of 214 places in 653 ms of which 2 ms to minimize.
[2023-03-12 14:45:41] [INFO ] Deduced a trap composed of 214 places in 758 ms of which 1 ms to minimize.
[2023-03-12 14:45:42] [INFO ] Deduced a trap composed of 216 places in 835 ms of which 1 ms to minimize.
[2023-03-12 14:45:43] [INFO ] Deduced a trap composed of 214 places in 463 ms of which 1 ms to minimize.
[2023-03-12 14:45:43] [INFO ] Deduced a trap composed of 251 places in 676 ms of which 28 ms to minimize.
[2023-03-12 14:45:44] [INFO ] Deduced a trap composed of 216 places in 1091 ms of which 2 ms to minimize.
[2023-03-12 14:45:46] [INFO ] Deduced a trap composed of 255 places in 1372 ms of which 1 ms to minimize.
[2023-03-12 14:45:47] [INFO ] Deduced a trap composed of 216 places in 1255 ms of which 30 ms to minimize.
[2023-03-12 14:45:48] [INFO ] Deduced a trap composed of 243 places in 676 ms of which 2 ms to minimize.
[2023-03-12 14:45:50] [INFO ] Deduced a trap composed of 291 places in 2400 ms of which 1 ms to minimize.
[2023-03-12 14:45:52] [INFO ] Deduced a trap composed of 214 places in 1329 ms of which 1 ms to minimize.
[2023-03-12 14:45:52] [INFO ] Deduced a trap composed of 214 places in 683 ms of which 1 ms to minimize.
[2023-03-12 14:45:54] [INFO ] Deduced a trap composed of 243 places in 1321 ms of which 1 ms to minimize.
[2023-03-12 14:45:54] [INFO ] Deduced a trap composed of 285 places in 500 ms of which 1 ms to minimize.
[2023-03-12 14:45:55] [INFO ] Deduced a trap composed of 281 places in 787 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:45:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 14:45:55] [INFO ] After 25414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 1728 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Drop transitions removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 1728 transition count 1051
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 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 1 with 699 rules applied. Total rules applied 1326 place count 1101 transition count 979
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1374 place count 1053 transition count 979
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1374 place count 1053 transition count 780
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1772 place count 854 transition count 780
Performed 341 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 2454 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2550 place count 513 transition count 295
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2646 place count 417 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2647 place count 416 transition count 294
Reduce places removed 119 places and 0 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 4 with 325 rules applied. Total rules applied 2972 place count 297 transition count 88
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 5 with 206 rules applied. Total rules applied 3178 place count 91 transition count 88
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 30 Pre rules applied. Total rules applied 3178 place count 91 transition count 58
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 3238 place count 61 transition count 58
Applied a total of 3238 rules in 147 ms. Remains 61 /1728 variables (removed 1667) and now considering 58/1678 (removed 1620) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 61/1728 places, 58/1678 transitions.
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p1 (NOT p2)), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 3 factoid took 407 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
[2023-03-12 14:45:57] [INFO ] Invariant cache hit.
[2023-03-12 14:45:58] [INFO ] [Real]Absence check using 147 positive place invariants in 113 ms returned sat
[2023-03-12 14:45:58] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 17 ms returned sat
[2023-03-12 14:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:09] [INFO ] [Real]Absence check using state equation in 11569 ms returned sat
[2023-03-12 14:46:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:46:11] [INFO ] [Nat]Absence check using 147 positive place invariants in 78 ms returned sat
[2023-03-12 14:46:11] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-12 14:46:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:13] [INFO ] [Nat]Absence check using state equation in 1549 ms returned sat
[2023-03-12 14:46:13] [INFO ] Deduced a trap composed of 131 places in 730 ms of which 4 ms to minimize.
[2023-03-12 14:46:15] [INFO ] Deduced a trap composed of 224 places in 1149 ms of which 1 ms to minimize.
[2023-03-12 14:46:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2106 ms
[2023-03-12 14:46:15] [INFO ] Computed and/alt/rep : 1675/2331/1675 causal constraints (skipped 2 transitions) in 174 ms.
[2023-03-12 14:46:27] [INFO ] Deduced a trap composed of 8 places in 2462 ms of which 3 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-12 14:46:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 374 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Product exploration explored 100000 steps with 94 reset in 380 ms.
Product exploration explored 100000 steps with 93 reset in 377 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Support contains 2 out of 1728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Performed 556 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 1728 transition count 1678
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 48 rules applied. Total rules applied 604 place count 1728 transition count 1654
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 221 Pre rules applied. Total rules applied 604 place count 1728 transition count 1654
Deduced a syphon composed of 801 places in 5 ms
Iterating global reduction 2 with 221 rules applied. Total rules applied 825 place count 1728 transition count 1654
Discarding 480 places :
Symmetric choice reduction at 2 with 480 rule applications. Total rules 1305 place count 1248 transition count 1174
Deduced a syphon composed of 321 places in 4 ms
Iterating global reduction 2 with 480 rules applied. Total rules applied 1785 place count 1248 transition count 1174
Performed 412 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 733 places in 0 ms
Iterating global reduction 2 with 412 rules applied. Total rules applied 2197 place count 1248 transition count 1126
Renaming transitions due to excessive name length > 1024 char.
Discarding 266 places :
Symmetric choice reduction at 2 with 266 rule applications. Total rules 2463 place count 982 transition count 860
Deduced a syphon composed of 467 places in 1 ms
Iterating global reduction 2 with 266 rules applied. Total rules applied 2729 place count 982 transition count 860
Deduced a syphon composed of 467 places in 1 ms
Applied a total of 2729 rules in 747 ms. Remains 982 /1728 variables (removed 746) and now considering 860/1678 (removed 818) transitions.
[2023-03-12 14:46:29] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 860 rows 982 cols
[2023-03-12 14:46:29] [INFO ] Computed 148 place invariants in 16 ms
[2023-03-12 14:46:31] [INFO ] Dead Transitions using invariants and state equation in 1971 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 982/1728 places, 860/1678 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2799 ms. Remains : 982/1728 places, 860/1678 transitions.
Support contains 2 out of 1728 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Applied a total of 0 rules in 101 ms. Remains 1728 /1728 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2023-03-12 14:46:31] [INFO ] Computed 148 place invariants in 6 ms
[2023-03-12 14:46:32] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-03-12 14:46:32] [INFO ] Invariant cache hit.
[2023-03-12 14:46:36] [INFO ] Implicit Places using invariants and state equation in 3665 ms returned []
Implicit Place search using SMT with State Equation took 4397 ms to find 0 implicit places.
[2023-03-12 14:46:36] [INFO ] Invariant cache hit.
[2023-03-12 14:46:38] [INFO ] Dead Transitions using invariants and state equation in 2594 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7121 ms. Remains : 1728/1728 places, 1678/1678 transitions.
Treatment of property AutoFlight-PT-24b-LTLFireability-07 finished in 133508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 3 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1734 transition count 1685
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1734 transition count 1685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1734 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 1728 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1726 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1724 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1724 transition count 1674
Applied a total of 39 rules in 501 ms. Remains 1724 /1743 variables (removed 19) and now considering 1674/1694 (removed 20) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2023-03-12 14:46:39] [INFO ] Computed 148 place invariants in 15 ms
[2023-03-12 14:46:40] [INFO ] Implicit Places using invariants in 1125 ms returned []
[2023-03-12 14:46:40] [INFO ] Invariant cache hit.
[2023-03-12 14:46:43] [INFO ] Implicit Places using invariants and state equation in 2635 ms returned []
Implicit Place search using SMT with State Equation took 3770 ms to find 0 implicit places.
[2023-03-12 14:46:43] [INFO ] Invariant cache hit.
[2023-03-12 14:46:44] [INFO ] Dead Transitions using invariants and state equation in 1105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1724/1743 places, 1674/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5403 ms. Remains : 1724/1743 places, 1674/1694 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s850 0), p0:(AND (EQ s493 1) (EQ s1129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-08 finished in 5655 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&&G(F(p2))))))'
Support contains 4 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1735 transition count 1686
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 1735 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 1730 transition count 1680
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1728 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1726 transition count 1676
Applied a total of 35 rules in 512 ms. Remains 1726 /1743 variables (removed 17) and now considering 1676/1694 (removed 18) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2023-03-12 14:46:45] [INFO ] Computed 148 place invariants in 7 ms
[2023-03-12 14:46:45] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-12 14:46:45] [INFO ] Invariant cache hit.
[2023-03-12 14:46:48] [INFO ] Implicit Places using invariants and state equation in 2580 ms returned []
Implicit Place search using SMT with State Equation took 3120 ms to find 0 implicit places.
[2023-03-12 14:46:48] [INFO ] Invariant cache hit.
[2023-03-12 14:46:50] [INFO ] Dead Transitions using invariants and state equation in 2178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1726/1743 places, 1676/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5811 ms. Remains : 1726/1743 places, 1676/1694 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s284 1), p1:(EQ s1685 1), p2:(OR (EQ s224 0) (EQ s1294 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-09 finished in 6208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||F((X(p2)||p2))))'
Support contains 4 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1736 transition count 1687
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1736 transition count 1687
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 1731 transition count 1682
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 1731 transition count 1682
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1730 transition count 1681
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1730 transition count 1681
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1729 transition count 1680
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1729 transition count 1680
Applied a total of 28 rules in 474 ms. Remains 1729 /1743 variables (removed 14) and now considering 1680/1694 (removed 14) transitions.
// Phase 1: matrix 1680 rows 1729 cols
[2023-03-12 14:46:51] [INFO ] Computed 148 place invariants in 5 ms
[2023-03-12 14:46:52] [INFO ] Implicit Places using invariants in 1307 ms returned []
[2023-03-12 14:46:52] [INFO ] Invariant cache hit.
[2023-03-12 14:47:02] [INFO ] Implicit Places using invariants and state equation in 9575 ms returned []
Implicit Place search using SMT with State Equation took 10898 ms to find 0 implicit places.
[2023-03-12 14:47:02] [INFO ] Invariant cache hit.
[2023-03-12 14:47:04] [INFO ] Dead Transitions using invariants and state equation in 1687 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1729/1743 places, 1680/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13061 ms. Remains : 1729/1743 places, 1680/1694 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s904 1) (EQ s1620 1)), p1:(EQ s161 1), p0:(EQ s156 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]]
Stuttering criterion allowed to conclude after 1056 steps with 0 reset in 7 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-10 finished in 13387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 1742 transition count 1064
Reduce places removed 629 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 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 1 with 699 rules applied. Total rules applied 1328 place count 1113 transition count 994
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 47 rules applied. Total rules applied 1375 place count 1067 transition count 993
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1378 place count 1066 transition count 991
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1379 place count 1065 transition count 991
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 199 Pre rules applied. Total rules applied 1379 place count 1065 transition count 792
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 5 with 398 rules applied. Total rules applied 1777 place count 866 transition count 792
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1785 place count 858 transition count 784
Iterating global reduction 5 with 8 rules applied. Total rules applied 1793 place count 858 transition count 784
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1793 place count 858 transition count 779
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1803 place count 853 transition count 779
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 5 with 680 rules applied. Total rules applied 2483 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2484 place count 512 transition count 390
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 5 with 70 rules applied. Total rules applied 2554 place count 465 transition count 367
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 2577 place count 442 transition count 367
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 24 Pre rules applied. Total rules applied 2577 place count 442 transition count 343
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 2625 place count 418 transition count 343
Applied a total of 2625 rules in 216 ms. Remains 418 /1743 variables (removed 1325) and now considering 343/1694 (removed 1351) transitions.
// Phase 1: matrix 343 rows 418 cols
[2023-03-12 14:47:04] [INFO ] Computed 101 place invariants in 1 ms
[2023-03-12 14:47:07] [INFO ] Implicit Places using invariants in 2575 ms returned [171, 245, 319, 324, 328, 332, 336, 340, 344, 348, 352, 356, 360, 364, 368, 372, 376, 380, 384, 388, 392, 396, 400, 404, 408, 412, 417]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 2576 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 391/1743 places, 343/1694 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 366 transition count 318
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 366 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 365 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 365 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 364 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 364 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 363 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 363 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 362 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 362 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 361 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 361 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 360 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 360 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 359 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 359 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 358 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 358 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 357 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 357 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 356 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 356 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 355 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 355 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 354 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 354 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 353 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 353 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 352 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 352 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 351 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 351 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 350 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 350 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 349 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 349 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 348 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 348 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 347 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 347 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 346 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 346 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 345 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 345 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 344 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 344 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 343 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 343 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 342 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 342 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 341 transition count 293
Applied a total of 100 rules in 149 ms. Remains 341 /391 variables (removed 50) and now considering 293/343 (removed 50) transitions.
// Phase 1: matrix 293 rows 341 cols
[2023-03-12 14:47:07] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-12 14:47:07] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-12 14:47:07] [INFO ] Invariant cache hit.
[2023-03-12 14:47:08] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 341/1743 places, 293/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3870 ms. Remains : 341/1743 places, 293/1694 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s170 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-11 finished in 3971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((X(p1)||G(p2))))))'
Support contains 3 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 1742 transition count 1063
Reduce places removed 630 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 1 with 703 rules applied. Total rules applied 1333 place count 1112 transition count 990
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1381 place count 1064 transition count 990
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1381 place count 1064 transition count 791
Deduced a syphon composed of 199 places in 9 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1779 place count 865 transition count 791
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1785 place count 859 transition count 785
Iterating global reduction 3 with 6 rules applied. Total rules applied 1791 place count 859 transition count 785
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1791 place count 859 transition count 780
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1801 place count 854 transition count 780
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2477 place count 516 transition count 394
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 2478 place count 515 transition count 393
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2550 place count 467 transition count 369
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2574 place count 443 transition count 369
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2574 place count 443 transition count 345
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2622 place count 419 transition count 345
Applied a total of 2622 rules in 241 ms. Remains 419 /1743 variables (removed 1324) and now considering 345/1694 (removed 1349) transitions.
// Phase 1: matrix 345 rows 419 cols
[2023-03-12 14:47:08] [INFO ] Computed 100 place invariants in 1 ms
[2023-03-12 14:47:08] [INFO ] Implicit Places using invariants in 335 ms returned [173, 247, 321, 325, 329, 333, 337, 341, 345, 349, 353, 357, 361, 365, 369, 373, 377, 381, 385, 389, 393, 397, 401, 405, 409, 413, 418]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 350 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/1743 places, 345/1694 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 367 transition count 320
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 366 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 365 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 365 transition count 318
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 56 place count 364 transition count 317
Applied a total of 56 rules in 25 ms. Remains 364 /392 variables (removed 28) and now considering 317/345 (removed 28) transitions.
// Phase 1: matrix 317 rows 364 cols
[2023-03-12 14:47:08] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-12 14:47:09] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-12 14:47:09] [INFO ] Invariant cache hit.
[2023-03-12 14:47:09] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-12 14:47:13] [INFO ] Implicit Places using invariants and state equation in 4254 ms returned []
Implicit Place search using SMT with State Equation took 4447 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 364/1743 places, 317/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5063 ms. Remains : 364/1743 places, 317/1694 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1 0), p2:(EQ s22 1), p1:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-12 finished in 5309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&((!p0&&G(p1)) U p2)))))'
Support contains 3 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1735 transition count 1686
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 1735 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 1730 transition count 1680
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1728 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1726 transition count 1676
Applied a total of 35 rules in 574 ms. Remains 1726 /1743 variables (removed 17) and now considering 1676/1694 (removed 18) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2023-03-12 14:47:14] [INFO ] Computed 148 place invariants in 6 ms
[2023-03-12 14:47:15] [INFO ] Implicit Places using invariants in 962 ms returned []
[2023-03-12 14:47:15] [INFO ] Invariant cache hit.
[2023-03-12 14:47:23] [INFO ] Implicit Places using invariants and state equation in 8720 ms returned []
Implicit Place search using SMT with State Equation took 9720 ms to find 0 implicit places.
[2023-03-12 14:47:23] [INFO ] Invariant cache hit.
[2023-03-12 14:47:25] [INFO ] Dead Transitions using invariants and state equation in 1664 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1726/1743 places, 1676/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11988 ms. Remains : 1726/1743 places, 1676/1694 transitions.
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s1701 1), p2:(EQ s478 1), p1:(EQ s606 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-14 finished in 12416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : AutoFlight-PT-24b-LTLFireability-06
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 1742 transition count 1063
Reduce places removed 630 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 1 with 703 rules applied. Total rules applied 1333 place count 1112 transition count 990
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1382 place count 1064 transition count 989
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1383 place count 1063 transition count 989
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1383 place count 1063 transition count 790
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1781 place count 864 transition count 790
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1789 place count 856 transition count 782
Iterating global reduction 4 with 8 rules applied. Total rules applied 1797 place count 856 transition count 782
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1797 place count 856 transition count 777
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1807 place count 851 transition count 777
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 676 rules applied. Total rules applied 2483 place count 513 transition count 391
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 2484 place count 512 transition count 390
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 72 rules applied. Total rules applied 2556 place count 464 transition count 366
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2580 place count 440 transition count 366
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2580 place count 440 transition count 342
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2628 place count 416 transition count 342
Applied a total of 2628 rules in 269 ms. Remains 416 /1743 variables (removed 1327) and now considering 342/1694 (removed 1352) transitions.
// Phase 1: matrix 342 rows 416 cols
[2023-03-12 14:47:26] [INFO ] Computed 100 place invariants in 1 ms
[2023-03-12 14:47:26] [INFO ] Implicit Places using invariants in 275 ms returned [326, 330, 334, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 402, 406, 410, 415]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 278 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 393/1743 places, 342/1694 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 372 transition count 321
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 372 transition count 321
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 367 transition count 316
Applied a total of 52 rules in 18 ms. Remains 367 /393 variables (removed 26) and now considering 316/342 (removed 26) transitions.
// Phase 1: matrix 316 rows 367 cols
[2023-03-12 14:47:26] [INFO ] Computed 77 place invariants in 1 ms
[2023-03-12 14:47:27] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-12 14:47:27] [INFO ] Invariant cache hit.
[2023-03-12 14:47:27] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 367/1743 places, 316/1694 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1391 ms. Remains : 367/1743 places, 316/1694 transitions.
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s318 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2288 reset in 508 ms.
Stack based approach found an accepted trace after 92964 steps with 2152 reset with depth 11 and stack size 11 in 523 ms.
Treatment of property AutoFlight-PT-24b-LTLFireability-06 finished in 2670 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)&&F(p2)))))'
[2023-03-12 14:47:28] [INFO ] Flatten gal took : 52 ms
[2023-03-12 14:47:28] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 14:47:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1743 places, 1694 transitions and 4118 arcs took 8 ms.
Total runtime 330094 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1678/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1678/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1678/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-24b-LTLFireability-00
Could not compute solution for formula : AutoFlight-PT-24b-LTLFireability-06
Could not compute solution for formula : AutoFlight-PT-24b-LTLFireability-07

BK_STOP 1678632452490

--------------------
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
mcc2023
ltl formula name AutoFlight-PT-24b-LTLFireability-00
ltl formula formula --ltl=/tmp/1678/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1743 places, 1694 transitions and 4118 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1678/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1678/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1678/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.460 real 0.130 user 0.260 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1678/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name AutoFlight-PT-24b-LTLFireability-06
ltl formula formula --ltl=/tmp/1678/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1743 places, 1694 transitions and 4118 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.540 real 0.180 user 0.160 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1678/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1678/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1678/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1678/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55863828d3f4]
1: pnml2lts-mc(+0xa2496) [0x55863828d496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fa38a9e2140]
3: pnml2lts-mc(+0x405be5) [0x5586385f0be5]
4: pnml2lts-mc(+0x16b3f9) [0x5586383563f9]
5: pnml2lts-mc(+0x164ac4) [0x55863834fac4]
6: pnml2lts-mc(+0x272e0a) [0x55863845de0a]
7: pnml2lts-mc(+0xb61f0) [0x5586382a11f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fa38a8354d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fa38a83567a]
10: pnml2lts-mc(+0xa1581) [0x55863828c581]
11: pnml2lts-mc(+0xa1910) [0x55863828c910]
12: pnml2lts-mc(+0xa32a2) [0x55863828e2a2]
13: pnml2lts-mc(+0xa50f4) [0x5586382900f4]
14: pnml2lts-mc(+0x3f34b3) [0x5586385de4b3]
15: pnml2lts-mc(+0x7c63d) [0x55863826763d]
16: pnml2lts-mc(+0x67d86) [0x558638252d86]
17: pnml2lts-mc(+0x60a8a) [0x55863824ba8a]
18: pnml2lts-mc(+0x5eb15) [0x558638249b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fa38a81dd0a]
20: pnml2lts-mc(+0x6075e) [0x55863824b75e]
ltl formula name AutoFlight-PT-24b-LTLFireability-07
ltl formula formula --ltl=/tmp/1678/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1743 places, 1694 transitions and 4118 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.120 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1678/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1678/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1678/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1678/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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-24b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutoFlight-PT-24b, 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 r009-oct2-167813598000492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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