Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716296575902

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 13:02:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 13:02:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:02:59] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2024-05-21 13:02:59] [INFO ] Transformed 3950 places.
[2024-05-21 13:02:59] [INFO ] Transformed 3936 transitions.
[2024-05-21 13:02:59] [INFO ] Found NUPN structural information;
[2024-05-21 13:02:59] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 595 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-48b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 3950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Discarding 503 places :
Symmetric choice reduction at 0 with 503 rule applications. Total rules 503 place count 3447 transition count 3433
Iterating global reduction 0 with 503 rules applied. Total rules applied 1006 place count 3447 transition count 3433
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 1078 place count 3447 transition count 3361
Discarding 235 places :
Symmetric choice reduction at 1 with 235 rule applications. Total rules 1313 place count 3212 transition count 3126
Iterating global reduction 1 with 235 rules applied. Total rules applied 1548 place count 3212 transition count 3126
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 1584 place count 3176 transition count 3090
Iterating global reduction 1 with 36 rules applied. Total rules applied 1620 place count 3176 transition count 3090
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 1656 place count 3140 transition count 3054
Iterating global reduction 1 with 36 rules applied. Total rules applied 1692 place count 3140 transition count 3054
Applied a total of 1692 rules in 2642 ms. Remains 3140 /3950 variables (removed 810) and now considering 3054/3936 (removed 882) transitions.
// Phase 1: matrix 3054 rows 3140 cols
[2024-05-21 13:03:02] [INFO ] Computed 258 invariants in 101 ms
[2024-05-21 13:03:04] [INFO ] Implicit Places using invariants in 1873 ms returned []
[2024-05-21 13:03:04] [INFO ] Invariant cache hit.
[2024-05-21 13:03:05] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 3503 ms to find 0 implicit places.
[2024-05-21 13:03:05] [INFO ] Invariant cache hit.
[2024-05-21 13:03:09] [INFO ] Dead Transitions using invariants and state equation in 3644 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3140/3950 places, 3054/3936 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9795 ms. Remains : 3140/3950 places, 3054/3936 transitions.
Support contains 23 out of 3140 places after structural reductions.
[2024-05-21 13:03:10] [INFO ] Flatten gal took : 350 ms
[2024-05-21 13:03:10] [INFO ] Flatten gal took : 240 ms
[2024-05-21 13:03:10] [INFO ] Input system was already deterministic with 3054 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 13:03:11] [INFO ] Invariant cache hit.
[2024-05-21 13:03:12] [INFO ] [Real]Absence check using 257 positive place invariants in 265 ms returned sat
[2024-05-21 13:03:12] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 13 ms returned sat
[2024-05-21 13:03:12] [INFO ] After 1176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 13:03:13] [INFO ] [Nat]Absence check using 257 positive place invariants in 305 ms returned sat
[2024-05-21 13:03:13] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 14 ms returned sat
[2024-05-21 13:03:16] [INFO ] After 2602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 13:03:18] [INFO ] Deduced a trap composed of 21 places in 2063 ms of which 9 ms to minimize.
[2024-05-21 13:03:20] [INFO ] Deduced a trap composed of 63 places in 2076 ms of which 3 ms to minimize.
[2024-05-21 13:03:23] [INFO ] Deduced a trap composed of 69 places in 1990 ms of which 5 ms to minimize.
[2024-05-21 13:03:25] [INFO ] Deduced a trap composed of 153 places in 2124 ms of which 4 ms to minimize.
[2024-05-21 13:03:27] [INFO ] Deduced a trap composed of 71 places in 1936 ms of which 3 ms to minimize.
[2024-05-21 13:03:29] [INFO ] Deduced a trap composed of 157 places in 2022 ms of which 3 ms to minimize.
[2024-05-21 13:03:31] [INFO ] Deduced a trap composed of 155 places in 1879 ms of which 3 ms to minimize.
[2024-05-21 13:03:33] [INFO ] Deduced a trap composed of 200 places in 1893 ms of which 2 ms to minimize.
[2024-05-21 13:03:35] [INFO ] Deduced a trap composed of 209 places in 1966 ms of which 2 ms to minimize.
[2024-05-21 13:03:37] [INFO ] Deduced a trap composed of 210 places in 1835 ms of which 2 ms to minimize.
[2024-05-21 13:03:40] [INFO ] Deduced a trap composed of 10 places in 3313 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 13:03:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-21 13:03:40] [INFO ] After 28356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 172 ms.
Support contains 6 out of 3140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3140/3140 places, 3054/3054 transitions.
Drop transitions removed 1272 transitions
Trivial Post-agglo rules discarded 1272 transitions
Performed 1272 trivial Post agglomeration. Transition count delta: 1272
Iterating post reduction 0 with 1272 rules applied. Total rules applied 1272 place count 3140 transition count 1782
Reduce places removed 1272 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1416 rules applied. Total rules applied 2688 place count 1868 transition count 1638
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2785 place count 1772 transition count 1637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2786 place count 1771 transition count 1637
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 352 Pre rules applied. Total rules applied 2786 place count 1771 transition count 1285
Deduced a syphon composed of 352 places in 12 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 4 with 704 rules applied. Total rules applied 3490 place count 1419 transition count 1285
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 3494 place count 1415 transition count 1281
Iterating global reduction 4 with 4 rules applied. Total rules applied 3498 place count 1415 transition count 1281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3498 place count 1415 transition count 1280
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3500 place count 1414 transition count 1280
Performed 566 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 566 places in 2 ms
Reduce places removed 566 places and 0 transitions.
Iterating global reduction 4 with 1132 rules applied. Total rules applied 4632 place count 848 transition count 644
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 4634 place count 848 transition count 642
Free-agglomeration rule applied 144 times.
Iterating global reduction 4 with 144 rules applied. Total rules applied 4778 place count 848 transition count 498
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 4922 place count 704 transition count 498
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4923 place count 703 transition count 497
Reduce places removed 174 places and 0 transitions.
Drop transitions removed 246 transitions
Trivial Post-agglo rules discarded 246 transitions
Performed 246 trivial Post agglomeration. Transition count delta: 246
Iterating post reduction 5 with 420 rules applied. Total rules applied 5343 place count 529 transition count 251
Reduce places removed 246 places and 0 transitions.
Iterating post reduction 6 with 246 rules applied. Total rules applied 5589 place count 283 transition count 251
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 61 Pre rules applied. Total rules applied 5589 place count 283 transition count 190
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 7 with 122 rules applied. Total rules applied 5711 place count 222 transition count 190
Applied a total of 5711 rules in 1003 ms. Remains 222 /3140 variables (removed 2918) and now considering 190/3054 (removed 2864) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1003 ms. Remains : 222/3140 places, 190/3054 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :2
Finished Best-First random walk after 6118 steps, including 1 resets, run visited all 1 properties in 17 ms. (steps per millisecond=359 )
Parikh walk visited 0 properties in 0 ms.
FORMULA AutoFlight-PT-48b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 796 stabilizing places and 796 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3140/3140 places, 3054/3054 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1274 transitions
Trivial Post-agglo rules discarded 1274 transitions
Performed 1274 trivial Post agglomeration. Transition count delta: 1274
Iterating post reduction 0 with 1274 rules applied. Total rules applied 1274 place count 3139 transition count 1779
Reduce places removed 1274 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1420 rules applied. Total rules applied 2694 place count 1865 transition count 1633
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2791 place count 1769 transition count 1632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2792 place count 1768 transition count 1632
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 352 Pre rules applied. Total rules applied 2792 place count 1768 transition count 1280
Deduced a syphon composed of 352 places in 11 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 4 with 704 rules applied. Total rules applied 3496 place count 1416 transition count 1280
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 3502 place count 1410 transition count 1274
Iterating global reduction 4 with 6 rules applied. Total rules applied 3508 place count 1410 transition count 1274
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 3508 place count 1410 transition count 1271
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 3514 place count 1407 transition count 1271
Performed 565 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 565 places in 1 ms
Reduce places removed 565 places and 0 transitions.
Iterating global reduction 4 with 1130 rules applied. Total rules applied 4644 place count 842 transition count 636
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4645 place count 841 transition count 635
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 4 with 142 rules applied. Total rules applied 4787 place count 746 transition count 588
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 4834 place count 699 transition count 588
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 4834 place count 699 transition count 540
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 4930 place count 651 transition count 540
Applied a total of 4930 rules in 535 ms. Remains 651 /3140 variables (removed 2489) and now considering 540/3054 (removed 2514) transitions.
// Phase 1: matrix 540 rows 651 cols
[2024-05-21 13:03:43] [INFO ] Computed 163 invariants in 9 ms
[2024-05-21 13:03:43] [INFO ] Implicit Places using invariants in 650 ms returned [650]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 652 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 650/3140 places, 540/3054 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 650 transition count 529
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 639 transition count 529
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 629 transition count 519
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 629 transition count 519
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 124 place count 588 transition count 478
Applied a total of 124 rules in 75 ms. Remains 588 /650 variables (removed 62) and now considering 478/540 (removed 62) transitions.
// Phase 1: matrix 478 rows 588 cols
[2024-05-21 13:03:43] [INFO ] Computed 152 invariants in 4 ms
[2024-05-21 13:03:44] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-21 13:03:44] [INFO ] Invariant cache hit.
[2024-05-21 13:03:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 13:03:45] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 588/3140 places, 478/3054 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2907 ms. Remains : 588/3140 places, 478/3054 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 179 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-01 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 s583 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 111 steps with 0 reset in 6 ms.
FORMULA AutoFlight-PT-48b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLCardinality-01 finished in 3169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||G(p2))))'
Support contains 4 out of 3140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3140/3140 places, 3054/3054 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1272 transitions
Trivial Post-agglo rules discarded 1272 transitions
Performed 1272 trivial Post agglomeration. Transition count delta: 1272
Iterating post reduction 0 with 1272 rules applied. Total rules applied 1272 place count 3139 transition count 1781
Reduce places removed 1272 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1418 rules applied. Total rules applied 2690 place count 1867 transition count 1635
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2786 place count 1771 transition count 1635
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 352 Pre rules applied. Total rules applied 2786 place count 1771 transition count 1283
Deduced a syphon composed of 352 places in 10 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 704 rules applied. Total rules applied 3490 place count 1419 transition count 1283
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3496 place count 1413 transition count 1277
Iterating global reduction 3 with 6 rules applied. Total rules applied 3502 place count 1413 transition count 1277
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 3502 place count 1413 transition count 1274
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 3508 place count 1410 transition count 1274
Performed 566 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 566 places in 1 ms
Reduce places removed 566 places and 0 transitions.
Iterating global reduction 3 with 1132 rules applied. Total rules applied 4640 place count 844 transition count 638
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4641 place count 843 transition count 637
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 3 with 140 rules applied. Total rules applied 4781 place count 749 transition count 591
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 4827 place count 703 transition count 591
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4827 place count 703 transition count 543
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4923 place count 655 transition count 543
Applied a total of 4923 rules in 577 ms. Remains 655 /3140 variables (removed 2485) and now considering 543/3054 (removed 2511) transitions.
// Phase 1: matrix 543 rows 655 cols
[2024-05-21 13:03:46] [INFO ] Computed 164 invariants in 9 ms
[2024-05-21 13:03:46] [INFO ] Implicit Places using invariants in 535 ms returned [259, 333, 371, 445, 483, 487, 491, 495, 499, 503, 507, 511, 515, 519, 523, 527, 531, 535, 539, 543, 547, 551, 555, 559, 563, 567, 571, 575, 580, 582, 584, 586, 588, 590, 592, 594, 596, 598, 600, 603, 605, 609, 613, 617, 621, 625, 629, 633, 637, 641, 645, 649, 654]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 538 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 602/3140 places, 543/3054 transitions.
Graph (trivial) has 247 edges and 602 vertex of which 12 / 602 are part of one of the 1 SCC in 3 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 551 transition count 482
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 551 transition count 482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 83 place count 549 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 85 place count 549 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 87 place count 547 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 89 place count 547 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 91 place count 545 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 545 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 543 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 543 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 99 place count 541 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 101 place count 541 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 103 place count 539 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 105 place count 539 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 107 place count 537 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 109 place count 537 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 111 place count 535 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 535 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 115 place count 533 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 533 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 119 place count 531 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 121 place count 531 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 123 place count 529 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 125 place count 529 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 127 place count 527 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 129 place count 527 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 526 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 526 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 525 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 525 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 524 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 524 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 523 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 523 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 522 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 522 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 521 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 521 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 520 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 520 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 519 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 519 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 518 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 518 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 517 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 517 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 516 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 516 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 515 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 515 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 155 place count 514 transition count 445
Applied a total of 155 rules in 558 ms. Remains 514 /602 variables (removed 88) and now considering 445/543 (removed 98) transitions.
// Phase 1: matrix 445 rows 514 cols
[2024-05-21 13:03:47] [INFO ] Computed 111 invariants in 3 ms
[2024-05-21 13:03:47] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-21 13:03:47] [INFO ] Invariant cache hit.
[2024-05-21 13:03:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:03:48] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/3140 places, 445/3054 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2920 ms. Remains : 514/3140 places, 445/3054 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s255 0) (EQ s147 1)), p2:(OR (EQ s147 0) (EQ s255 1)), p0:(AND (EQ s117 0) (EQ s290 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-48b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLCardinality-02 finished in 3157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 3140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3140/3140 places, 3054/3054 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3133 transition count 3047
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3133 transition count 3047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 3131 transition count 3045
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 3131 transition count 3045
Applied a total of 18 rules in 1232 ms. Remains 3131 /3140 variables (removed 9) and now considering 3045/3054 (removed 9) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2024-05-21 13:03:50] [INFO ] Computed 258 invariants in 36 ms
[2024-05-21 13:03:51] [INFO ] Implicit Places using invariants in 1293 ms returned []
[2024-05-21 13:03:51] [INFO ] Invariant cache hit.
[2024-05-21 13:03:52] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
[2024-05-21 13:03:52] [INFO ] Invariant cache hit.
[2024-05-21 13:03:55] [INFO ] Dead Transitions using invariants and state equation in 3021 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3140 places, 3045/3054 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6778 ms. Remains : 3131/3140 places, 3045/3054 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1476 0) (EQ s1908 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-48b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLCardinality-03 finished in 6906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 3140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3140/3140 places, 3054/3054 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3133 transition count 3047
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3133 transition count 3047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 3131 transition count 3045
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 3131 transition count 3045
Applied a total of 18 rules in 1148 ms. Remains 3131 /3140 variables (removed 9) and now considering 3045/3054 (removed 9) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2024-05-21 13:03:57] [INFO ] Computed 258 invariants in 28 ms
[2024-05-21 13:03:58] [INFO ] Implicit Places using invariants in 1222 ms returned []
[2024-05-21 13:03:58] [INFO ] Invariant cache hit.
[2024-05-21 13:03:59] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 2432 ms to find 0 implicit places.
[2024-05-21 13:03:59] [INFO ] Invariant cache hit.
[2024-05-21 13:04:02] [INFO ] Dead Transitions using invariants and state equation in 3334 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3140 places, 3045/3054 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6916 ms. Remains : 3131/3140 places, 3045/3054 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s942 0) (EQ s1092 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1151 steps with 0 reset in 15 ms.
FORMULA AutoFlight-PT-48b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLCardinality-06 finished in 7071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3140/3140 places, 3054/3054 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3133 transition count 3047
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3133 transition count 3047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 3131 transition count 3045
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 3131 transition count 3045
Applied a total of 18 rules in 1304 ms. Remains 3131 /3140 variables (removed 9) and now considering 3045/3054 (removed 9) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2024-05-21 13:04:04] [INFO ] Computed 258 invariants in 24 ms
[2024-05-21 13:04:05] [INFO ] Implicit Places using invariants in 1204 ms returned []
[2024-05-21 13:04:05] [INFO ] Invariant cache hit.
[2024-05-21 13:04:06] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 2432 ms to find 0 implicit places.
[2024-05-21 13:04:06] [INFO ] Invariant cache hit.
[2024-05-21 13:04:10] [INFO ] Dead Transitions using invariants and state equation in 3387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3140 places, 3045/3054 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7126 ms. Remains : 3131/3140 places, 3045/3054 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s367 0) (EQ s2519 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3423 ms.
Product exploration explored 100000 steps with 50000 reset in 3259 ms.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Detected a total of 791/3131 stabilizing places and 791/3045 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLCardinality-08 finished in 14068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(p0)&&F(G(p1)))))))'
Support contains 4 out of 3140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3140/3140 places, 3054/3054 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1269 transitions
Trivial Post-agglo rules discarded 1269 transitions
Performed 1269 trivial Post agglomeration. Transition count delta: 1269
Iterating post reduction 0 with 1269 rules applied. Total rules applied 1269 place count 3139 transition count 1784
Reduce places removed 1269 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 1 with 1411 rules applied. Total rules applied 2680 place count 1870 transition count 1642
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 95 rules applied. Total rules applied 2775 place count 1776 transition count 1641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2776 place count 1775 transition count 1641
Performed 353 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 353 Pre rules applied. Total rules applied 2776 place count 1775 transition count 1288
Deduced a syphon composed of 353 places in 10 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 4 with 706 rules applied. Total rules applied 3482 place count 1422 transition count 1288
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 3486 place count 1418 transition count 1284
Iterating global reduction 4 with 4 rules applied. Total rules applied 3490 place count 1418 transition count 1284
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3490 place count 1418 transition count 1282
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3494 place count 1416 transition count 1282
Performed 568 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 568 places in 0 ms
Reduce places removed 568 places and 0 transitions.
Iterating global reduction 4 with 1136 rules applied. Total rules applied 4630 place count 848 transition count 644
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4632 place count 847 transition count 644
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 4633 place count 847 transition count 644
Applied a total of 4633 rules in 563 ms. Remains 847 /3140 variables (removed 2293) and now considering 644/3054 (removed 2410) transitions.
// Phase 1: matrix 644 rows 847 cols
[2024-05-21 13:04:17] [INFO ] Computed 258 invariants in 4 ms
[2024-05-21 13:04:19] [INFO ] Implicit Places using invariants in 2132 ms returned [255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 316, 317, 318, 319, 320, 321, 322, 323, 324, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 347, 348, 349, 350, 351, 352, 353, 354, 355, 429, 467, 541, 579, 585, 591, 597, 603, 609, 615, 621, 627, 633, 639, 645, 651, 657, 663, 669, 675, 681, 687, 693, 699, 705, 711, 717, 723, 727, 731, 735, 739, 743, 747, 751, 755, 765, 769, 773, 779, 785, 791, 797, 803, 809, 815, 821, 827, 833, 839, 846]
Discarding 145 places :
Implicit Place search using SMT only with invariants took 2134 ms to find 145 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/3140 places, 644/3054 transitions.
Graph (trivial) has 339 edges and 702 vertex of which 28 / 702 are part of one of the 1 SCC in 0 ms
Free SCC test removed 27 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 675 transition count 534
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 600 transition count 534
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 151 place count 600 transition count 533
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 599 transition count 533
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 194 place count 558 transition count 492
Iterating global reduction 2 with 41 rules applied. Total rules applied 235 place count 558 transition count 492
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 237 place count 556 transition count 490
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 556 transition count 490
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 241 place count 554 transition count 488
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 554 transition count 488
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 245 place count 552 transition count 486
Iterating global reduction 2 with 2 rules applied. Total rules applied 247 place count 552 transition count 486
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 249 place count 550 transition count 484
Iterating global reduction 2 with 2 rules applied. Total rules applied 251 place count 550 transition count 484
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 253 place count 548 transition count 482
Iterating global reduction 2 with 2 rules applied. Total rules applied 255 place count 548 transition count 482
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 257 place count 546 transition count 480
Iterating global reduction 2 with 2 rules applied. Total rules applied 259 place count 546 transition count 480
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 261 place count 544 transition count 478
Iterating global reduction 2 with 2 rules applied. Total rules applied 263 place count 544 transition count 478
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 265 place count 542 transition count 476
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 542 transition count 476
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 269 place count 540 transition count 474
Iterating global reduction 2 with 2 rules applied. Total rules applied 271 place count 540 transition count 474
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 273 place count 538 transition count 472
Iterating global reduction 2 with 2 rules applied. Total rules applied 275 place count 538 transition count 472
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 277 place count 536 transition count 470
Iterating global reduction 2 with 2 rules applied. Total rules applied 279 place count 536 transition count 470
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 281 place count 534 transition count 468
Iterating global reduction 2 with 2 rules applied. Total rules applied 283 place count 534 transition count 468
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 284 place count 533 transition count 467
Iterating global reduction 2 with 1 rules applied. Total rules applied 285 place count 533 transition count 467
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 286 place count 532 transition count 466
Iterating global reduction 2 with 1 rules applied. Total rules applied 287 place count 532 transition count 466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 288 place count 531 transition count 465
Iterating global reduction 2 with 1 rules applied. Total rules applied 289 place count 531 transition count 465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 290 place count 530 transition count 464
Iterating global reduction 2 with 1 rules applied. Total rules applied 291 place count 530 transition count 464
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 292 place count 529 transition count 463
Iterating global reduction 2 with 1 rules applied. Total rules applied 293 place count 529 transition count 463
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 294 place count 528 transition count 462
Iterating global reduction 2 with 1 rules applied. Total rules applied 295 place count 528 transition count 462
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 296 place count 527 transition count 461
Iterating global reduction 2 with 1 rules applied. Total rules applied 297 place count 527 transition count 461
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 298 place count 526 transition count 460
Iterating global reduction 2 with 1 rules applied. Total rules applied 299 place count 526 transition count 460
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 300 place count 525 transition count 459
Iterating global reduction 2 with 1 rules applied. Total rules applied 301 place count 525 transition count 459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 302 place count 524 transition count 458
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 524 transition count 458
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 304 place count 523 transition count 457
Iterating global reduction 2 with 1 rules applied. Total rules applied 305 place count 523 transition count 457
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 306 place count 522 transition count 456
Iterating global reduction 2 with 1 rules applied. Total rules applied 307 place count 522 transition count 456
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 2 with 2 rules applied. Total rules applied 309 place count 521 transition count 455
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 310 place count 521 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 311 place count 520 transition count 454
Applied a total of 311 rules in 464 ms. Remains 520 /702 variables (removed 182) and now considering 454/644 (removed 190) transitions.
// Phase 1: matrix 454 rows 520 cols
[2024-05-21 13:04:20] [INFO ] Computed 112 invariants in 9 ms
[2024-05-21 13:04:20] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-05-21 13:04:20] [INFO ] Invariant cache hit.
[2024-05-21 13:04:21] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:04:22] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 2281 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 520/3140 places, 454/3054 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5444 ms. Remains : 520/3140 places, 454/3054 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s492 0) (EQ s255 1)), p1:(AND (EQ s261 0) (EQ s227 1))], nbAcceptance=2, 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 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-48b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLCardinality-10 finished in 5576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3140/3140 places, 3054/3054 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1274 transitions
Trivial Post-agglo rules discarded 1274 transitions
Performed 1274 trivial Post agglomeration. Transition count delta: 1274
Iterating post reduction 0 with 1274 rules applied. Total rules applied 1274 place count 3139 transition count 1779
Reduce places removed 1274 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1419 rules applied. Total rules applied 2693 place count 1865 transition count 1634
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2789 place count 1769 transition count 1634
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 352 Pre rules applied. Total rules applied 2789 place count 1769 transition count 1282
Deduced a syphon composed of 352 places in 14 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 704 rules applied. Total rules applied 3493 place count 1417 transition count 1282
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 3498 place count 1412 transition count 1277
Iterating global reduction 3 with 5 rules applied. Total rules applied 3503 place count 1412 transition count 1277
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3503 place count 1412 transition count 1275
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3507 place count 1410 transition count 1275
Performed 566 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 566 places in 1 ms
Reduce places removed 566 places and 0 transitions.
Iterating global reduction 3 with 1132 rules applied. Total rules applied 4639 place count 844 transition count 639
Renaming transitions due to excessive name length > 1024 char.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4640 place count 844 transition count 639
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4641 place count 843 transition count 638
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 3 with 142 rules applied. Total rules applied 4783 place count 748 transition count 591
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 4830 place count 701 transition count 591
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4830 place count 701 transition count 543
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4926 place count 653 transition count 543
Applied a total of 4926 rules in 627 ms. Remains 653 /3140 variables (removed 2487) and now considering 543/3054 (removed 2511) transitions.
// Phase 1: matrix 543 rows 653 cols
[2024-05-21 13:04:23] [INFO ] Computed 163 invariants in 4 ms
[2024-05-21 13:04:23] [INFO ] Implicit Places using invariants in 614 ms returned [258, 332, 370, 444, 482, 486, 490, 494, 498, 502, 506, 510, 514, 518, 522, 526, 530, 534, 538, 542, 546, 550, 554, 558, 562, 566, 570, 574, 578, 580, 582, 584, 586, 588, 590, 592, 594, 596, 598, 601, 603, 607, 611, 615, 619, 623, 627, 631, 635, 639, 643, 647, 652]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 616 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 600/3140 places, 543/3054 transitions.
Graph (trivial) has 248 edges and 600 vertex of which 12 / 600 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 549 transition count 482
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 549 transition count 482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 83 place count 547 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 85 place count 547 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 87 place count 545 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 89 place count 545 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 91 place count 543 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 543 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 541 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 541 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 99 place count 539 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 101 place count 539 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 103 place count 537 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 105 place count 537 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 107 place count 535 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 109 place count 535 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 111 place count 533 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 533 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 115 place count 531 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 531 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 119 place count 529 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 121 place count 529 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 123 place count 527 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 125 place count 527 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 127 place count 525 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 129 place count 525 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 524 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 524 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 523 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 523 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 522 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 522 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 521 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 521 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 520 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 520 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 519 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 519 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 518 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 518 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 517 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 517 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 516 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 516 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 515 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 515 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 514 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 514 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 513 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 513 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 155 place count 512 transition count 445
Applied a total of 155 rules in 455 ms. Remains 512 /600 variables (removed 88) and now considering 445/543 (removed 98) transitions.
// Phase 1: matrix 445 rows 512 cols
[2024-05-21 13:04:24] [INFO ] Computed 110 invariants in 3 ms
[2024-05-21 13:04:24] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-21 13:04:24] [INFO ] Invariant cache hit.
[2024-05-21 13:04:25] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 13:04:26] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/3140 places, 445/3054 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3849 ms. Remains : 512/3140 places, 445/3054 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s165 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 851 reset in 830 ms.
Product exploration explored 100000 steps with 854 reset in 759 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 85 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 434252 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 434252 steps, saw 68392 distinct states, run finished after 3002 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 13:04:31] [INFO ] Invariant cache hit.
[2024-05-21 13:04:31] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 13:04:31] [INFO ] [Nat]Absence check using 110 positive place invariants in 31 ms returned sat
[2024-05-21 13:04:31] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 13:04:31] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 13:04:31] [INFO ] After 28ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 13:04:31] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-21 13:04:32] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 445/445 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 512 transition count 444
Free-agglomeration rule applied 185 times.
Iterating global reduction 1 with 185 rules applied. Total rules applied 186 place count 512 transition count 259
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t380.t629 and 3 places that fell out of Prefix Of Interest.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 190 edges and 242 vertex of which 84 / 242 are part of one of the 1 SCC in 1 ms
Free SCC test removed 83 places
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 1 with 78 rules applied. Total rules applied 264 place count 159 transition count 182
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 2 with 183 rules applied. Total rules applied 447 place count 86 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 447 place count 86 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 455 place count 82 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 456 place count 81 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 457 place count 81 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 458 place count 80 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 459 place count 80 transition count 66
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 460 place count 79 transition count 65
Iterating global reduction 3 with 1 rules applied. Total rules applied 461 place count 79 transition count 65
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 462 place count 78 transition count 64
Iterating global reduction 3 with 1 rules applied. Total rules applied 463 place count 78 transition count 64
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 464 place count 77 transition count 63
Iterating global reduction 3 with 1 rules applied. Total rules applied 465 place count 77 transition count 63
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 466 place count 76 transition count 62
Iterating global reduction 3 with 1 rules applied. Total rules applied 467 place count 76 transition count 62
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 468 place count 75 transition count 61
Iterating global reduction 3 with 1 rules applied. Total rules applied 469 place count 75 transition count 61
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 470 place count 74 transition count 60
Iterating global reduction 3 with 1 rules applied. Total rules applied 471 place count 74 transition count 60
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 474 place count 74 transition count 57
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 479 place count 71 transition count 55
Applied a total of 479 rules in 48 ms. Remains 71 /512 variables (removed 441) and now considering 55/445 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 71/512 places, 55/445 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 445/445 transitions.
Applied a total of 0 rules in 17 ms. Remains 512 /512 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-05-21 13:04:32] [INFO ] Invariant cache hit.
[2024-05-21 13:04:32] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-21 13:04:32] [INFO ] Invariant cache hit.
[2024-05-21 13:04:33] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 13:04:34] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2024-05-21 13:04:34] [INFO ] Redundant transitions in 34 ms returned []
[2024-05-21 13:04:34] [INFO ] Invariant cache hit.
[2024-05-21 13:04:34] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2370 ms. Remains : 512/512 places, 445/445 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 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 102 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 85 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 452120 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 452120 steps, saw 70359 distinct states, run finished after 3005 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 13:04:38] [INFO ] Invariant cache hit.
[2024-05-21 13:04:38] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 13:04:38] [INFO ] [Nat]Absence check using 110 positive place invariants in 29 ms returned sat
[2024-05-21 13:04:38] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 13:04:38] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 13:04:38] [INFO ] After 39ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 13:04:38] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-21 13:04:38] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 59 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 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 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 855 reset in 937 ms.
Product exploration explored 100000 steps with 853 reset in 809 ms.
Built C files in :
/tmp/ltsmin300835309623437942
[2024-05-21 13:04:41] [INFO ] Computing symmetric may disable matrix : 445 transitions.
[2024-05-21 13:04:41] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:04:41] [INFO ] Computing symmetric may enable matrix : 445 transitions.
[2024-05-21 13:04:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:04:41] [INFO ] Computing Do-Not-Accords matrix : 445 transitions.
[2024-05-21 13:04:41] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:04:41] [INFO ] Built C files in 232ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin300835309623437942
Running compilation step : cd /tmp/ltsmin300835309623437942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2484 ms.
Running link step : cd /tmp/ltsmin300835309623437942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin300835309623437942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4149597270472084310.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 445/445 transitions.
Applied a total of 0 rules in 14 ms. Remains 512 /512 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-05-21 13:04:56] [INFO ] Invariant cache hit.
[2024-05-21 13:04:56] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-21 13:04:56] [INFO ] Invariant cache hit.
[2024-05-21 13:04:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 13:04:57] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
[2024-05-21 13:04:57] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-21 13:04:57] [INFO ] Invariant cache hit.
[2024-05-21 13:04:58] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2199 ms. Remains : 512/512 places, 445/445 transitions.
Built C files in :
/tmp/ltsmin17567724502767957937
[2024-05-21 13:04:58] [INFO ] Computing symmetric may disable matrix : 445 transitions.
[2024-05-21 13:04:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:04:58] [INFO ] Computing symmetric may enable matrix : 445 transitions.
[2024-05-21 13:04:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:04:58] [INFO ] Computing Do-Not-Accords matrix : 445 transitions.
[2024-05-21 13:04:58] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:04:58] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17567724502767957937
Running compilation step : cd /tmp/ltsmin17567724502767957937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1534 ms.
Running link step : cd /tmp/ltsmin17567724502767957937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17567724502767957937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4344086757226482769.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 13:05:13] [INFO ] Flatten gal took : 22 ms
[2024-05-21 13:05:13] [INFO ] Flatten gal took : 22 ms
[2024-05-21 13:05:13] [INFO ] Time to serialize gal into /tmp/LTL9747432989299298041.gal : 6 ms
[2024-05-21 13:05:13] [INFO ] Time to serialize properties into /tmp/LTL7323072533040380435.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9747432989299298041.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17854251039213711196.hoa' '-atoms' '/tmp/LTL7323072533040380435.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i13.u71.p1109==0)||(i0.i0.i0.u0.p183==1))"))))
Formula 0 simplified : FG!"((i13.u71.p1109==0)||(i0.i0.i0.u0.p183==1))"
Reverse transition relation is NOT exact ! Due to transitions t27, t371, i0.i0.i0.t372, i13.t1, Intersection with reachable at each step enabled. (destroy...195
Computing Next relation with stutter on 1.97912e+13 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
183 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.94551,77036,1,0,59289,126127,5806,100384,1906,480076,55363
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-48b-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-48b-LTLCardinality-13 finished in 84097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 3140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3140/3140 places, 3054/3054 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3132 transition count 3046
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3132 transition count 3046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 3130 transition count 3044
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 3130 transition count 3044
Applied a total of 20 rules in 1415 ms. Remains 3130 /3140 variables (removed 10) and now considering 3044/3054 (removed 10) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2024-05-21 13:05:48] [INFO ] Computed 258 invariants in 19 ms
[2024-05-21 13:05:49] [INFO ] Implicit Places using invariants in 1546 ms returned []
[2024-05-21 13:05:49] [INFO ] Invariant cache hit.
[2024-05-21 13:05:51] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 3037 ms to find 0 implicit places.
[2024-05-21 13:05:51] [INFO ] Invariant cache hit.
[2024-05-21 13:05:54] [INFO ] Dead Transitions using invariants and state equation in 3522 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3130/3140 places, 3044/3054 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7976 ms. Remains : 3130/3140 places, 3044/3054 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-48b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1376 0) (EQ s2521 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3908 ms.
Product exploration explored 100000 steps with 50000 reset in 3482 ms.
Computed a total of 790 stabilizing places and 790 stable transitions
Computed a total of 790 stabilizing places and 790 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLCardinality-15 finished in 15649 ms.
All properties solved by simple procedures.
Total runtime 183771 ms.

BK_STOP 1716296763395

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AutoFlight-PT-48b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180100122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-48b.tgz
mv AutoFlight-PT-48b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;