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-171620180200132.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-96b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180200132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 22:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 22:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 22:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 22:13 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 1.9M 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-96b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716301613365

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-96b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 14:26:55] [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 14:26:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:26:56] [INFO ] Load time of PNML (sax parser for PT used): 504 ms
[2024-05-21 14:26:56] [INFO ] Transformed 7894 places.
[2024-05-21 14:26:56] [INFO ] Transformed 7868 transitions.
[2024-05-21 14:26:56] [INFO ] Found NUPN structural information;
[2024-05-21 14:26:56] [INFO ] Parsed PT model containing 7894 places and 7868 transitions and 18200 arcs in 968 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-96b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 7894 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7894/7894 places, 7868/7868 transitions.
Discarding 1011 places :
Symmetric choice reduction at 0 with 1011 rule applications. Total rules 1011 place count 6883 transition count 6857
Iterating global reduction 0 with 1011 rules applied. Total rules applied 2022 place count 6883 transition count 6857
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 2166 place count 6883 transition count 6713
Discarding 474 places :
Symmetric choice reduction at 1 with 474 rule applications. Total rules 2640 place count 6409 transition count 6239
Iterating global reduction 1 with 474 rules applied. Total rules applied 3114 place count 6409 transition count 6239
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 3186 place count 6337 transition count 6167
Iterating global reduction 1 with 72 rules applied. Total rules applied 3258 place count 6337 transition count 6167
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 3330 place count 6265 transition count 6095
Iterating global reduction 1 with 72 rules applied. Total rules applied 3402 place count 6265 transition count 6095
Applied a total of 3402 rules in 9772 ms. Remains 6265 /7894 variables (removed 1629) and now considering 6095/7868 (removed 1773) transitions.
// Phase 1: matrix 6095 rows 6265 cols
[2024-05-21 14:27:07] [INFO ] Computed 514 invariants in 157 ms
[2024-05-21 14:27:09] [INFO ] Implicit Places using invariants in 1618 ms returned []
[2024-05-21 14:27:09] [INFO ] Invariant cache hit.
[2024-05-21 14:27:10] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 2812 ms to find 0 implicit places.
[2024-05-21 14:27:10] [INFO ] Invariant cache hit.
[2024-05-21 14:27:11] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6265/7894 places, 6095/7868 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13579 ms. Remains : 6265/7894 places, 6095/7868 transitions.
Support contains 35 out of 6265 places after structural reductions.
[2024-05-21 14:27:12] [INFO ] Flatten gal took : 425 ms
[2024-05-21 14:27:12] [INFO ] Flatten gal took : 249 ms
[2024-05-21 14:27:12] [INFO ] Input system was already deterministic with 6095 transitions.
Support contains 33 out of 6265 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 19) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-21 14:27:14] [INFO ] Invariant cache hit.
[2024-05-21 14:27:16] [INFO ] After 1946ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-21 14:27:18] [INFO ] [Nat]Absence check using 513 positive place invariants in 976 ms returned sat
[2024-05-21 14:27:18] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 39 ms returned sat
[2024-05-21 14:27:30] [INFO ] After 10153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-21 14:27:36] [INFO ] Deduced a trap composed of 139 places in 5719 ms of which 5 ms to minimize.
[2024-05-21 14:27:41] [INFO ] Deduced a trap composed of 209 places in 5413 ms of which 6 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 14:27:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-21 14:27:41] [INFO ] After 25794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 4 properties in 818 ms.
Support contains 8 out of 6265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Drop transitions removed 2536 transitions
Trivial Post-agglo rules discarded 2536 transitions
Performed 2536 trivial Post agglomeration. Transition count delta: 2536
Iterating post reduction 0 with 2536 rules applied. Total rules applied 2536 place count 6265 transition count 3559
Reduce places removed 2536 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2824 rules applied. Total rules applied 5360 place count 3729 transition count 3271
Reduce places removed 192 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 194 rules applied. Total rules applied 5554 place count 3537 transition count 3269
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5556 place count 3535 transition count 3269
Performed 702 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 702 Pre rules applied. Total rules applied 5556 place count 3535 transition count 2567
Deduced a syphon composed of 702 places in 38 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 4 with 1404 rules applied. Total rules applied 6960 place count 2833 transition count 2567
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 6962 place count 2831 transition count 2565
Iterating global reduction 4 with 2 rules applied. Total rules applied 6964 place count 2831 transition count 2565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 6964 place count 2831 transition count 2563
Deduced a syphon composed of 2 places in 43 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 6968 place count 2829 transition count 2563
Performed 1140 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1140 places in 2 ms
Reduce places removed 1140 places and 0 transitions.
Iterating global reduction 4 with 2280 rules applied. Total rules applied 9248 place count 1689 transition count 1281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 9249 place count 1689 transition count 1280
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 9250 place count 1689 transition count 1279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 9252 place count 1688 transition count 1278
Free-agglomeration rule applied 287 times.
Iterating global reduction 5 with 287 rules applied. Total rules applied 9539 place count 1688 transition count 991
Reduce places removed 287 places and 0 transitions.
Iterating post reduction 5 with 287 rules applied. Total rules applied 9826 place count 1401 transition count 991
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 9827 place count 1400 transition count 990
Reduce places removed 402 places and 0 transitions.
Drop transitions removed 636 transitions
Trivial Post-agglo rules discarded 636 transitions
Performed 636 trivial Post agglomeration. Transition count delta: 636
Iterating post reduction 6 with 1038 rules applied. Total rules applied 10865 place count 998 transition count 354
Reduce places removed 636 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 638 rules applied. Total rules applied 11503 place count 362 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 11505 place count 360 transition count 352
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 115 Pre rules applied. Total rules applied 11505 place count 360 transition count 237
Deduced a syphon composed of 115 places in 1 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 9 with 230 rules applied. Total rules applied 11735 place count 245 transition count 237
Applied a total of 11735 rules in 2140 ms. Remains 245 /6265 variables (removed 6020) and now considering 237/6095 (removed 5858) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2140 ms. Remains : 245/6265 places, 237/6095 transitions.
Incomplete random walk after 10000 steps, including 84 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 237 rows 245 cols
[2024-05-21 14:27:45] [INFO ] Computed 112 invariants in 8 ms
[2024-05-21 14:27:45] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 14:27:45] [INFO ] [Nat]Absence check using 110 positive place invariants in 27 ms returned sat
[2024-05-21 14:27:45] [INFO ] [Nat]Absence check using 110 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-21 14:27:45] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 14:27:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 14:27:45] [INFO ] After 37ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 14:27:45] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-21 14:27:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-21 14:27:45] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-21 14:27:45] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 237/237 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 234
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 242 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 15 place count 236 transition count 231
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 15 place count 236 transition count 226
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 231 transition count 226
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 231 transition count 225
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 229 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 228 transition count 224
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 30 place count 228 transition count 221
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 36 place count 225 transition count 221
Applied a total of 36 rules in 265 ms. Remains 225 /245 variables (removed 20) and now considering 221/237 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 225/245 places, 221/237 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1583 stabilizing places and 1583 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 2 out of 6265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2539 transitions
Trivial Post-agglo rules discarded 2539 transitions
Performed 2539 trivial Post agglomeration. Transition count delta: 2539
Iterating post reduction 0 with 2539 rules applied. Total rules applied 2539 place count 6264 transition count 3555
Reduce places removed 2539 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2827 rules applied. Total rules applied 5366 place count 3725 transition count 3267
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5559 place count 3533 transition count 3266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5560 place count 3532 transition count 3266
Performed 703 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 703 Pre rules applied. Total rules applied 5560 place count 3532 transition count 2563
Deduced a syphon composed of 703 places in 45 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 4 with 1406 rules applied. Total rules applied 6966 place count 2829 transition count 2563
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 6969 place count 2826 transition count 2560
Iterating global reduction 4 with 3 rules applied. Total rules applied 6972 place count 2826 transition count 2560
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 6972 place count 2826 transition count 2557
Deduced a syphon composed of 3 places in 36 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 6978 place count 2823 transition count 2557
Performed 1143 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1143 places in 1 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 4 with 2286 rules applied. Total rules applied 9264 place count 1680 transition count 1270
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 9265 place count 1679 transition count 1269
Reduce places removed 191 places and 0 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 4 with 286 rules applied. Total rules applied 9551 place count 1488 transition count 1174
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 5 with 95 rules applied. Total rules applied 9646 place count 1393 transition count 1174
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9646 place count 1393 transition count 1078
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9838 place count 1297 transition count 1078
Applied a total of 9838 rules in 1522 ms. Remains 1297 /6265 variables (removed 4968) and now considering 1078/6095 (removed 5017) transitions.
// Phase 1: matrix 1078 rows 1297 cols
[2024-05-21 14:27:48] [INFO ] Computed 323 invariants in 11 ms
[2024-05-21 14:27:49] [INFO ] Implicit Places using invariants in 1476 ms returned [508, 582, 656, 734, 808, 882, 920, 958, 962, 966, 970, 974, 978, 982, 986, 990, 994, 998, 1002, 1006, 1010, 1014, 1018, 1022, 1026, 1030, 1034, 1038, 1042, 1046, 1050, 1054, 1058, 1062, 1066, 1070, 1074, 1078, 1082, 1086, 1090, 1094, 1098, 1102, 1106, 1110, 1114, 1118, 1122, 1126, 1130, 1134, 1138, 1142, 1146, 1150, 1152, 1154, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1174, 1178, 1182, 1186, 1190, 1194, 1198, 1202, 1206, 1210, 1214, 1218, 1222, 1225, 1227, 1229, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1247, 1251, 1255, 1259, 1263, 1267, 1271, 1275, 1279, 1283, 1287, 1291, 1296]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1479 ms to find 104 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1193/6265 places, 1078/6095 transitions.
Graph (trivial) has 494 edges and 1193 vertex of which 24 / 1193 are part of one of the 1 SCC in 4 ms
Free SCC test removed 23 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1091 transition count 954
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1091 transition count 954
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 162 place count 1088 transition count 951
Iterating global reduction 0 with 3 rules applied. Total rules applied 165 place count 1088 transition count 951
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 168 place count 1085 transition count 948
Iterating global reduction 0 with 3 rules applied. Total rules applied 171 place count 1085 transition count 948
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 174 place count 1082 transition count 945
Iterating global reduction 0 with 3 rules applied. Total rules applied 177 place count 1082 transition count 945
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 180 place count 1079 transition count 942
Iterating global reduction 0 with 3 rules applied. Total rules applied 183 place count 1079 transition count 942
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 186 place count 1076 transition count 939
Iterating global reduction 0 with 3 rules applied. Total rules applied 189 place count 1076 transition count 939
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 192 place count 1073 transition count 936
Iterating global reduction 0 with 3 rules applied. Total rules applied 195 place count 1073 transition count 936
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 198 place count 1070 transition count 933
Iterating global reduction 0 with 3 rules applied. Total rules applied 201 place count 1070 transition count 933
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 204 place count 1067 transition count 930
Iterating global reduction 0 with 3 rules applied. Total rules applied 207 place count 1067 transition count 930
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 210 place count 1064 transition count 927
Iterating global reduction 0 with 3 rules applied. Total rules applied 213 place count 1064 transition count 927
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 216 place count 1061 transition count 924
Iterating global reduction 0 with 3 rules applied. Total rules applied 219 place count 1061 transition count 924
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 222 place count 1058 transition count 921
Iterating global reduction 0 with 3 rules applied. Total rules applied 225 place count 1058 transition count 921
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 228 place count 1055 transition count 918
Iterating global reduction 0 with 3 rules applied. Total rules applied 231 place count 1055 transition count 918
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 233 place count 1053 transition count 916
Iterating global reduction 0 with 2 rules applied. Total rules applied 235 place count 1053 transition count 916
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 237 place count 1051 transition count 914
Iterating global reduction 0 with 2 rules applied. Total rules applied 239 place count 1051 transition count 914
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 241 place count 1049 transition count 912
Iterating global reduction 0 with 2 rules applied. Total rules applied 243 place count 1049 transition count 912
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 245 place count 1047 transition count 910
Iterating global reduction 0 with 2 rules applied. Total rules applied 247 place count 1047 transition count 910
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 249 place count 1045 transition count 908
Iterating global reduction 0 with 2 rules applied. Total rules applied 251 place count 1045 transition count 908
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 253 place count 1043 transition count 906
Iterating global reduction 0 with 2 rules applied. Total rules applied 255 place count 1043 transition count 906
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1041 transition count 904
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1041 transition count 904
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1039 transition count 902
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1039 transition count 902
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1037 transition count 900
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1037 transition count 900
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1035 transition count 898
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1035 transition count 898
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1033 transition count 896
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1033 transition count 896
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1031 transition count 894
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1031 transition count 894
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 283 place count 1029 transition count 892
Applied a total of 283 rules in 1426 ms. Remains 1029 /1193 variables (removed 164) and now considering 892/1078 (removed 186) transitions.
// Phase 1: matrix 892 rows 1029 cols
[2024-05-21 14:27:51] [INFO ] Computed 219 invariants in 9 ms
[2024-05-21 14:27:51] [INFO ] Implicit Places using invariants in 734 ms returned []
[2024-05-21 14:27:51] [INFO ] Invariant cache hit.
[2024-05-21 14:27:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 14:27:54] [INFO ] Implicit Places using invariants and state equation in 2156 ms returned []
Implicit Place search using SMT with State Equation took 2894 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1029/6265 places, 892/6095 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7323 ms. Remains : 1029/6265 places, 892/6095 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 208 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-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:(OR (EQ s304 0) (EQ s726 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 2433 steps with 10 reset in 123 ms.
FORMULA AutoFlight-PT-96b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLCardinality-01 finished in 7742 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(G(p0)) U G(p1))))'
Support contains 3 out of 6265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6258 transition count 6088
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6258 transition count 6088
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 6254 transition count 6084
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 6254 transition count 6084
Applied a total of 22 rules in 4179 ms. Remains 6254 /6265 variables (removed 11) and now considering 6084/6095 (removed 11) transitions.
// Phase 1: matrix 6084 rows 6254 cols
[2024-05-21 14:27:58] [INFO ] Computed 514 invariants in 67 ms
[2024-05-21 14:27:59] [INFO ] Implicit Places using invariants in 1002 ms returned []
[2024-05-21 14:27:59] [INFO ] Invariant cache hit.
[2024-05-21 14:28:00] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1969 ms to find 0 implicit places.
[2024-05-21 14:28:00] [INFO ] Invariant cache hit.
[2024-05-21 14:28:01] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6254/6265 places, 6084/6095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7108 ms. Remains : 6254/6265 places, 6084/6095 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s3473 0) (EQ s3561 1)), p0:(NEQ s2187 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 26 reset in 1127 ms.
Product exploration explored 100000 steps with 26 reset in 1397 ms.
Computed a total of 1578 stabilizing places and 1578 stable transitions
Computed a total of 1578 stabilizing places and 1578 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 14:28:05] [INFO ] Invariant cache hit.
[2024-05-21 14:28:06] [INFO ] After 1074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 14:28:08] [INFO ] [Nat]Absence check using 513 positive place invariants in 922 ms returned sat
[2024-05-21 14:28:08] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 42 ms returned sat
[2024-05-21 14:28:16] [INFO ] After 7588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 14:28:22] [INFO ] Deduced a trap composed of 206 places in 5583 ms of which 7 ms to minimize.
[2024-05-21 14:28:27] [INFO ] Deduced a trap composed of 294 places in 5332 ms of which 4 ms to minimize.
[2024-05-21 14:28:32] [INFO ] Deduced a trap composed of 294 places in 4924 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 14:28:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-21 14:28:32] [INFO ] After 26377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 42 ms.
Support contains 2 out of 6254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6254/6254 places, 6084/6084 transitions.
Drop transitions removed 2536 transitions
Trivial Post-agglo rules discarded 2536 transitions
Performed 2536 trivial Post agglomeration. Transition count delta: 2536
Iterating post reduction 0 with 2536 rules applied. Total rules applied 2536 place count 6254 transition count 3548
Reduce places removed 2536 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2824 rules applied. Total rules applied 5360 place count 3718 transition count 3260
Reduce places removed 192 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 194 rules applied. Total rules applied 5554 place count 3526 transition count 3258
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5556 place count 3524 transition count 3258
Performed 702 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 702 Pre rules applied. Total rules applied 5556 place count 3524 transition count 2556
Deduced a syphon composed of 702 places in 39 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 4 with 1404 rules applied. Total rules applied 6960 place count 2822 transition count 2556
Performed 1143 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1143 places in 1 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 4 with 2286 rules applied. Total rules applied 9246 place count 1679 transition count 1269
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 288 times.
Iterating global reduction 4 with 288 rules applied. Total rules applied 9534 place count 1679 transition count 981
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 4 with 288 rules applied. Total rules applied 9822 place count 1391 transition count 981
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9823 place count 1390 transition count 980
Reduce places removed 408 places and 0 transitions.
Drop transitions removed 663 transitions
Trivial Post-agglo rules discarded 663 transitions
Performed 663 trivial Post agglomeration. Transition count delta: 663
Iterating post reduction 5 with 1071 rules applied. Total rules applied 10894 place count 982 transition count 317
Reduce places removed 663 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 664 rules applied. Total rules applied 11558 place count 319 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 11559 place count 318 transition count 316
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 104 Pre rules applied. Total rules applied 11559 place count 318 transition count 212
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 8 with 208 rules applied. Total rules applied 11767 place count 214 transition count 212
Applied a total of 11767 rules in 1127 ms. Remains 214 /6254 variables (removed 6040) and now considering 212/6084 (removed 5872) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1127 ms. Remains : 214/6254 places, 212/6084 transitions.
Finished random walk after 886 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=38 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Support contains 3 out of 6254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6254/6254 places, 6084/6084 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2534 transitions
Trivial Post-agglo rules discarded 2534 transitions
Performed 2534 trivial Post agglomeration. Transition count delta: 2534
Iterating post reduction 0 with 2534 rules applied. Total rules applied 2534 place count 6253 transition count 3549
Reduce places removed 2534 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2822 rules applied. Total rules applied 5356 place count 3719 transition count 3261
Reduce places removed 192 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 194 rules applied. Total rules applied 5550 place count 3527 transition count 3259
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5552 place count 3525 transition count 3259
Performed 702 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 702 Pre rules applied. Total rules applied 5552 place count 3525 transition count 2557
Deduced a syphon composed of 702 places in 37 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 4 with 1404 rules applied. Total rules applied 6956 place count 2823 transition count 2557
Performed 1143 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1143 places in 1 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 4 with 2286 rules applied. Total rules applied 9242 place count 1680 transition count 1270
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 9243 place count 1679 transition count 1269
Reduce places removed 191 places and 0 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 4 with 286 rules applied. Total rules applied 9529 place count 1488 transition count 1174
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 5 with 95 rules applied. Total rules applied 9624 place count 1393 transition count 1174
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9624 place count 1393 transition count 1078
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9816 place count 1297 transition count 1078
Applied a total of 9816 rules in 1003 ms. Remains 1297 /6254 variables (removed 4957) and now considering 1078/6084 (removed 5006) transitions.
// Phase 1: matrix 1078 rows 1297 cols
[2024-05-21 14:28:35] [INFO ] Computed 323 invariants in 6 ms
[2024-05-21 14:28:36] [INFO ] Implicit Places using invariants in 1465 ms returned [584, 658, 696, 734, 808, 882, 920, 958, 962, 966, 970, 974, 978, 982, 986, 990, 994, 999, 1003, 1007, 1011, 1015, 1019, 1023, 1027, 1031, 1035, 1039, 1043, 1047, 1051, 1055, 1059, 1063, 1067, 1071, 1075, 1079, 1083, 1087, 1091, 1095, 1099, 1103, 1107, 1111, 1115, 1119, 1123, 1127, 1131, 1135, 1139, 1143, 1147, 1151, 1153, 1155, 1157, 1159, 1161, 1163, 1165, 1167, 1169, 1171, 1173, 1175, 1179, 1183, 1187, 1191, 1195, 1199, 1203, 1207, 1211, 1215, 1219, 1223, 1225, 1227, 1229, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1247, 1251, 1255, 1259, 1263, 1267, 1271, 1275, 1279, 1283, 1287, 1291, 1296]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1471 ms to find 104 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1193/6254 places, 1078/6084 transitions.
Graph (trivial) has 494 edges and 1193 vertex of which 25 / 1193 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 79 place count 1091 transition count 953
Iterating global reduction 0 with 78 rules applied. Total rules applied 157 place count 1091 transition count 953
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 160 place count 1088 transition count 950
Iterating global reduction 0 with 3 rules applied. Total rules applied 163 place count 1088 transition count 950
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 166 place count 1085 transition count 947
Iterating global reduction 0 with 3 rules applied. Total rules applied 169 place count 1085 transition count 947
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 172 place count 1082 transition count 944
Iterating global reduction 0 with 3 rules applied. Total rules applied 175 place count 1082 transition count 944
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 178 place count 1079 transition count 941
Iterating global reduction 0 with 3 rules applied. Total rules applied 181 place count 1079 transition count 941
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 184 place count 1076 transition count 938
Iterating global reduction 0 with 3 rules applied. Total rules applied 187 place count 1076 transition count 938
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 190 place count 1073 transition count 935
Iterating global reduction 0 with 3 rules applied. Total rules applied 193 place count 1073 transition count 935
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 196 place count 1070 transition count 932
Iterating global reduction 0 with 3 rules applied. Total rules applied 199 place count 1070 transition count 932
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 202 place count 1067 transition count 929
Iterating global reduction 0 with 3 rules applied. Total rules applied 205 place count 1067 transition count 929
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 208 place count 1064 transition count 926
Iterating global reduction 0 with 3 rules applied. Total rules applied 211 place count 1064 transition count 926
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 214 place count 1061 transition count 923
Iterating global reduction 0 with 3 rules applied. Total rules applied 217 place count 1061 transition count 923
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 220 place count 1058 transition count 920
Iterating global reduction 0 with 3 rules applied. Total rules applied 223 place count 1058 transition count 920
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 226 place count 1055 transition count 917
Iterating global reduction 0 with 3 rules applied. Total rules applied 229 place count 1055 transition count 917
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 230 place count 1054 transition count 916
Iterating global reduction 0 with 1 rules applied. Total rules applied 231 place count 1054 transition count 916
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 232 place count 1053 transition count 915
Iterating global reduction 0 with 1 rules applied. Total rules applied 233 place count 1053 transition count 915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 234 place count 1052 transition count 914
Iterating global reduction 0 with 1 rules applied. Total rules applied 235 place count 1052 transition count 914
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 236 place count 1051 transition count 913
Iterating global reduction 0 with 1 rules applied. Total rules applied 237 place count 1051 transition count 913
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 238 place count 1050 transition count 912
Iterating global reduction 0 with 1 rules applied. Total rules applied 239 place count 1050 transition count 912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 240 place count 1049 transition count 911
Iterating global reduction 0 with 1 rules applied. Total rules applied 241 place count 1049 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 242 place count 1048 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 243 place count 1048 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 244 place count 1047 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 245 place count 1047 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 246 place count 1046 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 247 place count 1046 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 248 place count 1045 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 249 place count 1045 transition count 907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 250 place count 1044 transition count 906
Iterating global reduction 0 with 1 rules applied. Total rules applied 251 place count 1044 transition count 906
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 252 place count 1043 transition count 905
Iterating global reduction 0 with 1 rules applied. Total rules applied 253 place count 1043 transition count 905
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 257 place count 1041 transition count 903
Applied a total of 257 rules in 917 ms. Remains 1041 /1193 variables (removed 152) and now considering 903/1078 (removed 175) transitions.
// Phase 1: matrix 903 rows 1041 cols
[2024-05-21 14:28:37] [INFO ] Computed 219 invariants in 4 ms
[2024-05-21 14:28:38] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2024-05-21 14:28:38] [INFO ] Invariant cache hit.
[2024-05-21 14:28:40] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 3247 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1041/6254 places, 903/6084 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6638 ms. Remains : 1041/6254 places, 903/6084 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 43 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 14:28:42] [INFO ] Invariant cache hit.
[2024-05-21 14:28:42] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 14:28:42] [INFO ] [Nat]Absence check using 219 positive place invariants in 64 ms returned sat
[2024-05-21 14:28:43] [INFO ] After 548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 14:28:43] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-21 14:28:43] [INFO ] After 934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 407 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 443 reset in 1641 ms.
Product exploration explored 100000 steps with 445 reset in 1859 ms.
Built C files in :
/tmp/ltsmin3447002768667855538
[2024-05-21 14:28:47] [INFO ] Computing symmetric may disable matrix : 903 transitions.
[2024-05-21 14:28:47] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:28:47] [INFO ] Computing symmetric may enable matrix : 903 transitions.
[2024-05-21 14:28:47] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:28:47] [INFO ] Computing Do-Not-Accords matrix : 903 transitions.
[2024-05-21 14:28:47] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:28:47] [INFO ] Built C files in 229ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3447002768667855538
Running compilation step : cd /tmp/ltsmin3447002768667855538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3447002768667855538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3447002768667855538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1041 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1041/1041 places, 903/903 transitions.
Applied a total of 0 rules in 38 ms. Remains 1041 /1041 variables (removed 0) and now considering 903/903 (removed 0) transitions.
[2024-05-21 14:28:50] [INFO ] Invariant cache hit.
[2024-05-21 14:28:51] [INFO ] Implicit Places using invariants in 1006 ms returned []
[2024-05-21 14:28:51] [INFO ] Invariant cache hit.
[2024-05-21 14:28:54] [INFO ] Implicit Places using invariants and state equation in 2356 ms returned []
Implicit Place search using SMT with State Equation took 3371 ms to find 0 implicit places.
[2024-05-21 14:28:54] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-21 14:28:54] [INFO ] Invariant cache hit.
[2024-05-21 14:28:55] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4545 ms. Remains : 1041/1041 places, 903/903 transitions.
Built C files in :
/tmp/ltsmin1481020378388319529
[2024-05-21 14:28:55] [INFO ] Computing symmetric may disable matrix : 903 transitions.
[2024-05-21 14:28:55] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:28:55] [INFO ] Computing symmetric may enable matrix : 903 transitions.
[2024-05-21 14:28:55] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:28:55] [INFO ] Computing Do-Not-Accords matrix : 903 transitions.
[2024-05-21 14:28:55] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:28:55] [INFO ] Built C files in 172ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1481020378388319529
Running compilation step : cd /tmp/ltsmin1481020378388319529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1481020378388319529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1481020378388319529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 14:28:58] [INFO ] Flatten gal took : 37 ms
[2024-05-21 14:28:59] [INFO ] Flatten gal took : 36 ms
[2024-05-21 14:28:59] [INFO ] Time to serialize gal into /tmp/LTL9910704011343558869.gal : 13 ms
[2024-05-21 14:28:59] [INFO ] Time to serialize properties into /tmp/LTL6606442714357011667.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9910704011343558869.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8544691102844645420.hoa' '-atoms' '/tmp/LTL6606442714357011667.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6606442714357011667.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8544691102844645420.hoa
Detected timeout of ITS tools.
[2024-05-21 14:29:14] [INFO ] Flatten gal took : 31 ms
[2024-05-21 14:29:14] [INFO ] Flatten gal took : 31 ms
[2024-05-21 14:29:14] [INFO ] Time to serialize gal into /tmp/LTL2663071598444113016.gal : 7 ms
[2024-05-21 14:29:14] [INFO ] Time to serialize properties into /tmp/LTL14003751036610345056.ltl : 4 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/LTL2663071598444113016.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14003751036610345056.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(p3376!=1)")))U(G("((p5009==0)||(p5098==1))")))))
Formula 0 simplified : X(GF!"(p3376!=1)" R F!"((p5009==0)||(p5098==1))")
Detected timeout of ITS tools.
[2024-05-21 14:29:29] [INFO ] Flatten gal took : 30 ms
[2024-05-21 14:29:29] [INFO ] Applying decomposition
[2024-05-21 14:29:29] [INFO ] Flatten gal took : 32 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/graph11491632806272391441.txt' '-o' '/tmp/graph11491632806272391441.bin' '-w' '/tmp/graph11491632806272391441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11491632806272391441.bin' '-l' '-1' '-v' '-w' '/tmp/graph11491632806272391441.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:29:29] [INFO ] Decomposing Gal with order
[2024-05-21 14:29:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:29:29] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-21 14:29:29] [INFO ] Flatten gal took : 179 ms
[2024-05-21 14:29:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 20 ms.
[2024-05-21 14:29:30] [INFO ] Time to serialize gal into /tmp/LTL17978274246502474235.gal : 23 ms
[2024-05-21 14:29:30] [INFO ] Time to serialize properties into /tmp/LTL5245585138525623717.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/LTL17978274246502474235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5245585138525623717.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(i1.i1.i1.u216.p3376!=1)")))U(G("((i12.i1.i2.u227.p5009==0)||(i14.i0.i0.u250.p5098==1))")))))
Formula 0 simplified : X(GF!"(i1.i1.i1.u216.p3376!=1)" R F!"((i12.i1.i2.u227.p5009==0)||(i14.i0.i0.u250.p5098==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.47338e+24 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14223477900341142691
[2024-05-21 14:29:45] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14223477900341142691
Running compilation step : cd /tmp/ltsmin14223477900341142691;'/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 2736 ms.
Running link step : cd /tmp/ltsmin14223477900341142691;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin14223477900341142691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true))) U []((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-96b-LTLCardinality-02 finished in 125859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0&&X((p0 U (p1||G(p0))))))) U ((X(X((p0&&X((p0 U (p1||G(p0)))))))&&G(p2))||X(X(G((p0&&X((p0 U (p1||G(p0)))))))))))'
Support contains 4 out of 6265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6258 transition count 6088
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6258 transition count 6088
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 6254 transition count 6084
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 6254 transition count 6084
Applied a total of 22 rules in 4432 ms. Remains 6254 /6265 variables (removed 11) and now considering 6084/6095 (removed 11) transitions.
// Phase 1: matrix 6084 rows 6254 cols
[2024-05-21 14:30:04] [INFO ] Computed 514 invariants in 55 ms
[2024-05-21 14:30:05] [INFO ] Implicit Places using invariants in 989 ms returned []
[2024-05-21 14:30:05] [INFO ] Invariant cache hit.
[2024-05-21 14:30:06] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1930 ms to find 0 implicit places.
[2024-05-21 14:30:06] [INFO ] Invariant cache hit.
[2024-05-21 14:30:07] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6254/6265 places, 6084/6095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7289 ms. Remains : 6254/6265 places, 6084/6095 transitions.
Stuttering acceptance computed with spot in 449 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 6}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 9}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}, { cond=p2, acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}, { cond=p2, acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 6}, { cond=(AND p2 p0), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 6}, { cond=(AND p2 p0), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=(AND p2 p0), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 6}], [{ cond=(NOT p2), acceptance={} source=9 dest: 0}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=3, aps=[p2:(NEQ s342 1), p0:(OR (EQ s4567 0) (EQ s1225 1)), p1:(NEQ s4300 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3232 steps with 0 reset in 36 ms.
FORMULA AutoFlight-PT-96b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLCardinality-03 finished in 7899 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)||X(F(p1)))))'
Support contains 4 out of 6265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2535 transitions
Trivial Post-agglo rules discarded 2535 transitions
Performed 2535 trivial Post agglomeration. Transition count delta: 2535
Iterating post reduction 0 with 2535 rules applied. Total rules applied 2535 place count 6264 transition count 3559
Reduce places removed 2535 places and 0 transitions.
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 1 with 2820 rules applied. Total rules applied 5355 place count 3729 transition count 3274
Reduce places removed 190 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 192 rules applied. Total rules applied 5547 place count 3539 transition count 3272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5549 place count 3537 transition count 3272
Performed 705 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 705 Pre rules applied. Total rules applied 5549 place count 3537 transition count 2567
Deduced a syphon composed of 705 places in 45 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 4 with 1410 rules applied. Total rules applied 6959 place count 2832 transition count 2567
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 6963 place count 2828 transition count 2563
Iterating global reduction 4 with 4 rules applied. Total rules applied 6967 place count 2828 transition count 2563
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 6967 place count 2828 transition count 2559
Deduced a syphon composed of 4 places in 36 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 6975 place count 2824 transition count 2559
Performed 1139 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1139 places in 0 ms
Reduce places removed 1139 places and 0 transitions.
Iterating global reduction 4 with 2278 rules applied. Total rules applied 9253 place count 1685 transition count 1276
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 9255 place count 1684 transition count 1276
Applied a total of 9255 rules in 1399 ms. Remains 1684 /6265 variables (removed 4581) and now considering 1276/6095 (removed 4819) transitions.
// Phase 1: matrix 1276 rows 1684 cols
[2024-05-21 14:30:09] [INFO ] Computed 514 invariants in 10 ms
[2024-05-21 14:30:30] [INFO ] Implicit Places using invariants in 20640 ms returned [505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 1606, 1610, 1616, 1622, 1628, 1634, 1640, 1646, 1652, 1658, 1664, 1670, 1676]
Discarding 203 places :
Implicit Place search using SMT only with invariants took 20646 ms to find 203 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1481/6265 places, 1276/6095 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 0 with 94 rules applied. Total rules applied 94 place count 1481 transition count 1182
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 1387 transition count 1182
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 188 place count 1387 transition count 1086
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 380 place count 1291 transition count 1086
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 392 place count 1279 transition count 1074
Iterating global reduction 2 with 12 rules applied. Total rules applied 404 place count 1279 transition count 1074
Applied a total of 404 rules in 175 ms. Remains 1279 /1481 variables (removed 202) and now considering 1074/1276 (removed 202) transitions.
// Phase 1: matrix 1074 rows 1279 cols
[2024-05-21 14:30:30] [INFO ] Computed 311 invariants in 7 ms
[2024-05-21 14:30:32] [INFO ] Implicit Places using invariants in 1863 ms returned [1278]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1879 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1278/6265 places, 1074/6095 transitions.
Graph (trivial) has 302 edges and 1278 vertex of which 2 / 1278 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 1277 transition count 1051
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 1255 transition count 1051
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 66 place count 1234 transition count 1030
Iterating global reduction 2 with 21 rules applied. Total rules applied 87 place count 1234 transition count 1030
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 225 place count 1165 transition count 961
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 226 place count 1165 transition count 960
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 227 place count 1164 transition count 960
Applied a total of 227 rules in 232 ms. Remains 1164 /1278 variables (removed 114) and now considering 960/1074 (removed 114) transitions.
// Phase 1: matrix 960 rows 1164 cols
[2024-05-21 14:30:32] [INFO ] Computed 288 invariants in 4 ms
[2024-05-21 14:30:33] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2024-05-21 14:30:33] [INFO ] Invariant cache hit.
[2024-05-21 14:30:34] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-21 14:30:38] [INFO ] Implicit Places using invariants and state equation in 4961 ms returned []
Implicit Place search using SMT with State Equation took 6080 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1164/6265 places, 960/6095 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 30413 ms. Remains : 1164/6265 places, 960/6095 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1049 0) (EQ s511 1)), p1:(OR (EQ s1129 0) (EQ s508 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 72575 steps with 348 reset in 1296 ms.
FORMULA AutoFlight-PT-96b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLCardinality-07 finished in 31815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 6265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6258 transition count 6088
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6258 transition count 6088
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 6254 transition count 6084
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 6254 transition count 6084
Applied a total of 22 rules in 4515 ms. Remains 6254 /6265 variables (removed 11) and now considering 6084/6095 (removed 11) transitions.
// Phase 1: matrix 6084 rows 6254 cols
[2024-05-21 14:30:44] [INFO ] Computed 514 invariants in 43 ms
[2024-05-21 14:30:45] [INFO ] Implicit Places using invariants in 961 ms returned []
[2024-05-21 14:30:45] [INFO ] Invariant cache hit.
[2024-05-21 14:30:46] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1916 ms to find 0 implicit places.
[2024-05-21 14:30:46] [INFO ] Invariant cache hit.
[2024-05-21 14:30:47] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6254/6265 places, 6084/6095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7338 ms. Remains : 6254/6265 places, 6084/6095 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s2516 0) (EQ s4141 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 46 reset in 854 ms.
Product exploration explored 100000 steps with 46 reset in 1057 ms.
Computed a total of 1578 stabilizing places and 1578 stable transitions
Computed a total of 1578 stabilizing places and 1578 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2065 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=108 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 14:30:50] [INFO ] Invariant cache hit.
[2024-05-21 14:31:00] [INFO ] [Real]Absence check using 513 positive place invariants in 2544 ms returned sat
[2024-05-21 14:31:00] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 67 ms returned sat
[2024-05-21 14:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 14:31:05] [INFO ] [Real]Absence check using state equation in 5227 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 6254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6254/6254 places, 6084/6084 transitions.
Applied a total of 0 rules in 1462 ms. Remains 6254 /6254 variables (removed 0) and now considering 6084/6084 (removed 0) transitions.
[2024-05-21 14:31:07] [INFO ] Invariant cache hit.
[2024-05-21 14:31:08] [INFO ] Implicit Places using invariants in 1245 ms returned []
[2024-05-21 14:31:08] [INFO ] Invariant cache hit.
[2024-05-21 14:31:09] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 2213 ms to find 0 implicit places.
[2024-05-21 14:31:09] [INFO ] Invariant cache hit.
[2024-05-21 14:31:10] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4571 ms. Remains : 6254/6254 places, 6084/6084 transitions.
Computed a total of 1578 stabilizing places and 1578 stable transitions
Computed a total of 1578 stabilizing places and 1578 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2323 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=129 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 14:31:11] [INFO ] Invariant cache hit.
[2024-05-21 14:31:21] [INFO ] [Real]Absence check using 513 positive place invariants in 2285 ms returned sat
[2024-05-21 14:31:21] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 60 ms returned sat
[2024-05-21 14:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 14:31:26] [INFO ] [Real]Absence check using state equation in 5640 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 46 reset in 700 ms.
Product exploration explored 100000 steps with 46 reset in 833 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 6254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6254/6254 places, 6084/6084 transitions.
Performed 2275 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2275 rules applied. Total rules applied 2275 place count 6254 transition count 6084
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 192 rules applied. Total rules applied 2467 place count 6254 transition count 5988
Performed 844 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 844 Pre rules applied. Total rules applied 2467 place count 6254 transition count 5988
Deduced a syphon composed of 3215 places in 76 ms
Iterating global reduction 2 with 844 rules applied. Total rules applied 3311 place count 6254 transition count 5988
Discarding 2096 places :
Symmetric choice reduction at 2 with 2096 rule applications. Total rules 5407 place count 4158 transition count 3892
Deduced a syphon composed of 1119 places in 50 ms
Iterating global reduction 2 with 2096 rules applied. Total rules applied 7503 place count 4158 transition count 3892
Performed 1360 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 2479 places in 2 ms
Iterating global reduction 2 with 1360 rules applied. Total rules applied 8863 place count 4158 transition count 3748
Renaming transitions due to excessive name length > 1024 char.
Discarding 847 places :
Symmetric choice reduction at 2 with 847 rule applications. Total rules 9710 place count 3311 transition count 2901
Deduced a syphon composed of 1632 places in 1 ms
Iterating global reduction 2 with 847 rules applied. Total rules applied 10557 place count 3311 transition count 2901
Deduced a syphon composed of 1632 places in 2 ms
Applied a total of 10557 rules in 10663 ms. Remains 3311 /6254 variables (removed 2943) and now considering 2901/6084 (removed 3183) transitions.
[2024-05-21 14:31:39] [INFO ] Redundant transitions in 152 ms returned []
// Phase 1: matrix 2901 rows 3311 cols
[2024-05-21 14:31:40] [INFO ] Computed 514 invariants in 605 ms
[2024-05-21 14:31:43] [INFO ] Dead Transitions using invariants and state equation in 4117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3311/6254 places, 2901/6084 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14944 ms. Remains : 3311/6254 places, 2901/6084 transitions.
Built C files in :
/tmp/ltsmin374165562930508974
[2024-05-21 14:31:43] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin374165562930508974
Running compilation step : cd /tmp/ltsmin374165562930508974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin374165562930508974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin374165562930508974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 6254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6254/6254 places, 6084/6084 transitions.
Applied a total of 0 rules in 1529 ms. Remains 6254 /6254 variables (removed 0) and now considering 6084/6084 (removed 0) transitions.
// Phase 1: matrix 6084 rows 6254 cols
[2024-05-21 14:31:48] [INFO ] Computed 514 invariants in 45 ms
[2024-05-21 14:31:49] [INFO ] Implicit Places using invariants in 999 ms returned []
[2024-05-21 14:31:49] [INFO ] Invariant cache hit.
[2024-05-21 14:31:50] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1947 ms to find 0 implicit places.
[2024-05-21 14:31:50] [INFO ] Invariant cache hit.
[2024-05-21 14:31:51] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4427 ms. Remains : 6254/6254 places, 6084/6084 transitions.
Built C files in :
/tmp/ltsmin15948930065647711012
[2024-05-21 14:31:51] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15948930065647711012
Running compilation step : cd /tmp/ltsmin15948930065647711012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15948930065647711012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15948930065647711012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 14:31:54] [INFO ] Flatten gal took : 152 ms
[2024-05-21 14:31:55] [INFO ] Flatten gal took : 159 ms
[2024-05-21 14:31:55] [INFO ] Time to serialize gal into /tmp/LTL11757892212097756443.gal : 26 ms
[2024-05-21 14:31:55] [INFO ] Time to serialize properties into /tmp/LTL13644251940477091733.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11757892212097756443.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17343560985856409296.hoa' '-atoms' '/tmp/LTL13644251940477091733.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...320
Loading property file /tmp/LTL13644251940477091733.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17343560985856409296.hoa
Detected timeout of ITS tools.
[2024-05-21 14:32:10] [INFO ] Flatten gal took : 146 ms
[2024-05-21 14:32:10] [INFO ] Flatten gal took : 151 ms
[2024-05-21 14:32:10] [INFO ] Time to serialize gal into /tmp/LTL4663702461539081478.gal : 26 ms
[2024-05-21 14:32:10] [INFO ] Time to serialize properties into /tmp/LTL11310296650210477952.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/LTL4663702461539081478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11310296650210477952.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((p3807==0)&&(p5681==1))"))))))
Formula 0 simplified : XXXG!"((p3807==0)&&(p5681==1))"
Detected timeout of ITS tools.
[2024-05-21 14:32:25] [INFO ] Flatten gal took : 148 ms
[2024-05-21 14:32:25] [INFO ] Applying decomposition
[2024-05-21 14:32:25] [INFO ] Flatten gal took : 165 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/graph18062170482581747334.txt' '-o' '/tmp/graph18062170482581747334.bin' '-w' '/tmp/graph18062170482581747334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18062170482581747334.bin' '-l' '-1' '-v' '-w' '/tmp/graph18062170482581747334.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:32:26] [INFO ] Decomposing Gal with order
[2024-05-21 14:32:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:32:29] [INFO ] Removed a total of 1111 redundant transitions.
[2024-05-21 14:32:29] [INFO ] Flatten gal took : 342 ms
[2024-05-21 14:32:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2024-05-21 14:32:30] [INFO ] Time to serialize gal into /tmp/LTL6450590366317039445.gal : 66 ms
[2024-05-21 14:32:30] [INFO ] Time to serialize properties into /tmp/LTL11248831578139372494.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/LTL6450590366317039445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11248831578139372494.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((i33.u1057.p3807==0)&&(i48.i0.i1.i0.u1727.p5681==1))"))))))
Formula 0 simplified : XXXG!"((i33.u1057.p3807==0)&&(i48.i0.i1.i0.u1727.p5681==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8636433723253097456
[2024-05-21 14:32:45] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8636433723253097456
Running compilation step : cd /tmp/ltsmin8636433723253097456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8636433723253097456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8636433723253097456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutoFlight-PT-96b-LTLCardinality-08 finished in 128348 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 1 out of 6265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2542 transitions
Trivial Post-agglo rules discarded 2542 transitions
Performed 2542 trivial Post agglomeration. Transition count delta: 2542
Iterating post reduction 0 with 2542 rules applied. Total rules applied 2542 place count 6264 transition count 3552
Reduce places removed 2542 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2830 rules applied. Total rules applied 5372 place count 3722 transition count 3264
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5565 place count 3530 transition count 3263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5566 place count 3529 transition count 3263
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 5566 place count 3529 transition count 2562
Deduced a syphon composed of 701 places in 39 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 4 with 1402 rules applied. Total rules applied 6968 place count 2828 transition count 2562
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 6972 place count 2824 transition count 2558
Iterating global reduction 4 with 4 rules applied. Total rules applied 6976 place count 2824 transition count 2558
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 6976 place count 2824 transition count 2554
Deduced a syphon composed of 4 places in 38 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 6984 place count 2820 transition count 2554
Performed 1143 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1143 places in 1 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 4 with 2286 rules applied. Total rules applied 9270 place count 1677 transition count 1267
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9271 place count 1676 transition count 1266
Reduce places removed 191 places and 0 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 4 with 285 rules applied. Total rules applied 9556 place count 1485 transition count 1172
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 5 with 94 rules applied. Total rules applied 9650 place count 1391 transition count 1172
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9650 place count 1391 transition count 1076
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9842 place count 1295 transition count 1076
Applied a total of 9842 rules in 1376 ms. Remains 1295 /6265 variables (removed 4970) and now considering 1076/6095 (removed 5019) transitions.
// Phase 1: matrix 1076 rows 1295 cols
[2024-05-21 14:32:49] [INFO ] Computed 323 invariants in 6 ms
[2024-05-21 14:32:50] [INFO ] Implicit Places using invariants in 1321 ms returned [506, 580, 654, 692, 730, 804, 878, 916, 954, 958, 962, 966, 970, 974, 978, 982, 986, 990, 994, 998, 1002, 1006, 1010, 1014, 1018, 1022, 1026, 1030, 1034, 1038, 1042, 1046, 1050, 1054, 1058, 1062, 1066, 1070, 1074, 1078, 1082, 1086, 1090, 1094, 1098, 1102, 1106, 1110, 1114, 1118, 1122, 1126, 1130, 1134, 1138, 1142, 1146, 1148, 1152, 1154, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1176, 1180, 1184, 1188, 1192, 1196, 1200, 1204, 1208, 1212, 1216, 1220, 1223, 1225, 1227, 1229, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1249, 1253, 1257, 1261, 1265, 1269, 1273, 1277, 1281, 1285, 1289, 1294]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1325 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1190/6265 places, 1076/6095 transitions.
Graph (trivial) has 496 edges and 1190 vertex of which 23 / 1190 are part of one of the 1 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1168 transition count 1032
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1167 transition count 1032
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 83 place count 1087 transition count 952
Iterating global reduction 2 with 80 rules applied. Total rules applied 163 place count 1087 transition count 952
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 167 place count 1083 transition count 948
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 1083 transition count 948
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 175 place count 1079 transition count 944
Iterating global reduction 2 with 4 rules applied. Total rules applied 179 place count 1079 transition count 944
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 1075 transition count 940
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 1075 transition count 940
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 191 place count 1071 transition count 936
Iterating global reduction 2 with 4 rules applied. Total rules applied 195 place count 1071 transition count 936
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 199 place count 1067 transition count 932
Iterating global reduction 2 with 4 rules applied. Total rules applied 203 place count 1067 transition count 932
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 207 place count 1063 transition count 928
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 1063 transition count 928
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 215 place count 1059 transition count 924
Iterating global reduction 2 with 4 rules applied. Total rules applied 219 place count 1059 transition count 924
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 223 place count 1055 transition count 920
Iterating global reduction 2 with 4 rules applied. Total rules applied 227 place count 1055 transition count 920
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 231 place count 1051 transition count 916
Iterating global reduction 2 with 4 rules applied. Total rules applied 235 place count 1051 transition count 916
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 239 place count 1047 transition count 912
Iterating global reduction 2 with 4 rules applied. Total rules applied 243 place count 1047 transition count 912
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 247 place count 1043 transition count 908
Iterating global reduction 2 with 4 rules applied. Total rules applied 251 place count 1043 transition count 908
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 255 place count 1039 transition count 904
Iterating global reduction 2 with 4 rules applied. Total rules applied 259 place count 1039 transition count 904
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 261 place count 1037 transition count 902
Iterating global reduction 2 with 2 rules applied. Total rules applied 263 place count 1037 transition count 902
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 265 place count 1035 transition count 900
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 1035 transition count 900
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 269 place count 1033 transition count 898
Iterating global reduction 2 with 2 rules applied. Total rules applied 271 place count 1033 transition count 898
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 273 place count 1031 transition count 896
Iterating global reduction 2 with 2 rules applied. Total rules applied 275 place count 1031 transition count 896
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 277 place count 1029 transition count 894
Iterating global reduction 2 with 2 rules applied. Total rules applied 279 place count 1029 transition count 894
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 281 place count 1027 transition count 892
Iterating global reduction 2 with 2 rules applied. Total rules applied 283 place count 1027 transition count 892
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 285 place count 1025 transition count 890
Iterating global reduction 2 with 2 rules applied. Total rules applied 287 place count 1025 transition count 890
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 289 place count 1023 transition count 888
Iterating global reduction 2 with 2 rules applied. Total rules applied 291 place count 1023 transition count 888
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 293 place count 1021 transition count 886
Iterating global reduction 2 with 2 rules applied. Total rules applied 295 place count 1021 transition count 886
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 297 place count 1019 transition count 884
Iterating global reduction 2 with 2 rules applied. Total rules applied 299 place count 1019 transition count 884
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 301 place count 1017 transition count 882
Iterating global reduction 2 with 2 rules applied. Total rules applied 303 place count 1017 transition count 882
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 305 place count 1015 transition count 880
Iterating global reduction 2 with 2 rules applied. Total rules applied 307 place count 1015 transition count 880
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 1014 transition count 879
Applied a total of 309 rules in 953 ms. Remains 1014 /1190 variables (removed 176) and now considering 879/1076 (removed 197) transitions.
// Phase 1: matrix 879 rows 1014 cols
[2024-05-21 14:32:51] [INFO ] Computed 218 invariants in 4 ms
[2024-05-21 14:32:52] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-05-21 14:32:52] [INFO ] Invariant cache hit.
[2024-05-21 14:32:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 14:32:54] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 2898 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1014/6265 places, 879/6095 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6553 ms. Remains : 1014/6265 places, 879/6095 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s962 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLCardinality-09 finished in 6652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)||p0))||G(p2))))'
Support contains 5 out of 6265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2538 transitions
Trivial Post-agglo rules discarded 2538 transitions
Performed 2538 trivial Post agglomeration. Transition count delta: 2538
Iterating post reduction 0 with 2538 rules applied. Total rules applied 2538 place count 6264 transition count 3556
Reduce places removed 2538 places and 0 transitions.
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 1 with 2823 rules applied. Total rules applied 5361 place count 3726 transition count 3271
Reduce places removed 190 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 191 rules applied. Total rules applied 5552 place count 3536 transition count 3270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5553 place count 3535 transition count 3270
Performed 703 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 703 Pre rules applied. Total rules applied 5553 place count 3535 transition count 2567
Deduced a syphon composed of 703 places in 37 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 4 with 1406 rules applied. Total rules applied 6959 place count 2832 transition count 2567
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 6963 place count 2828 transition count 2563
Iterating global reduction 4 with 4 rules applied. Total rules applied 6967 place count 2828 transition count 2563
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 6967 place count 2828 transition count 2559
Deduced a syphon composed of 4 places in 37 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 6975 place count 2824 transition count 2559
Performed 1141 Post agglomeration using F-continuation condition with reduction of 143 identical transitions.
Deduced a syphon composed of 1141 places in 1 ms
Reduce places removed 1141 places and 0 transitions.
Iterating global reduction 4 with 2282 rules applied. Total rules applied 9257 place count 1683 transition count 1275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 9258 place count 1683 transition count 1274
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 9260 place count 1682 transition count 1274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9261 place count 1681 transition count 1273
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 5 with 70 rules applied. Total rules applied 9331 place count 1634 transition count 1250
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 9354 place count 1611 transition count 1250
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 24 Pre rules applied. Total rules applied 9354 place count 1611 transition count 1226
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 9402 place count 1587 transition count 1226
Applied a total of 9402 rules in 1465 ms. Remains 1587 /6265 variables (removed 4678) and now considering 1226/6095 (removed 4869) transitions.
// Phase 1: matrix 1226 rows 1587 cols
[2024-05-21 14:32:56] [INFO ] Computed 467 invariants in 10 ms
[2024-05-21 14:32:58] [INFO ] Implicit Places using invariants in 2319 ms returned [654, 728, 842, 880, 954, 1028, 1066, 1104, 1110, 1116, 1122, 1128, 1134, 1140, 1146, 1152, 1158, 1164, 1170, 1176, 1182, 1188, 1194, 1200, 1206, 1212, 1218, 1224, 1230, 1236, 1242, 1248, 1254, 1260, 1266, 1272, 1278, 1284, 1290, 1296, 1302, 1308, 1314, 1320, 1326, 1332, 1338, 1344, 1350, 1356, 1362, 1368, 1374, 1380, 1386, 1392, 1396, 1400, 1404, 1408, 1412, 1416, 1420, 1424, 1428, 1432, 1436, 1440, 1446, 1452, 1458, 1464, 1470, 1476, 1482, 1488, 1494, 1500, 1506, 1512, 1515, 1517, 1519, 1521, 1523, 1525, 1527, 1529, 1531, 1533, 1535, 1537, 1541, 1545, 1549, 1553, 1557, 1561, 1565, 1569, 1573, 1577, 1581, 1586]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 2322 ms to find 104 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1483/6265 places, 1226/6095 transitions.
Graph (trivial) has 493 edges and 1483 vertex of which 12 / 1483 are part of one of the 1 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 92 place count 1381 transition count 1114
Iterating global reduction 0 with 91 rules applied. Total rules applied 183 place count 1381 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 186 place count 1378 transition count 1111
Iterating global reduction 0 with 3 rules applied. Total rules applied 189 place count 1378 transition count 1111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 192 place count 1375 transition count 1108
Iterating global reduction 0 with 3 rules applied. Total rules applied 195 place count 1375 transition count 1108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 198 place count 1372 transition count 1105
Iterating global reduction 0 with 3 rules applied. Total rules applied 201 place count 1372 transition count 1105
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 204 place count 1369 transition count 1102
Iterating global reduction 0 with 3 rules applied. Total rules applied 207 place count 1369 transition count 1102
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 210 place count 1366 transition count 1099
Iterating global reduction 0 with 3 rules applied. Total rules applied 213 place count 1366 transition count 1099
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 216 place count 1363 transition count 1096
Iterating global reduction 0 with 3 rules applied. Total rules applied 219 place count 1363 transition count 1096
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 222 place count 1360 transition count 1093
Iterating global reduction 0 with 3 rules applied. Total rules applied 225 place count 1360 transition count 1093
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 228 place count 1357 transition count 1090
Iterating global reduction 0 with 3 rules applied. Total rules applied 231 place count 1357 transition count 1090
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 234 place count 1354 transition count 1087
Iterating global reduction 0 with 3 rules applied. Total rules applied 237 place count 1354 transition count 1087
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 240 place count 1351 transition count 1084
Iterating global reduction 0 with 3 rules applied. Total rules applied 243 place count 1351 transition count 1084
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 246 place count 1348 transition count 1081
Iterating global reduction 0 with 3 rules applied. Total rules applied 249 place count 1348 transition count 1081
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 252 place count 1345 transition count 1078
Iterating global reduction 0 with 3 rules applied. Total rules applied 255 place count 1345 transition count 1078
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1343 transition count 1076
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1343 transition count 1076
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1341 transition count 1074
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1341 transition count 1074
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1339 transition count 1072
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1339 transition count 1072
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1337 transition count 1070
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1337 transition count 1070
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1335 transition count 1068
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1335 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1333 transition count 1066
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1333 transition count 1066
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1331 transition count 1064
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1331 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1329 transition count 1062
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1329 transition count 1062
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1327 transition count 1060
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1327 transition count 1060
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1325 transition count 1058
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1325 transition count 1058
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1323 transition count 1056
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1323 transition count 1056
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1321 transition count 1054
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1321 transition count 1054
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 307 place count 1319 transition count 1052
Applied a total of 307 rules in 1798 ms. Remains 1319 /1483 variables (removed 164) and now considering 1052/1226 (removed 174) transitions.
// Phase 1: matrix 1052 rows 1319 cols
[2024-05-21 14:33:00] [INFO ] Computed 363 invariants in 9 ms
[2024-05-21 14:33:01] [INFO ] Implicit Places using invariants in 1294 ms returned []
[2024-05-21 14:33:01] [INFO ] Invariant cache hit.
[2024-05-21 14:33:03] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-21 14:33:15] [INFO ] Implicit Places using invariants and state equation in 13975 ms returned [506, 508, 510, 512, 514, 516, 518, 520, 522, 524, 526, 528, 530, 532, 534, 536, 538, 540, 542, 544, 546, 548, 550, 552, 554, 556, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 584, 586, 592, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 620, 622, 624, 626, 628, 630, 632, 634, 636, 638, 640, 642, 644, 646, 648, 650]
Discarding 71 places :
Implicit Place search using SMT with State Equation took 15281 ms to find 71 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1248/6265 places, 1052/6095 transitions.
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 59 Pre rules applied. Total rules applied 0 place count 1248 transition count 993
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 0 with 118 rules applied. Total rules applied 118 place count 1189 transition count 993
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 129 place count 1178 transition count 982
Iterating global reduction 0 with 11 rules applied. Total rules applied 140 place count 1178 transition count 982
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 142 place count 1177 transition count 981
Applied a total of 142 rules in 162 ms. Remains 1177 /1248 variables (removed 71) and now considering 981/1052 (removed 71) transitions.
// Phase 1: matrix 981 rows 1177 cols
[2024-05-21 14:33:15] [INFO ] Computed 292 invariants in 6 ms
[2024-05-21 14:33:17] [INFO ] Implicit Places using invariants in 1391 ms returned []
[2024-05-21 14:33:17] [INFO ] Invariant cache hit.
[2024-05-21 14:33:18] [INFO ] State equation strengthened by 301 read => feed constraints.
[2024-05-21 14:33:28] [INFO ] Implicit Places using invariants and state equation in 11112 ms returned []
Implicit Place search using SMT with State Equation took 12523 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1177/6265 places, 981/6095 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 33557 ms. Remains : 1177/6265 places, 981/6095 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s131 0) (EQ s1071 1)), p2:(OR (EQ s547 0) (AND (EQ s765 0) (EQ s581 1))), p1:(EQ s547 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 437 reset in 1670 ms.
Product exploration explored 100000 steps with 438 reset in 1926 ms.
Computed a total of 77 stabilizing places and 5 stable transitions
Computed a total of 77 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 43 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 148500 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148500 steps, saw 80275 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-21 14:33:36] [INFO ] Invariant cache hit.
[2024-05-21 14:33:36] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 14:33:36] [INFO ] [Nat]Absence check using 292 positive place invariants in 89 ms returned sat
[2024-05-21 14:33:37] [INFO ] After 943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 14:33:37] [INFO ] State equation strengthened by 301 read => feed constraints.
[2024-05-21 14:33:37] [INFO ] After 283ms SMT Verify possible using 301 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 14:33:38] [INFO ] After 618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 209 ms.
[2024-05-21 14:33:38] [INFO ] After 2180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 45 ms.
Support contains 5 out of 1177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1177/1177 places, 981/981 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 1177 transition count 980
Free-agglomeration rule applied 379 times.
Iterating global reduction 1 with 379 rules applied. Total rules applied 380 place count 1177 transition count 601
Reduce places removed 379 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1456 edges and 798 vertex of which 785 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 393 rules applied. Total rules applied 773 place count 785 transition count 588
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 776 place count 782 transition count 585
Iterating global reduction 2 with 3 rules applied. Total rules applied 779 place count 782 transition count 585
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 782 place count 779 transition count 582
Iterating global reduction 2 with 3 rules applied. Total rules applied 785 place count 779 transition count 582
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 788 place count 776 transition count 579
Iterating global reduction 2 with 3 rules applied. Total rules applied 791 place count 776 transition count 579
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 794 place count 773 transition count 576
Iterating global reduction 2 with 3 rules applied. Total rules applied 797 place count 773 transition count 576
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 800 place count 770 transition count 573
Iterating global reduction 2 with 3 rules applied. Total rules applied 803 place count 770 transition count 573
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 806 place count 767 transition count 570
Iterating global reduction 2 with 3 rules applied. Total rules applied 809 place count 767 transition count 570
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 812 place count 764 transition count 567
Iterating global reduction 2 with 3 rules applied. Total rules applied 815 place count 764 transition count 567
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 818 place count 761 transition count 564
Iterating global reduction 2 with 3 rules applied. Total rules applied 821 place count 761 transition count 564
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 824 place count 758 transition count 561
Iterating global reduction 2 with 3 rules applied. Total rules applied 827 place count 758 transition count 561
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 830 place count 755 transition count 558
Iterating global reduction 2 with 3 rules applied. Total rules applied 833 place count 755 transition count 558
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 836 place count 752 transition count 555
Iterating global reduction 2 with 3 rules applied. Total rules applied 839 place count 752 transition count 555
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 842 place count 749 transition count 552
Iterating global reduction 2 with 3 rules applied. Total rules applied 845 place count 749 transition count 552
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 847 place count 747 transition count 550
Iterating global reduction 2 with 2 rules applied. Total rules applied 849 place count 747 transition count 550
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 851 place count 745 transition count 548
Iterating global reduction 2 with 2 rules applied. Total rules applied 853 place count 745 transition count 548
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 855 place count 743 transition count 546
Iterating global reduction 2 with 2 rules applied. Total rules applied 857 place count 743 transition count 546
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 859 place count 741 transition count 544
Iterating global reduction 2 with 2 rules applied. Total rules applied 861 place count 741 transition count 544
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 863 place count 739 transition count 542
Iterating global reduction 2 with 2 rules applied. Total rules applied 865 place count 739 transition count 542
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 867 place count 737 transition count 540
Iterating global reduction 2 with 2 rules applied. Total rules applied 869 place count 737 transition count 540
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 871 place count 735 transition count 538
Iterating global reduction 2 with 2 rules applied. Total rules applied 873 place count 735 transition count 538
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 875 place count 733 transition count 536
Iterating global reduction 2 with 2 rules applied. Total rules applied 877 place count 733 transition count 536
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 879 place count 731 transition count 534
Iterating global reduction 2 with 2 rules applied. Total rules applied 881 place count 731 transition count 534
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 883 place count 729 transition count 532
Iterating global reduction 2 with 2 rules applied. Total rules applied 885 place count 729 transition count 532
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 887 place count 727 transition count 530
Iterating global reduction 2 with 2 rules applied. Total rules applied 889 place count 727 transition count 530
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 891 place count 725 transition count 528
Iterating global reduction 2 with 2 rules applied. Total rules applied 893 place count 725 transition count 528
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 894 place count 725 transition count 527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 895 place count 724 transition count 527
Applied a total of 895 rules in 564 ms. Remains 724 /1177 variables (removed 453) and now considering 527/981 (removed 454) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 565 ms. Remains : 724/1177 places, 527/981 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Finished Best-First random walk after 6630 steps, including 1 resets, run visited all 2 properties in 43 ms. (steps per millisecond=154 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 1177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1177/1177 places, 981/981 transitions.
Applied a total of 0 rules in 59 ms. Remains 1177 /1177 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2024-05-21 14:33:39] [INFO ] Invariant cache hit.
[2024-05-21 14:33:41] [INFO ] Implicit Places using invariants in 1421 ms returned []
[2024-05-21 14:33:41] [INFO ] Invariant cache hit.
[2024-05-21 14:33:42] [INFO ] State equation strengthened by 301 read => feed constraints.
[2024-05-21 14:33:53] [INFO ] Implicit Places using invariants and state equation in 12394 ms returned []
Implicit Place search using SMT with State Equation took 13824 ms to find 0 implicit places.
[2024-05-21 14:33:53] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-21 14:33:53] [INFO ] Invariant cache hit.
[2024-05-21 14:33:54] [INFO ] Dead Transitions using invariants and state equation in 1272 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15180 ms. Remains : 1177/1177 places, 981/981 transitions.
Computed a total of 77 stabilizing places and 5 stable transitions
Computed a total of 77 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 175338 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175338 steps, saw 83981 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-21 14:33:58] [INFO ] Invariant cache hit.
[2024-05-21 14:33:59] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 14:33:59] [INFO ] [Nat]Absence check using 292 positive place invariants in 121 ms returned sat
[2024-05-21 14:34:00] [INFO ] After 1052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 14:34:00] [INFO ] State equation strengthened by 301 read => feed constraints.
[2024-05-21 14:34:00] [INFO ] After 325ms SMT Verify possible using 301 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 14:34:01] [INFO ] After 796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 309 ms.
[2024-05-21 14:34:01] [INFO ] After 2673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 192 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=24 )
Parikh walk visited 3 properties in 45 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 437 reset in 1906 ms.
Product exploration explored 100000 steps with 437 reset in 1862 ms.
Built C files in :
/tmp/ltsmin7765058320885826119
[2024-05-21 14:34:06] [INFO ] Computing symmetric may disable matrix : 981 transitions.
[2024-05-21 14:34:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:34:06] [INFO ] Computing symmetric may enable matrix : 981 transitions.
[2024-05-21 14:34:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:34:06] [INFO ] Computing Do-Not-Accords matrix : 981 transitions.
[2024-05-21 14:34:06] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:34:06] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7765058320885826119
Running compilation step : cd /tmp/ltsmin7765058320885826119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7765058320885826119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7765058320885826119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 1177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1177/1177 places, 981/981 transitions.
Applied a total of 0 rules in 53 ms. Remains 1177 /1177 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2024-05-21 14:34:09] [INFO ] Invariant cache hit.
[2024-05-21 14:34:10] [INFO ] Implicit Places using invariants in 1415 ms returned []
[2024-05-21 14:34:10] [INFO ] Invariant cache hit.
[2024-05-21 14:34:11] [INFO ] State equation strengthened by 301 read => feed constraints.
[2024-05-21 14:34:21] [INFO ] Implicit Places using invariants and state equation in 11043 ms returned []
Implicit Place search using SMT with State Equation took 12471 ms to find 0 implicit places.
[2024-05-21 14:34:21] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-21 14:34:21] [INFO ] Invariant cache hit.
[2024-05-21 14:34:23] [INFO ] Dead Transitions using invariants and state equation in 1268 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13815 ms. Remains : 1177/1177 places, 981/981 transitions.
Built C files in :
/tmp/ltsmin15248017555880867884
[2024-05-21 14:34:23] [INFO ] Computing symmetric may disable matrix : 981 transitions.
[2024-05-21 14:34:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:34:23] [INFO ] Computing symmetric may enable matrix : 981 transitions.
[2024-05-21 14:34:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:34:23] [INFO ] Computing Do-Not-Accords matrix : 981 transitions.
[2024-05-21 14:34:23] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:34:23] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15248017555880867884
Running compilation step : cd /tmp/ltsmin15248017555880867884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15248017555880867884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15248017555880867884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 14:34:26] [INFO ] Flatten gal took : 65 ms
[2024-05-21 14:34:26] [INFO ] Flatten gal took : 50 ms
[2024-05-21 14:34:26] [INFO ] Time to serialize gal into /tmp/LTL5859517300584391661.gal : 6 ms
[2024-05-21 14:34:26] [INFO ] Time to serialize properties into /tmp/LTL9761984280718744890.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5859517300584391661.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15367810967964509290.hoa' '-atoms' '/tmp/LTL9761984280718744890.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/LTL9761984280718744890.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15367810967964509290.hoa
Detected timeout of ITS tools.
[2024-05-21 14:34:41] [INFO ] Flatten gal took : 39 ms
[2024-05-21 14:34:41] [INFO ] Flatten gal took : 40 ms
[2024-05-21 14:34:41] [INFO ] Time to serialize gal into /tmp/LTL12495857270540650627.gal : 5 ms
[2024-05-21 14:34:41] [INFO ] Time to serialize properties into /tmp/LTL16778344467906524716.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/LTL12495857270540650627.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16778344467906524716.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...277
Read 1 LTL properties
Checking formula 0 : !((G((F(("((p1130==0)||(p6895==1))")||(G("(p3917==1)"))))||(G("((p3917==0)||((p5524==0)&&(p4442==1)))")))))
Formula 0 simplified : F(G(!"((p1130==0)||(p6895==1))" & F!"(p3917==1)") & F!"((p3917==0)||((p5524==0)&&(p4442==1)))")
Detected timeout of ITS tools.
[2024-05-21 14:34:56] [INFO ] Flatten gal took : 41 ms
[2024-05-21 14:34:56] [INFO ] Applying decomposition
[2024-05-21 14:34:56] [INFO ] Flatten gal took : 41 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/graph8950154339401886568.txt' '-o' '/tmp/graph8950154339401886568.bin' '-w' '/tmp/graph8950154339401886568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8950154339401886568.bin' '-l' '-1' '-v' '-w' '/tmp/graph8950154339401886568.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:34:57] [INFO ] Decomposing Gal with order
[2024-05-21 14:34:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:34:57] [INFO ] Removed a total of 356 redundant transitions.
[2024-05-21 14:34:57] [INFO ] Flatten gal took : 96 ms
[2024-05-21 14:34:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 165 ms.
[2024-05-21 14:34:57] [INFO ] Time to serialize gal into /tmp/LTL3290209940370003646.gal : 27 ms
[2024-05-21 14:34:57] [INFO ] Time to serialize properties into /tmp/LTL1254078685970495295.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/LTL3290209940370003646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1254078685970495295.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(("((i2.i1.i0.u55.p1130==0)||(u437.p6895==1))")||(G("(i30.u231.p3917==1)"))))||(G("((i30.u231.p3917==0)||((i6.i0.i0.u305.p5524=...183
Formula 0 simplified : F(G(!"((i2.i1.i0.u55.p1130==0)||(u437.p6895==1))" & F!"(i30.u231.p3917==1)") & F!"((i30.u231.p3917==0)||((i6.i0.i0.u305.p5524==0)&&(...173
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13038331635076632013
[2024-05-21 14:35:12] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13038331635076632013
Running compilation step : cd /tmp/ltsmin13038331635076632013;'/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 2761 ms.
Running link step : cd /tmp/ltsmin13038331635076632013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13038331635076632013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(([]((LTLAPp1==true))||(LTLAPp0==true)))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-96b-LTLCardinality-10 finished in 152760 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 U (F(G((p2 U X(!p0))))||p1)))))'
Support contains 7 out of 6265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6259 transition count 6089
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6259 transition count 6089
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 6255 transition count 6085
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 6255 transition count 6085
Applied a total of 20 rules in 4696 ms. Remains 6255 /6265 variables (removed 10) and now considering 6085/6095 (removed 10) transitions.
// Phase 1: matrix 6085 rows 6255 cols
[2024-05-21 14:35:32] [INFO ] Computed 514 invariants in 44 ms
[2024-05-21 14:35:33] [INFO ] Implicit Places using invariants in 1109 ms returned []
[2024-05-21 14:35:33] [INFO ] Invariant cache hit.
[2024-05-21 14:35:34] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 2158 ms to find 0 implicit places.
[2024-05-21 14:35:34] [INFO ] Invariant cache hit.
[2024-05-21 14:35:35] [INFO ] Dead Transitions using invariants and state equation in 1200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6255/6265 places, 6085/6095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8064 ms. Remains : 6255/6265 places, 6085/6095 transitions.
Stuttering acceptance computed with spot in 424 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={0} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (EQ s591 0) (EQ s4736 1)), p0:(OR (EQ s737 0) (EQ s889 1)), p2:(AND (EQ s3949 1) (OR (EQ s575 0) (EQ s169 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 26 reset in 1082 ms.
Product exploration explored 100000 steps with 26 reset in 1156 ms.
Computed a total of 1578 stabilizing places and 1578 stable transitions
Computed a total of 1578 stabilizing places and 1578 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 351 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 467 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 14:35:40] [INFO ] Invariant cache hit.
[2024-05-21 14:35:42] [INFO ] After 2225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 14:35:46] [INFO ] [Nat]Absence check using 513 positive place invariants in 1130 ms returned sat
[2024-05-21 14:35:46] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 55 ms returned sat
[2024-05-21 14:35:57] [INFO ] After 10779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 14:36:03] [INFO ] Deduced a trap composed of 981 places in 5250 ms of which 5 ms to minimize.
[2024-05-21 14:36:09] [INFO ] Deduced a trap composed of 210 places in 5554 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 14:36:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-21 14:36:09] [INFO ] After 26388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 955 ms.
Support contains 7 out of 6255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6255/6255 places, 6085/6085 transitions.
Drop transitions removed 2537 transitions
Trivial Post-agglo rules discarded 2537 transitions
Performed 2537 trivial Post agglomeration. Transition count delta: 2537
Iterating post reduction 0 with 2537 rules applied. Total rules applied 2537 place count 6255 transition count 3548
Reduce places removed 2537 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2825 rules applied. Total rules applied 5362 place count 3718 transition count 3260
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5555 place count 3526 transition count 3259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5556 place count 3525 transition count 3259
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 5556 place count 3525 transition count 2558
Deduced a syphon composed of 701 places in 60 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 4 with 1402 rules applied. Total rules applied 6958 place count 2824 transition count 2558
Performed 1140 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1140 places in 1 ms
Reduce places removed 1140 places and 0 transitions.
Iterating global reduction 4 with 2280 rules applied. Total rules applied 9238 place count 1684 transition count 1276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 9240 place count 1684 transition count 1274
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 287 times.
Iterating global reduction 5 with 287 rules applied. Total rules applied 9527 place count 1684 transition count 987
Reduce places removed 287 places and 0 transitions.
Iterating post reduction 5 with 287 rules applied. Total rules applied 9814 place count 1397 transition count 987
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 9815 place count 1396 transition count 986
Reduce places removed 165 places and 0 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 6 with 247 rules applied. Total rules applied 10062 place count 1231 transition count 904
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 7 with 82 rules applied. Total rules applied 10144 place count 1149 transition count 904
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 83 Pre rules applied. Total rules applied 10144 place count 1149 transition count 821
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 8 with 166 rules applied. Total rules applied 10310 place count 1066 transition count 821
Applied a total of 10310 rules in 1421 ms. Remains 1066 /6255 variables (removed 5189) and now considering 821/6085 (removed 5264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1421 ms. Remains : 1066/6255 places, 821/6085 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 821 rows 1066 cols
[2024-05-21 14:36:12] [INFO ] Computed 349 invariants in 5 ms
[2024-05-21 14:36:12] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 14:36:13] [INFO ] [Nat]Absence check using 347 positive place invariants in 111 ms returned sat
[2024-05-21 14:36:13] [INFO ] [Nat]Absence check using 347 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 14:36:13] [INFO ] After 776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 14:36:14] [INFO ] State equation strengthened by 599 read => feed constraints.
[2024-05-21 14:36:14] [INFO ] After 345ms SMT Verify possible using 599 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 14:36:14] [INFO ] Deduced a trap composed of 647 places in 531 ms of which 3 ms to minimize.
[2024-05-21 14:36:15] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-21 14:36:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 744 ms
[2024-05-21 14:36:15] [INFO ] After 1208ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-21 14:36:15] [INFO ] After 2494ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 7 out of 1066 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1066/1066 places, 821/821 transitions.
Applied a total of 0 rules in 71 ms. Remains 1066 /1066 variables (removed 0) and now considering 821/821 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1066/1066 places, 821/821 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Finished probabilistic random walk after 55819 steps, run visited all 1 properties in 1451 ms. (steps per millisecond=38 )
Probabilistic random walk after 55819 steps, saw 14129 distinct states, run finished after 1456 ms. (steps per millisecond=38 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p2), (F (AND p0 (NOT p1) p2)), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND p0 p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 949 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 6255 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6255/6255 places, 6085/6085 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2536 transitions
Trivial Post-agglo rules discarded 2536 transitions
Performed 2536 trivial Post agglomeration. Transition count delta: 2536
Iterating post reduction 0 with 2536 rules applied. Total rules applied 2536 place count 6254 transition count 3548
Reduce places removed 2536 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2824 rules applied. Total rules applied 5360 place count 3718 transition count 3260
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5553 place count 3526 transition count 3259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5554 place count 3525 transition count 3259
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 5554 place count 3525 transition count 2558
Deduced a syphon composed of 701 places in 60 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 4 with 1402 rules applied. Total rules applied 6956 place count 2824 transition count 2558
Performed 1140 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1140 places in 3 ms
Reduce places removed 1140 places and 0 transitions.
Iterating global reduction 4 with 2280 rules applied. Total rules applied 9236 place count 1684 transition count 1276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 9238 place count 1684 transition count 1274
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9239 place count 1683 transition count 1273
Reduce places removed 165 places and 0 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 5 with 247 rules applied. Total rules applied 9486 place count 1518 transition count 1191
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 6 with 82 rules applied. Total rules applied 9568 place count 1436 transition count 1191
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 83 Pre rules applied. Total rules applied 9568 place count 1436 transition count 1108
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 7 with 166 rules applied. Total rules applied 9734 place count 1353 transition count 1108
Applied a total of 9734 rules in 1307 ms. Remains 1353 /6255 variables (removed 4902) and now considering 1108/6085 (removed 4977) transitions.
// Phase 1: matrix 1108 rows 1353 cols
[2024-05-21 14:36:19] [INFO ] Computed 349 invariants in 6 ms
[2024-05-21 14:36:21] [INFO ] Implicit Places using invariants in 1703 ms returned [537, 611, 725, 763, 837, 911, 949, 987, 993, 1000, 1006, 1012, 1018, 1024, 1030, 1036, 1042, 1048, 1054, 1060, 1066, 1071, 1075, 1079, 1083, 1087, 1091, 1095, 1099, 1103, 1107, 1111, 1115, 1119, 1123, 1127, 1131, 1135, 1139, 1143, 1147, 1151, 1155, 1159, 1163, 1167, 1171, 1175, 1179, 1183, 1187, 1191, 1195, 1199, 1203, 1207, 1209, 1211, 1213, 1215, 1217, 1219, 1221, 1223, 1225, 1227, 1229, 1231, 1235, 1239, 1243, 1247, 1251, 1255, 1259, 1263, 1267, 1271, 1275, 1279, 1281, 1283, 1285, 1287, 1289, 1291, 1293, 1295, 1297, 1299, 1301, 1303, 1307, 1311, 1315, 1319, 1323, 1327, 1331, 1335, 1339, 1343, 1347, 1352]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1710 ms to find 104 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/6255 places, 1108/6085 transitions.
Graph (trivial) has 493 edges and 1249 vertex of which 25 / 1249 are part of one of the 1 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 79 place count 1147 transition count 983
Iterating global reduction 0 with 78 rules applied. Total rules applied 157 place count 1147 transition count 983
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 160 place count 1144 transition count 980
Iterating global reduction 0 with 3 rules applied. Total rules applied 163 place count 1144 transition count 980
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 166 place count 1141 transition count 977
Iterating global reduction 0 with 3 rules applied. Total rules applied 169 place count 1141 transition count 977
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 172 place count 1138 transition count 974
Iterating global reduction 0 with 3 rules applied. Total rules applied 175 place count 1138 transition count 974
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 178 place count 1135 transition count 971
Iterating global reduction 0 with 3 rules applied. Total rules applied 181 place count 1135 transition count 971
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 184 place count 1132 transition count 968
Iterating global reduction 0 with 3 rules applied. Total rules applied 187 place count 1132 transition count 968
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 190 place count 1129 transition count 965
Iterating global reduction 0 with 3 rules applied. Total rules applied 193 place count 1129 transition count 965
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 196 place count 1126 transition count 962
Iterating global reduction 0 with 3 rules applied. Total rules applied 199 place count 1126 transition count 962
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 202 place count 1123 transition count 959
Iterating global reduction 0 with 3 rules applied. Total rules applied 205 place count 1123 transition count 959
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 208 place count 1120 transition count 956
Iterating global reduction 0 with 3 rules applied. Total rules applied 211 place count 1120 transition count 956
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 214 place count 1117 transition count 953
Iterating global reduction 0 with 3 rules applied. Total rules applied 217 place count 1117 transition count 953
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 220 place count 1114 transition count 950
Iterating global reduction 0 with 3 rules applied. Total rules applied 223 place count 1114 transition count 950
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 226 place count 1111 transition count 947
Iterating global reduction 0 with 3 rules applied. Total rules applied 229 place count 1111 transition count 947
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 231 place count 1109 transition count 945
Iterating global reduction 0 with 2 rules applied. Total rules applied 233 place count 1109 transition count 945
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 235 place count 1107 transition count 943
Iterating global reduction 0 with 2 rules applied. Total rules applied 237 place count 1107 transition count 943
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 239 place count 1105 transition count 941
Iterating global reduction 0 with 2 rules applied. Total rules applied 241 place count 1105 transition count 941
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 243 place count 1103 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 245 place count 1103 transition count 939
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 247 place count 1101 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 249 place count 1101 transition count 937
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 251 place count 1099 transition count 935
Iterating global reduction 0 with 2 rules applied. Total rules applied 253 place count 1099 transition count 935
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 255 place count 1097 transition count 933
Iterating global reduction 0 with 2 rules applied. Total rules applied 257 place count 1097 transition count 933
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 259 place count 1095 transition count 931
Iterating global reduction 0 with 2 rules applied. Total rules applied 261 place count 1095 transition count 931
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 263 place count 1093 transition count 929
Iterating global reduction 0 with 2 rules applied. Total rules applied 265 place count 1093 transition count 929
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 267 place count 1091 transition count 927
Iterating global reduction 0 with 2 rules applied. Total rules applied 269 place count 1091 transition count 927
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 271 place count 1089 transition count 925
Iterating global reduction 0 with 2 rules applied. Total rules applied 273 place count 1089 transition count 925
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 275 place count 1087 transition count 923
Iterating global reduction 0 with 2 rules applied. Total rules applied 277 place count 1087 transition count 923
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 281 place count 1085 transition count 921
Applied a total of 281 rules in 1144 ms. Remains 1085 /1249 variables (removed 164) and now considering 921/1108 (removed 187) transitions.
// Phase 1: matrix 921 rows 1085 cols
[2024-05-21 14:36:22] [INFO ] Computed 245 invariants in 7 ms
[2024-05-21 14:36:23] [INFO ] Implicit Places using invariants in 1285 ms returned []
[2024-05-21 14:36:23] [INFO ] Invariant cache hit.
[2024-05-21 14:36:24] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-05-21 14:36:32] [INFO ] Implicit Places using invariants and state equation in 9171 ms returned [510, 512, 514, 516, 518, 520, 522, 524, 526, 528, 530, 532, 534]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 10460 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1072/6255 places, 921/6085 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 1072 transition count 908
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 1059 transition count 908
Applied a total of 26 rules in 46 ms. Remains 1059 /1072 variables (removed 13) and now considering 908/921 (removed 13) transitions.
// Phase 1: matrix 908 rows 1059 cols
[2024-05-21 14:36:32] [INFO ] Computed 232 invariants in 7 ms
[2024-05-21 14:36:33] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2024-05-21 14:36:33] [INFO ] Invariant cache hit.
[2024-05-21 14:36:34] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-21 14:36:43] [INFO ] Implicit Places using invariants and state equation in 9705 ms returned []
Implicit Place search using SMT with State Equation took 10825 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1059/6255 places, 908/6085 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 25494 ms. Remains : 1059/6255 places, 908/6085 transitions.
Computed a total of 18 stabilizing places and 4 stable transitions
Computed a total of 18 stabilizing places and 4 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 237903 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237903 steps, saw 89754 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 14:36:47] [INFO ] Invariant cache hit.
[2024-05-21 14:36:47] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 14:36:47] [INFO ] [Nat]Absence check using 232 positive place invariants in 110 ms returned sat
[2024-05-21 14:36:48] [INFO ] After 797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 14:36:48] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-21 14:36:48] [INFO ] After 244ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 14:36:49] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 1 ms to minimize.
[2024-05-21 14:36:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2024-05-21 14:36:49] [INFO ] After 679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-21 14:36:49] [INFO ] After 1900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 1059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1059/1059 places, 908/908 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1059 transition count 905
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 1057 transition count 905
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 1054 transition count 902
Free-agglomeration rule applied 367 times.
Iterating global reduction 2 with 367 rules applied. Total rules applied 378 place count 1054 transition count 535
Reduce places removed 367 places and 0 transitions.
Iterating post reduction 2 with 367 rules applied. Total rules applied 745 place count 687 transition count 535
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 748 place count 684 transition count 532
Iterating global reduction 3 with 3 rules applied. Total rules applied 751 place count 684 transition count 532
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 754 place count 681 transition count 529
Iterating global reduction 3 with 3 rules applied. Total rules applied 757 place count 681 transition count 529
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 760 place count 678 transition count 526
Iterating global reduction 3 with 3 rules applied. Total rules applied 763 place count 678 transition count 526
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 766 place count 675 transition count 523
Iterating global reduction 3 with 3 rules applied. Total rules applied 769 place count 675 transition count 523
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 772 place count 672 transition count 520
Iterating global reduction 3 with 3 rules applied. Total rules applied 775 place count 672 transition count 520
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 778 place count 669 transition count 517
Iterating global reduction 3 with 3 rules applied. Total rules applied 781 place count 669 transition count 517
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 784 place count 666 transition count 514
Iterating global reduction 3 with 3 rules applied. Total rules applied 787 place count 666 transition count 514
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 789 place count 664 transition count 512
Iterating global reduction 3 with 2 rules applied. Total rules applied 791 place count 664 transition count 512
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 793 place count 662 transition count 510
Iterating global reduction 3 with 2 rules applied. Total rules applied 795 place count 662 transition count 510
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 797 place count 660 transition count 508
Iterating global reduction 3 with 2 rules applied. Total rules applied 799 place count 660 transition count 508
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 801 place count 658 transition count 506
Iterating global reduction 3 with 2 rules applied. Total rules applied 803 place count 658 transition count 506
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 805 place count 656 transition count 504
Iterating global reduction 3 with 2 rules applied. Total rules applied 807 place count 656 transition count 504
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 808 place count 655 transition count 503
Iterating global reduction 3 with 1 rules applied. Total rules applied 809 place count 655 transition count 503
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 810 place count 654 transition count 502
Iterating global reduction 3 with 1 rules applied. Total rules applied 811 place count 654 transition count 502
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 812 place count 653 transition count 501
Iterating global reduction 3 with 1 rules applied. Total rules applied 813 place count 653 transition count 501
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 814 place count 652 transition count 500
Iterating global reduction 3 with 1 rules applied. Total rules applied 815 place count 652 transition count 500
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 816 place count 651 transition count 499
Iterating global reduction 3 with 1 rules applied. Total rules applied 817 place count 651 transition count 499
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 818 place count 650 transition count 498
Iterating global reduction 3 with 1 rules applied. Total rules applied 819 place count 650 transition count 498
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 820 place count 649 transition count 497
Iterating global reduction 3 with 1 rules applied. Total rules applied 821 place count 649 transition count 497
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 822 place count 648 transition count 496
Iterating global reduction 3 with 1 rules applied. Total rules applied 823 place count 648 transition count 496
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 824 place count 647 transition count 495
Iterating global reduction 3 with 1 rules applied. Total rules applied 825 place count 647 transition count 495
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 826 place count 646 transition count 494
Iterating global reduction 3 with 1 rules applied. Total rules applied 827 place count 646 transition count 494
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 828 place count 645 transition count 493
Iterating global reduction 3 with 1 rules applied. Total rules applied 829 place count 645 transition count 493
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 830 place count 644 transition count 492
Iterating global reduction 3 with 1 rules applied. Total rules applied 831 place count 644 transition count 492
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 832 place count 644 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 833 place count 643 transition count 491
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 834 place count 643 transition count 491
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 835 place count 642 transition count 490
Iterating global reduction 4 with 1 rules applied. Total rules applied 836 place count 642 transition count 490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 837 place count 641 transition count 489
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t201.t1251.t724 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 479 edges and 411 vertex of which 259 / 411 are part of one of the 1 SCC in 1 ms
Free SCC test removed 258 places
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 4 with 144 rules applied. Total rules applied 981 place count 153 transition count 346
Reduce places removed 142 places and 0 transitions.
Drop transitions removed 334 transitions
Reduce isomorphic transitions removed 334 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 477 rules applied. Total rules applied 1458 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1459 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1459 place count 10 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1461 place count 9 transition count 10
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 7 with 2 rules applied. Total rules applied 1463 place count 8 transition count 9
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1466 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1469 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1470 place count 5 transition count 5
Applied a total of 1470 rules in 683 ms. Remains 5 /1059 variables (removed 1054) and now considering 5/908 (removed 903) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 683 ms. Remains : 5/1059 places, 5/908 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 141 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 99 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 437 reset in 1762 ms.
Product exploration explored 100000 steps with 440 reset in 1712 ms.
Built C files in :
/tmp/ltsmin9368252785154892978
[2024-05-21 14:36:53] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2024-05-21 14:36:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:36:53] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2024-05-21 14:36:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:36:54] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2024-05-21 14:36:54] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:36:54] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9368252785154892978
Running compilation step : cd /tmp/ltsmin9368252785154892978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9368252785154892978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9368252785154892978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1059 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1059/1059 places, 908/908 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1056 transition count 904
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 1054 transition count 904
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 1052 transition count 902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 1050 transition count 900
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 26 rules applied. Total rules applied 37 place count 1037 transition count 887
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 50 place count 1024 transition count 887
Applied a total of 50 rules in 120 ms. Remains 1024 /1059 variables (removed 35) and now considering 887/908 (removed 21) transitions.
// Phase 1: matrix 887 rows 1024 cols
[2024-05-21 14:36:57] [INFO ] Computed 218 invariants in 4 ms
[2024-05-21 14:36:58] [INFO ] Implicit Places using invariants in 1018 ms returned [649]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1020 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1023/1059 places, 887/908 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1022 transition count 886
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1022 transition count 886
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1021 transition count 885
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1021 transition count 885
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1020 transition count 884
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1020 transition count 884
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1019 transition count 883
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1019 transition count 883
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1018 transition count 882
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1018 transition count 882
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1017 transition count 881
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1017 transition count 881
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1016 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1016 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1015 transition count 879
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1015 transition count 879
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1014 transition count 878
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1014 transition count 878
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1013 transition count 877
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1013 transition count 877
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1012 transition count 876
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1012 transition count 876
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1011 transition count 875
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1011 transition count 875
Applied a total of 24 rules in 420 ms. Remains 1011 /1023 variables (removed 12) and now considering 875/887 (removed 12) transitions.
// Phase 1: matrix 875 rows 1011 cols
[2024-05-21 14:36:58] [INFO ] Computed 217 invariants in 5 ms
[2024-05-21 14:36:59] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2024-05-21 14:36:59] [INFO ] Invariant cache hit.
[2024-05-21 14:37:02] [INFO ] Implicit Places using invariants and state equation in 2810 ms returned []
Implicit Place search using SMT with State Equation took 3906 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1011/1059 places, 875/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5467 ms. Remains : 1011/1059 places, 875/908 transitions.
Built C files in :
/tmp/ltsmin439810175628117680
[2024-05-21 14:37:02] [INFO ] Computing symmetric may disable matrix : 875 transitions.
[2024-05-21 14:37:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:37:02] [INFO ] Computing symmetric may enable matrix : 875 transitions.
[2024-05-21 14:37:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:37:02] [INFO ] Computing Do-Not-Accords matrix : 875 transitions.
[2024-05-21 14:37:02] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:37:02] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin439810175628117680
Running compilation step : cd /tmp/ltsmin439810175628117680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin439810175628117680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin439810175628117680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 14:37:05] [INFO ] Flatten gal took : 21 ms
[2024-05-21 14:37:05] [INFO ] Flatten gal took : 21 ms
[2024-05-21 14:37:05] [INFO ] Time to serialize gal into /tmp/LTL4720233593553607546.gal : 5 ms
[2024-05-21 14:37:05] [INFO ] Time to serialize properties into /tmp/LTL5749712072384029218.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4720233593553607546.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2181257668904373464.hoa' '-atoms' '/tmp/LTL5749712072384029218.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5749712072384029218.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2181257668904373464.hoa
Detected timeout of ITS tools.
[2024-05-21 14:37:20] [INFO ] Flatten gal took : 26 ms
[2024-05-21 14:37:21] [INFO ] Flatten gal took : 26 ms
[2024-05-21 14:37:21] [INFO ] Time to serialize gal into /tmp/LTL16586653392689729531.gal : 4 ms
[2024-05-21 14:37:21] [INFO ] Time to serialize properties into /tmp/LTL13707374622048972583.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/LTL16586653392689729531.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13707374622048972583.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...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p963==0)||(p1216==1))")U(("((p713==0)||(p6280==1))")||(F(G(("((p5487==1)&&((p690==0)||(p169==1)))")U(X(!("((p963==0)||(p121...173
Formula 0 simplified : XF(!"((p963==0)||(p1216==1))" R (!"((p713==0)||(p6280==1))" & GF(!"((p5487==1)&&((p690==0)||(p169==1)))" R X"((p963==0)||(p1216==1))...159
Detected timeout of ITS tools.
[2024-05-21 14:37:36] [INFO ] Flatten gal took : 27 ms
[2024-05-21 14:37:36] [INFO ] Applying decomposition
[2024-05-21 14:37:36] [INFO ] Flatten gal took : 26 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/graph17045895867199516734.txt' '-o' '/tmp/graph17045895867199516734.bin' '-w' '/tmp/graph17045895867199516734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17045895867199516734.bin' '-l' '-1' '-v' '-w' '/tmp/graph17045895867199516734.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:37:36] [INFO ] Decomposing Gal with order
[2024-05-21 14:37:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:37:36] [INFO ] Removed a total of 35 redundant transitions.
[2024-05-21 14:37:36] [INFO ] Flatten gal took : 52 ms
[2024-05-21 14:37:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-21 14:37:36] [INFO ] Time to serialize gal into /tmp/LTL9369525765171700596.gal : 15 ms
[2024-05-21 14:37:36] [INFO ] Time to serialize properties into /tmp/LTL14334368663098503737.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/LTL9369525765171700596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14334368663098503737.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i1.u43.p963==0)||(i3.i0.i1.u63.p1216==1))")U(("((i14.i1.i2.u24.p713==0)||(i25.i0.i1.u385.p6280==1))")||(F(G(("((i20.i1.i1.u...283
Formula 0 simplified : XF(!"((i1.u43.p963==0)||(i3.i0.i1.u63.p1216==1))" R (!"((i14.i1.i2.u24.p713==0)||(i25.i0.i1.u385.p6280==1))" & GF(!"((i20.i1.i1.u287...269
Reverse transition relation is NOT exact ! Due to transitions t37, t49, t1072, i0.i1.i0.u22.t681, i1.u43.t724, i12.i0.i1.u0.t2, i14.i1.i2.u24.t0, Intersec...245
Computing Next relation with stutter on 1.41671e+24 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10082613665319450452
[2024-05-21 14:37:51] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10082613665319450452
Running compilation step : cd /tmp/ltsmin10082613665319450452;'/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 2800 ms.
Running link step : cd /tmp/ltsmin10082613665319450452;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10082613665319450452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true) U (<>([](((LTLAPp2==true) U X(!(LTLAPp0==true)))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-96b-LTLCardinality-11 finished in 158851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(!p0))&&X(p1)))'
Support contains 3 out of 6265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6258 transition count 6088
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6258 transition count 6088
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 6254 transition count 6084
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 6254 transition count 6084
Applied a total of 22 rules in 4867 ms. Remains 6254 /6265 variables (removed 11) and now considering 6084/6095 (removed 11) transitions.
// Phase 1: matrix 6084 rows 6254 cols
[2024-05-21 14:38:11] [INFO ] Computed 514 invariants in 64 ms
[2024-05-21 14:38:12] [INFO ] Implicit Places using invariants in 1166 ms returned []
[2024-05-21 14:38:12] [INFO ] Invariant cache hit.
[2024-05-21 14:38:13] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 2309 ms to find 0 implicit places.
[2024-05-21 14:38:13] [INFO ] Invariant cache hit.
[2024-05-21 14:38:14] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6254/6265 places, 6084/6095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8152 ms. Remains : 6254/6265 places, 6084/6095 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) p0), p0, p0, (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s5413 0) (EQ s108 1)), p1:(EQ s5900 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-96b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLCardinality-13 finished in 8451 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 6265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6259 transition count 6089
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6259 transition count 6089
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 6256 transition count 6086
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 6256 transition count 6086
Applied a total of 18 rules in 4584 ms. Remains 6256 /6265 variables (removed 9) and now considering 6086/6095 (removed 9) transitions.
// Phase 1: matrix 6086 rows 6256 cols
[2024-05-21 14:38:19] [INFO ] Computed 514 invariants in 65 ms
[2024-05-21 14:38:20] [INFO ] Implicit Places using invariants in 1258 ms returned []
[2024-05-21 14:38:20] [INFO ] Invariant cache hit.
[2024-05-21 14:38:21] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
[2024-05-21 14:38:21] [INFO ] Invariant cache hit.
[2024-05-21 14:38:22] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6256/6265 places, 6086/6095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7974 ms. Remains : 6256/6265 places, 6086/6095 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-15 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 s2936 0) (EQ s1453 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLCardinality-15 finished in 8171 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(G(p0)) U G(p1))))'
Found a Lengthening insensitive property : AutoFlight-PT-96b-LTLCardinality-02
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 3 out of 6265 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2536 transitions
Trivial Post-agglo rules discarded 2536 transitions
Performed 2536 trivial Post agglomeration. Transition count delta: 2536
Iterating post reduction 0 with 2536 rules applied. Total rules applied 2536 place count 6264 transition count 3558
Reduce places removed 2536 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2824 rules applied. Total rules applied 5360 place count 3728 transition count 3270
Reduce places removed 192 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 194 rules applied. Total rules applied 5554 place count 3536 transition count 3268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5556 place count 3534 transition count 3268
Performed 703 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 703 Pre rules applied. Total rules applied 5556 place count 3534 transition count 2565
Deduced a syphon composed of 703 places in 59 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 4 with 1406 rules applied. Total rules applied 6962 place count 2831 transition count 2565
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 6966 place count 2827 transition count 2561
Iterating global reduction 4 with 4 rules applied. Total rules applied 6970 place count 2827 transition count 2561
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 6970 place count 2827 transition count 2557
Deduced a syphon composed of 4 places in 46 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 6978 place count 2823 transition count 2557
Performed 1142 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1142 places in 1 ms
Reduce places removed 1142 places and 0 transitions.
Iterating global reduction 4 with 2284 rules applied. Total rules applied 9262 place count 1681 transition count 1271
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 9263 place count 1680 transition count 1270
Reduce places removed 190 places and 0 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 4 with 284 rules applied. Total rules applied 9547 place count 1490 transition count 1176
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 5 with 94 rules applied. Total rules applied 9641 place count 1396 transition count 1176
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9641 place count 1396 transition count 1080
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9833 place count 1300 transition count 1080
Applied a total of 9833 rules in 1883 ms. Remains 1300 /6265 variables (removed 4965) and now considering 1080/6095 (removed 5015) transitions.
// Phase 1: matrix 1080 rows 1300 cols
[2024-05-21 14:38:25] [INFO ] Computed 324 invariants in 6 ms
[2024-05-21 14:38:26] [INFO ] Implicit Places using invariants in 1395 ms returned [586, 660, 698, 736, 810, 884, 922, 960, 964, 968, 972, 976, 980, 984, 988, 992, 996, 1001, 1005, 1009, 1013, 1017, 1021, 1025, 1029, 1033, 1037, 1041, 1045, 1049, 1053, 1057, 1061, 1065, 1069, 1073, 1077, 1081, 1085, 1089, 1093, 1097, 1101, 1105, 1109, 1113, 1117, 1121, 1125, 1129, 1133, 1137, 1141, 1145, 1149, 1153, 1155, 1157, 1159, 1161, 1163, 1165, 1167, 1169, 1171, 1173, 1175, 1177, 1181, 1185, 1189, 1193, 1197, 1201, 1205, 1209, 1213, 1217, 1221, 1225, 1228, 1230, 1232, 1234, 1236, 1238, 1240, 1242, 1244, 1246, 1248, 1250, 1254, 1258, 1262, 1266, 1270, 1274, 1278, 1282, 1286, 1290, 1294, 1299]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1404 ms to find 104 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1196/6265 places, 1080/6095 transitions.
Graph (trivial) has 494 edges and 1196 vertex of which 24 / 1196 are part of one of the 1 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1094 transition count 956
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1094 transition count 956
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 162 place count 1091 transition count 953
Iterating global reduction 0 with 3 rules applied. Total rules applied 165 place count 1091 transition count 953
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 168 place count 1088 transition count 950
Iterating global reduction 0 with 3 rules applied. Total rules applied 171 place count 1088 transition count 950
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 174 place count 1085 transition count 947
Iterating global reduction 0 with 3 rules applied. Total rules applied 177 place count 1085 transition count 947
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 180 place count 1082 transition count 944
Iterating global reduction 0 with 3 rules applied. Total rules applied 183 place count 1082 transition count 944
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 186 place count 1079 transition count 941
Iterating global reduction 0 with 3 rules applied. Total rules applied 189 place count 1079 transition count 941
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 192 place count 1076 transition count 938
Iterating global reduction 0 with 3 rules applied. Total rules applied 195 place count 1076 transition count 938
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 198 place count 1073 transition count 935
Iterating global reduction 0 with 3 rules applied. Total rules applied 201 place count 1073 transition count 935
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 204 place count 1070 transition count 932
Iterating global reduction 0 with 3 rules applied. Total rules applied 207 place count 1070 transition count 932
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 210 place count 1067 transition count 929
Iterating global reduction 0 with 3 rules applied. Total rules applied 213 place count 1067 transition count 929
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 216 place count 1064 transition count 926
Iterating global reduction 0 with 3 rules applied. Total rules applied 219 place count 1064 transition count 926
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 222 place count 1061 transition count 923
Iterating global reduction 0 with 3 rules applied. Total rules applied 225 place count 1061 transition count 923
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 228 place count 1058 transition count 920
Iterating global reduction 0 with 3 rules applied. Total rules applied 231 place count 1058 transition count 920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 232 place count 1057 transition count 919
Iterating global reduction 0 with 1 rules applied. Total rules applied 233 place count 1057 transition count 919
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 234 place count 1056 transition count 918
Iterating global reduction 0 with 1 rules applied. Total rules applied 235 place count 1056 transition count 918
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 236 place count 1055 transition count 917
Iterating global reduction 0 with 1 rules applied. Total rules applied 237 place count 1055 transition count 917
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 238 place count 1054 transition count 916
Iterating global reduction 0 with 1 rules applied. Total rules applied 239 place count 1054 transition count 916
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 240 place count 1053 transition count 915
Iterating global reduction 0 with 1 rules applied. Total rules applied 241 place count 1053 transition count 915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 242 place count 1052 transition count 914
Iterating global reduction 0 with 1 rules applied. Total rules applied 243 place count 1052 transition count 914
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 244 place count 1051 transition count 913
Iterating global reduction 0 with 1 rules applied. Total rules applied 245 place count 1051 transition count 913
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 246 place count 1050 transition count 912
Iterating global reduction 0 with 1 rules applied. Total rules applied 247 place count 1050 transition count 912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 248 place count 1049 transition count 911
Iterating global reduction 0 with 1 rules applied. Total rules applied 249 place count 1049 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 250 place count 1048 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 251 place count 1048 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 252 place count 1047 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 253 place count 1047 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 254 place count 1046 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 255 place count 1046 transition count 908
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 259 place count 1044 transition count 906
Applied a total of 259 rules in 1009 ms. Remains 1044 /1196 variables (removed 152) and now considering 906/1080 (removed 174) transitions.
// Phase 1: matrix 906 rows 1044 cols
[2024-05-21 14:38:27] [INFO ] Computed 220 invariants in 7 ms
[2024-05-21 14:38:28] [INFO ] Implicit Places using invariants in 850 ms returned []
[2024-05-21 14:38:28] [INFO ] Invariant cache hit.
[2024-05-21 14:38:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 14:38:30] [INFO ] Implicit Places using invariants and state equation in 2060 ms returned []
Implicit Place search using SMT with State Equation took 2914 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1044/6265 places, 906/6095 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7211 ms. Remains : 1044/6265 places, 906/6095 transitions.
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s534 0) (EQ s584 1)), p0:(NEQ s505 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 442 reset in 1706 ms.
Product exploration explored 100000 steps with 441 reset in 1870 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 : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 14:38:35] [INFO ] Invariant cache hit.
[2024-05-21 14:38:35] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 14:38:35] [INFO ] [Nat]Absence check using 220 positive place invariants in 98 ms returned sat
[2024-05-21 14:38:36] [INFO ] After 695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 14:38:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 14:38:36] [INFO ] After 66ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 14:38:36] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-21 14:38:36] [INFO ] After 1319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 906/906 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 1044 transition count 905
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 1044 transition count 904
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 4 place count 1042 transition count 904
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 1042 transition count 903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1041 transition count 903
Free-agglomeration rule applied 368 times.
Iterating global reduction 3 with 368 rules applied. Total rules applied 374 place count 1041 transition count 535
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t640.t1254 and 3 places that fell out of Prefix Of Interest.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 525 edges and 454 vertex of which 377 / 454 are part of one of the 1 SCC in 0 ms
Free SCC test removed 376 places
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 3 with 76 rules applied. Total rules applied 450 place count 78 transition count 460
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 454 transitions
Reduce isomorphic transitions removed 454 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 526 rules applied. Total rules applied 976 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 977 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 977 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 979 place count 5 transition count 4
Applied a total of 979 rules in 127 ms. Remains 5 /1044 variables (removed 1039) and now considering 4/906 (removed 902) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 5/1044 places, 4/906 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p0)]
Support contains 3 out of 1044 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1044/1044 places, 906/906 transitions.
Applied a total of 0 rules in 59 ms. Remains 1044 /1044 variables (removed 0) and now considering 906/906 (removed 0) transitions.
[2024-05-21 14:38:37] [INFO ] Invariant cache hit.
[2024-05-21 14:38:38] [INFO ] Implicit Places using invariants in 1216 ms returned []
[2024-05-21 14:38:38] [INFO ] Invariant cache hit.
[2024-05-21 14:38:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 14:38:41] [INFO ] Implicit Places using invariants and state equation in 3014 ms returned []
Implicit Place search using SMT with State Equation took 4232 ms to find 0 implicit places.
[2024-05-21 14:38:41] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-21 14:38:41] [INFO ] Invariant cache hit.
[2024-05-21 14:38:43] [INFO ] Dead Transitions using invariants and state equation in 1266 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5581 ms. Remains : 1044/1044 places, 906/906 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 : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 14:38:44] [INFO ] Invariant cache hit.
[2024-05-21 14:38:44] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 14:38:44] [INFO ] [Nat]Absence check using 220 positive place invariants in 93 ms returned sat
[2024-05-21 14:38:45] [INFO ] After 716ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 14:38:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 14:38:45] [INFO ] After 39ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 14:38:45] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-21 14:38:45] [INFO ] After 1260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 906/906 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 1044 transition count 905
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 1044 transition count 904
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 4 place count 1042 transition count 904
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 1042 transition count 903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1041 transition count 903
Free-agglomeration rule applied 368 times.
Iterating global reduction 3 with 368 rules applied. Total rules applied 374 place count 1041 transition count 535
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t640.t1254 and 3 places that fell out of Prefix Of Interest.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 525 edges and 454 vertex of which 377 / 454 are part of one of the 1 SCC in 0 ms
Free SCC test removed 376 places
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 3 with 76 rules applied. Total rules applied 450 place count 78 transition count 460
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 454 transitions
Reduce isomorphic transitions removed 454 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 526 rules applied. Total rules applied 976 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 977 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 977 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 979 place count 5 transition count 4
Applied a total of 979 rules in 89 ms. Remains 5 /1044 variables (removed 1039) and now considering 4/906 (removed 902) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 5/1044 places, 4/906 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 238 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 444 reset in 1745 ms.
Product exploration explored 100000 steps with 441 reset in 1675 ms.
Built C files in :
/tmp/ltsmin7159830418705068142
[2024-05-21 14:38:50] [INFO ] Computing symmetric may disable matrix : 906 transitions.
[2024-05-21 14:38:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:38:50] [INFO ] Computing symmetric may enable matrix : 906 transitions.
[2024-05-21 14:38:50] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:38:50] [INFO ] Computing Do-Not-Accords matrix : 906 transitions.
[2024-05-21 14:38:50] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:38:50] [INFO ] Built C files in 171ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7159830418705068142
Running compilation step : cd /tmp/ltsmin7159830418705068142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7159830418705068142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7159830418705068142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1044 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1044/1044 places, 906/906 transitions.
Applied a total of 0 rules in 45 ms. Remains 1044 /1044 variables (removed 0) and now considering 906/906 (removed 0) transitions.
[2024-05-21 14:38:53] [INFO ] Invariant cache hit.
[2024-05-21 14:38:54] [INFO ] Implicit Places using invariants in 796 ms returned []
[2024-05-21 14:38:54] [INFO ] Invariant cache hit.
[2024-05-21 14:38:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 14:38:56] [INFO ] Implicit Places using invariants and state equation in 2212 ms returned []
Implicit Place search using SMT with State Equation took 3047 ms to find 0 implicit places.
[2024-05-21 14:38:56] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-21 14:38:56] [INFO ] Invariant cache hit.
[2024-05-21 14:38:57] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4114 ms. Remains : 1044/1044 places, 906/906 transitions.
Built C files in :
/tmp/ltsmin9379190080240336664
[2024-05-21 14:38:57] [INFO ] Computing symmetric may disable matrix : 906 transitions.
[2024-05-21 14:38:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:38:57] [INFO ] Computing symmetric may enable matrix : 906 transitions.
[2024-05-21 14:38:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:38:57] [INFO ] Computing Do-Not-Accords matrix : 906 transitions.
[2024-05-21 14:38:57] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:38:57] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9379190080240336664
Running compilation step : cd /tmp/ltsmin9379190080240336664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9379190080240336664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9379190080240336664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 14:39:00] [INFO ] Flatten gal took : 21 ms
[2024-05-21 14:39:00] [INFO ] Flatten gal took : 21 ms
[2024-05-21 14:39:00] [INFO ] Time to serialize gal into /tmp/LTL8098543834514939232.gal : 9 ms
[2024-05-21 14:39:00] [INFO ] Time to serialize properties into /tmp/LTL715434474879169097.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/LTL8098543834514939232.gal' '-t' 'CGAL' '-hoa' '/tmp/aut146925278149321137.hoa' '-atoms' '/tmp/LTL715434474879169097.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...315
Loading property file /tmp/LTL715434474879169097.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut146925278149321137.hoa
Detected timeout of ITS tools.
[2024-05-21 14:39:15] [INFO ] Flatten gal took : 21 ms
[2024-05-21 14:39:15] [INFO ] Flatten gal took : 21 ms
[2024-05-21 14:39:15] [INFO ] Time to serialize gal into /tmp/LTL16206901892838627516.gal : 4 ms
[2024-05-21 14:39:15] [INFO ] Time to serialize properties into /tmp/LTL7627598485023673417.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16206901892838627516.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7627598485023673417.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(p3376!=1)")))U(G("((p5009==0)||(p5098==1))")))))
Formula 0 simplified : X(GF!"(p3376!=1)" R F!"((p5009==0)||(p5098==1))")
Detected timeout of ITS tools.
[2024-05-21 14:39:30] [INFO ] Flatten gal took : 23 ms
[2024-05-21 14:39:30] [INFO ] Applying decomposition
[2024-05-21 14:39:30] [INFO ] Flatten gal took : 30 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/graph2674480148344844618.txt' '-o' '/tmp/graph2674480148344844618.bin' '-w' '/tmp/graph2674480148344844618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2674480148344844618.bin' '-l' '-1' '-v' '-w' '/tmp/graph2674480148344844618.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:39:30] [INFO ] Decomposing Gal with order
[2024-05-21 14:39:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:39:30] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-21 14:39:31] [INFO ] Flatten gal took : 56 ms
[2024-05-21 14:39:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-21 14:39:31] [INFO ] Time to serialize gal into /tmp/LTL2207199585444485979.gal : 11 ms
[2024-05-21 14:39:31] [INFO ] Time to serialize properties into /tmp/LTL8771668113116023203.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/LTL2207199585444485979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8771668113116023203.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 : !((X((F(G("(i0.i1.i1.u217.p3376!=1)")))U(G("((i14.u229.p5009==0)||(i3.u218.p5098==1))")))))
Formula 0 simplified : X(GF!"(i0.i1.i1.u217.p3376!=1)" R F!"((i14.u229.p5009==0)||(i3.u218.p5098==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5449597091666937353
[2024-05-21 14:39:46] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5449597091666937353
Running compilation step : cd /tmp/ltsmin5449597091666937353;'/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 2556 ms.
Running link step : cd /tmp/ltsmin5449597091666937353;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5449597091666937353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true))) U []((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-96b-LTLCardinality-02 finished in 98065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : AutoFlight-PT-96b-LTLCardinality-08
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 6265 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2539 transitions
Trivial Post-agglo rules discarded 2539 transitions
Performed 2539 trivial Post agglomeration. Transition count delta: 2539
Iterating post reduction 0 with 2539 rules applied. Total rules applied 2539 place count 6264 transition count 3555
Reduce places removed 2539 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 1 with 2826 rules applied. Total rules applied 5365 place count 3725 transition count 3268
Reduce places removed 191 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 192 rules applied. Total rules applied 5557 place count 3534 transition count 3267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5558 place count 3533 transition count 3267
Performed 703 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 703 Pre rules applied. Total rules applied 5558 place count 3533 transition count 2564
Deduced a syphon composed of 703 places in 68 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 4 with 1406 rules applied. Total rules applied 6964 place count 2830 transition count 2564
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 6968 place count 2826 transition count 2560
Iterating global reduction 4 with 4 rules applied. Total rules applied 6972 place count 2826 transition count 2560
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 6972 place count 2826 transition count 2556
Deduced a syphon composed of 4 places in 30 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 6980 place count 2822 transition count 2556
Performed 1142 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1142 places in 1 ms
Reduce places removed 1142 places and 0 transitions.
Iterating global reduction 4 with 2284 rules applied. Total rules applied 9264 place count 1680 transition count 1270
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 9265 place count 1679 transition count 1269
Reduce places removed 190 places and 0 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 4 with 284 rules applied. Total rules applied 9549 place count 1489 transition count 1175
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 5 with 94 rules applied. Total rules applied 9643 place count 1395 transition count 1175
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9643 place count 1395 transition count 1079
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9835 place count 1299 transition count 1079
Applied a total of 9835 rules in 1447 ms. Remains 1299 /6265 variables (removed 4966) and now considering 1079/6095 (removed 5016) transitions.
// Phase 1: matrix 1079 rows 1299 cols
[2024-05-21 14:40:02] [INFO ] Computed 324 invariants in 6 ms
[2024-05-21 14:40:04] [INFO ] Implicit Places using invariants in 1511 ms returned [509, 583, 657, 735, 809, 883, 921, 959, 963, 967, 971, 975, 979, 983, 987, 991, 995, 999, 1003, 1007, 1011, 1015, 1019, 1023, 1027, 1031, 1035, 1039, 1043, 1047, 1051, 1055, 1059, 1063, 1067, 1071, 1075, 1079, 1083, 1087, 1091, 1095, 1100, 1104, 1108, 1112, 1116, 1120, 1124, 1128, 1132, 1136, 1140, 1144, 1148, 1152, 1154, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1174, 1176, 1180, 1184, 1188, 1192, 1196, 1200, 1204, 1208, 1212, 1216, 1220, 1224, 1227, 1229, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1247, 1249, 1253, 1257, 1261, 1265, 1269, 1273, 1277, 1281, 1285, 1289, 1293]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 1514 ms to find 103 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1196/6265 places, 1079/6095 transitions.
Discarding 102 places :
Symmetric choice reduction at 0 with 102 rule applications. Total rules 102 place count 1094 transition count 977
Iterating global reduction 0 with 102 rules applied. Total rules applied 204 place count 1094 transition count 977
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 226 place count 1094 transition count 955
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 229 place count 1091 transition count 952
Iterating global reduction 1 with 3 rules applied. Total rules applied 232 place count 1091 transition count 952
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 235 place count 1088 transition count 949
Iterating global reduction 1 with 3 rules applied. Total rules applied 238 place count 1088 transition count 949
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 241 place count 1085 transition count 946
Iterating global reduction 1 with 3 rules applied. Total rules applied 244 place count 1085 transition count 946
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 247 place count 1082 transition count 943
Iterating global reduction 1 with 3 rules applied. Total rules applied 250 place count 1082 transition count 943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 253 place count 1079 transition count 940
Iterating global reduction 1 with 3 rules applied. Total rules applied 256 place count 1079 transition count 940
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 259 place count 1076 transition count 937
Iterating global reduction 1 with 3 rules applied. Total rules applied 262 place count 1076 transition count 937
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 265 place count 1073 transition count 934
Iterating global reduction 1 with 3 rules applied. Total rules applied 268 place count 1073 transition count 934
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 271 place count 1070 transition count 931
Iterating global reduction 1 with 3 rules applied. Total rules applied 274 place count 1070 transition count 931
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 277 place count 1067 transition count 928
Iterating global reduction 1 with 3 rules applied. Total rules applied 280 place count 1067 transition count 928
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 283 place count 1064 transition count 925
Iterating global reduction 1 with 3 rules applied. Total rules applied 286 place count 1064 transition count 925
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 289 place count 1061 transition count 922
Iterating global reduction 1 with 3 rules applied. Total rules applied 292 place count 1061 transition count 922
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 295 place count 1058 transition count 919
Iterating global reduction 1 with 3 rules applied. Total rules applied 298 place count 1058 transition count 919
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 300 place count 1056 transition count 917
Iterating global reduction 1 with 2 rules applied. Total rules applied 302 place count 1056 transition count 917
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 304 place count 1054 transition count 915
Iterating global reduction 1 with 2 rules applied. Total rules applied 306 place count 1054 transition count 915
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 308 place count 1052 transition count 913
Iterating global reduction 1 with 2 rules applied. Total rules applied 310 place count 1052 transition count 913
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 312 place count 1050 transition count 911
Iterating global reduction 1 with 2 rules applied. Total rules applied 314 place count 1050 transition count 911
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 316 place count 1048 transition count 909
Iterating global reduction 1 with 2 rules applied. Total rules applied 318 place count 1048 transition count 909
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 320 place count 1046 transition count 907
Iterating global reduction 1 with 2 rules applied. Total rules applied 322 place count 1046 transition count 907
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 324 place count 1044 transition count 905
Iterating global reduction 1 with 2 rules applied. Total rules applied 326 place count 1044 transition count 905
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 328 place count 1042 transition count 903
Iterating global reduction 1 with 2 rules applied. Total rules applied 330 place count 1042 transition count 903
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 332 place count 1040 transition count 901
Iterating global reduction 1 with 2 rules applied. Total rules applied 334 place count 1040 transition count 901
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 336 place count 1038 transition count 899
Iterating global reduction 1 with 2 rules applied. Total rules applied 338 place count 1038 transition count 899
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 340 place count 1036 transition count 897
Iterating global reduction 1 with 2 rules applied. Total rules applied 342 place count 1036 transition count 897
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 344 place count 1034 transition count 895
Iterating global reduction 1 with 2 rules applied. Total rules applied 346 place count 1034 transition count 895
Applied a total of 346 rules in 886 ms. Remains 1034 /1196 variables (removed 162) and now considering 895/1079 (removed 184) transitions.
// Phase 1: matrix 895 rows 1034 cols
[2024-05-21 14:40:05] [INFO ] Computed 221 invariants in 7 ms
[2024-05-21 14:40:06] [INFO ] Implicit Places using invariants in 1036 ms returned [1033]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1047 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1033/6265 places, 895/6095 transitions.
Graph (trivial) has 370 edges and 1033 vertex of which 2 / 1033 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 3 place count 1031 transition count 893
Applied a total of 3 rules in 112 ms. Remains 1031 /1033 variables (removed 2) and now considering 893/895 (removed 2) transitions.
// Phase 1: matrix 893 rows 1031 cols
[2024-05-21 14:40:06] [INFO ] Computed 220 invariants in 6 ms
[2024-05-21 14:40:07] [INFO ] Implicit Places using invariants in 902 ms returned []
[2024-05-21 14:40:07] [INFO ] Invariant cache hit.
[2024-05-21 14:40:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 14:40:09] [INFO ] Implicit Places using invariants and state equation in 2553 ms returned []
Implicit Place search using SMT with State Equation took 3461 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 1031/6265 places, 893/6095 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 8469 ms. Remains : 1031/6265 places, 893/6095 transitions.
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s506 0) (EQ s727 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property AutoFlight-PT-96b-LTLCardinality-08 finished in 8728 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)||p0))||G(p2))))'
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 U (F(G((p2 U X(!p0))))||p1)))))'
Found a Lengthening insensitive property : AutoFlight-PT-96b-LTLCardinality-11
Stuttering acceptance computed with spot in 330 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Support contains 7 out of 6265 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6265/6265 places, 6095/6095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2539 transitions
Trivial Post-agglo rules discarded 2539 transitions
Performed 2539 trivial Post agglomeration. Transition count delta: 2539
Iterating post reduction 0 with 2539 rules applied. Total rules applied 2539 place count 6264 transition count 3555
Reduce places removed 2539 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2827 rules applied. Total rules applied 5366 place count 3725 transition count 3267
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5559 place count 3533 transition count 3266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5560 place count 3532 transition count 3266
Performed 702 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 702 Pre rules applied. Total rules applied 5560 place count 3532 transition count 2564
Deduced a syphon composed of 702 places in 38 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 4 with 1404 rules applied. Total rules applied 6964 place count 2830 transition count 2564
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 6967 place count 2827 transition count 2561
Iterating global reduction 4 with 3 rules applied. Total rules applied 6970 place count 2827 transition count 2561
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 6970 place count 2827 transition count 2558
Deduced a syphon composed of 3 places in 31 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 6976 place count 2824 transition count 2558
Performed 1139 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1139 places in 1 ms
Reduce places removed 1139 places and 0 transitions.
Iterating global reduction 4 with 2278 rules applied. Total rules applied 9254 place count 1685 transition count 1277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 9256 place count 1685 transition count 1275
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9257 place count 1684 transition count 1274
Reduce places removed 164 places and 0 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 5 with 245 rules applied. Total rules applied 9502 place count 1520 transition count 1193
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 6 with 81 rules applied. Total rules applied 9583 place count 1439 transition count 1193
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 83 Pre rules applied. Total rules applied 9583 place count 1439 transition count 1110
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 7 with 166 rules applied. Total rules applied 9749 place count 1356 transition count 1110
Applied a total of 9749 rules in 1320 ms. Remains 1356 /6265 variables (removed 4909) and now considering 1110/6095 (removed 4985) transitions.
// Phase 1: matrix 1110 rows 1356 cols
[2024-05-21 14:40:11] [INFO ] Computed 350 invariants in 6 ms
[2024-05-21 14:40:13] [INFO ] Implicit Places using invariants in 1422 ms returned [539, 613, 727, 765, 839, 913, 951, 989, 995, 1002, 1008, 1014, 1020, 1026, 1032, 1038, 1044, 1050, 1056, 1062, 1068, 1073, 1077, 1081, 1085, 1089, 1093, 1097, 1101, 1105, 1109, 1113, 1117, 1121, 1125, 1129, 1133, 1137, 1141, 1145, 1149, 1153, 1157, 1161, 1165, 1169, 1173, 1177, 1181, 1185, 1189, 1193, 1197, 1201, 1205, 1209, 1211, 1213, 1215, 1217, 1219, 1221, 1223, 1225, 1227, 1229, 1231, 1233, 1237, 1241, 1245, 1249, 1253, 1257, 1261, 1265, 1269, 1273, 1277, 1281, 1284, 1286, 1288, 1290, 1292, 1294, 1296, 1298, 1300, 1302, 1304, 1306, 1310, 1314, 1318, 1322, 1326, 1330, 1334, 1338, 1342, 1346, 1350, 1355]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1425 ms to find 104 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1252/6265 places, 1110/6095 transitions.
Graph (trivial) has 493 edges and 1252 vertex of which 24 / 1252 are part of one of the 1 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1150 transition count 986
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1150 transition count 986
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 162 place count 1147 transition count 983
Iterating global reduction 0 with 3 rules applied. Total rules applied 165 place count 1147 transition count 983
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 168 place count 1144 transition count 980
Iterating global reduction 0 with 3 rules applied. Total rules applied 171 place count 1144 transition count 980
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 174 place count 1141 transition count 977
Iterating global reduction 0 with 3 rules applied. Total rules applied 177 place count 1141 transition count 977
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 180 place count 1138 transition count 974
Iterating global reduction 0 with 3 rules applied. Total rules applied 183 place count 1138 transition count 974
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 186 place count 1135 transition count 971
Iterating global reduction 0 with 3 rules applied. Total rules applied 189 place count 1135 transition count 971
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 192 place count 1132 transition count 968
Iterating global reduction 0 with 3 rules applied. Total rules applied 195 place count 1132 transition count 968
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 198 place count 1129 transition count 965
Iterating global reduction 0 with 3 rules applied. Total rules applied 201 place count 1129 transition count 965
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 204 place count 1126 transition count 962
Iterating global reduction 0 with 3 rules applied. Total rules applied 207 place count 1126 transition count 962
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 210 place count 1123 transition count 959
Iterating global reduction 0 with 3 rules applied. Total rules applied 213 place count 1123 transition count 959
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 216 place count 1120 transition count 956
Iterating global reduction 0 with 3 rules applied. Total rules applied 219 place count 1120 transition count 956
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 222 place count 1117 transition count 953
Iterating global reduction 0 with 3 rules applied. Total rules applied 225 place count 1117 transition count 953
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 228 place count 1114 transition count 950
Iterating global reduction 0 with 3 rules applied. Total rules applied 231 place count 1114 transition count 950
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 233 place count 1112 transition count 948
Iterating global reduction 0 with 2 rules applied. Total rules applied 235 place count 1112 transition count 948
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 237 place count 1110 transition count 946
Iterating global reduction 0 with 2 rules applied. Total rules applied 239 place count 1110 transition count 946
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 241 place count 1108 transition count 944
Iterating global reduction 0 with 2 rules applied. Total rules applied 243 place count 1108 transition count 944
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 245 place count 1106 transition count 942
Iterating global reduction 0 with 2 rules applied. Total rules applied 247 place count 1106 transition count 942
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 249 place count 1104 transition count 940
Iterating global reduction 0 with 2 rules applied. Total rules applied 251 place count 1104 transition count 940
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 253 place count 1102 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 255 place count 1102 transition count 938
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1100 transition count 936
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1100 transition count 936
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1098 transition count 934
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1098 transition count 934
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1096 transition count 932
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1096 transition count 932
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1094 transition count 930
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1094 transition count 930
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1092 transition count 928
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1092 transition count 928
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1090 transition count 926
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1090 transition count 926
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 283 place count 1088 transition count 924
Applied a total of 283 rules in 1066 ms. Remains 1088 /1252 variables (removed 164) and now considering 924/1110 (removed 186) transitions.
// Phase 1: matrix 924 rows 1088 cols
[2024-05-21 14:40:14] [INFO ] Computed 246 invariants in 5 ms
[2024-05-21 14:40:15] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2024-05-21 14:40:15] [INFO ] Invariant cache hit.
[2024-05-21 14:40:16] [INFO ] State equation strengthened by 254 read => feed constraints.
[2024-05-21 14:40:24] [INFO ] Implicit Places using invariants and state equation in 8940 ms returned [510, 512, 514, 516, 518, 520, 522, 524, 526, 528, 530, 532, 534]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 10109 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1075/6265 places, 924/6095 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 1075 transition count 911
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 1062 transition count 911
Applied a total of 26 rules in 45 ms. Remains 1062 /1075 variables (removed 13) and now considering 911/924 (removed 13) transitions.
// Phase 1: matrix 911 rows 1062 cols
[2024-05-21 14:40:24] [INFO ] Computed 233 invariants in 4 ms
[2024-05-21 14:40:25] [INFO ] Implicit Places using invariants in 1024 ms returned []
[2024-05-21 14:40:25] [INFO ] Invariant cache hit.
[2024-05-21 14:40:26] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 14:40:33] [INFO ] Implicit Places using invariants and state equation in 8472 ms returned []
Implicit Place search using SMT with State Equation took 9502 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 1062/6265 places, 911/6095 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 23469 ms. Remains : 1062/6265 places, 911/6095 transitions.
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={0} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (EQ s58 0) (EQ s905 1)), p0:(OR (EQ s104 0) (EQ s151 1)), p2:(AND (EQ s708 1) (OR (EQ s53 0) (EQ s1 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 439 reset in 1563 ms.
Product exploration explored 100000 steps with 441 reset in 1771 ms.
Computed a total of 20 stabilizing places and 5 stable transitions
Computed a total of 20 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 16 factoid took 490 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 477 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 748 ms. (steps per millisecond=13 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 14:40:39] [INFO ] Invariant cache hit.
[2024-05-21 14:40:39] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 14:40:40] [INFO ] [Nat]Absence check using 233 positive place invariants in 106 ms returned sat
[2024-05-21 14:40:41] [INFO ] After 1054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 14:40:41] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 14:40:42] [INFO ] After 686ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-21 14:40:42] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 0 ms to minimize.
[2024-05-21 14:40:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-05-21 14:40:43] [INFO ] Deduced a trap composed of 497 places in 493 ms of which 1 ms to minimize.
[2024-05-21 14:40:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 632 ms
[2024-05-21 14:40:43] [INFO ] After 2453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 507 ms.
[2024-05-21 14:40:44] [INFO ] After 4717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 250 ms.
Support contains 7 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 911/911 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 1062 transition count 910
Free-agglomeration rule applied 367 times.
Iterating global reduction 1 with 367 rules applied. Total rules applied 368 place count 1062 transition count 543
Reduce places removed 367 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 1309 edges and 695 vertex of which 693 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 369 rules applied. Total rules applied 737 place count 693 transition count 542
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 738 place count 693 transition count 541
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 741 place count 690 transition count 538
Iterating global reduction 3 with 3 rules applied. Total rules applied 744 place count 690 transition count 538
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 747 place count 687 transition count 535
Iterating global reduction 3 with 3 rules applied. Total rules applied 750 place count 687 transition count 535
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 753 place count 684 transition count 532
Iterating global reduction 3 with 3 rules applied. Total rules applied 756 place count 684 transition count 532
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 759 place count 681 transition count 529
Iterating global reduction 3 with 3 rules applied. Total rules applied 762 place count 681 transition count 529
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 765 place count 678 transition count 526
Iterating global reduction 3 with 3 rules applied. Total rules applied 768 place count 678 transition count 526
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 771 place count 675 transition count 523
Iterating global reduction 3 with 3 rules applied. Total rules applied 774 place count 675 transition count 523
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 777 place count 672 transition count 520
Iterating global reduction 3 with 3 rules applied. Total rules applied 780 place count 672 transition count 520
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 782 place count 670 transition count 518
Iterating global reduction 3 with 2 rules applied. Total rules applied 784 place count 670 transition count 518
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 786 place count 668 transition count 516
Iterating global reduction 3 with 2 rules applied. Total rules applied 788 place count 668 transition count 516
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 790 place count 666 transition count 514
Iterating global reduction 3 with 2 rules applied. Total rules applied 792 place count 666 transition count 514
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 794 place count 664 transition count 512
Iterating global reduction 3 with 2 rules applied. Total rules applied 796 place count 664 transition count 512
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 798 place count 662 transition count 510
Iterating global reduction 3 with 2 rules applied. Total rules applied 800 place count 662 transition count 510
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 801 place count 661 transition count 509
Iterating global reduction 3 with 1 rules applied. Total rules applied 802 place count 661 transition count 509
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 803 place count 660 transition count 508
Iterating global reduction 3 with 1 rules applied. Total rules applied 804 place count 660 transition count 508
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 805 place count 659 transition count 507
Iterating global reduction 3 with 1 rules applied. Total rules applied 806 place count 659 transition count 507
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 807 place count 658 transition count 506
Iterating global reduction 3 with 1 rules applied. Total rules applied 808 place count 658 transition count 506
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 809 place count 657 transition count 505
Iterating global reduction 3 with 1 rules applied. Total rules applied 810 place count 657 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 811 place count 656 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 812 place count 656 transition count 504
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 813 place count 655 transition count 503
Iterating global reduction 3 with 1 rules applied. Total rules applied 814 place count 655 transition count 503
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 815 place count 654 transition count 502
Iterating global reduction 3 with 1 rules applied. Total rules applied 816 place count 654 transition count 502
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 817 place count 653 transition count 501
Iterating global reduction 3 with 1 rules applied. Total rules applied 818 place count 653 transition count 501
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 819 place count 652 transition count 500
Iterating global reduction 3 with 1 rules applied. Total rules applied 820 place count 652 transition count 500
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 821 place count 651 transition count 499
Iterating global reduction 3 with 1 rules applied. Total rules applied 822 place count 651 transition count 499
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 823 place count 650 transition count 498
Iterating global reduction 3 with 1 rules applied. Total rules applied 824 place count 650 transition count 498
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 825 place count 650 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 826 place count 649 transition count 497
Applied a total of 826 rules in 539 ms. Remains 649 /1062 variables (removed 413) and now considering 497/911 (removed 414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 540 ms. Remains : 649/1062 places, 497/911 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Probably explored full state space saw : 13335 states, properties seen :3
Probabilistic random walk after 59902 steps, saw 13335 distinct states, run finished after 1053 ms. (steps per millisecond=56 ) properties seen :3
Explored full state space saw : 13335 states, properties seen :0
Exhaustive walk after 59902 steps, saw 13335 distinct states, run finished after 963 ms. (steps per millisecond=62 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F p2), (F (AND p0 (NOT p1) p2)), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND p0 p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 1000 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 1062 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 911/911 transitions.
Applied a total of 0 rules in 67 ms. Remains 1062 /1062 variables (removed 0) and now considering 911/911 (removed 0) transitions.
[2024-05-21 14:40:49] [INFO ] Invariant cache hit.
[2024-05-21 14:40:50] [INFO ] Implicit Places using invariants in 1249 ms returned []
[2024-05-21 14:40:50] [INFO ] Invariant cache hit.
[2024-05-21 14:40:51] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 14:40:59] [INFO ] Implicit Places using invariants and state equation in 8601 ms returned []
Implicit Place search using SMT with State Equation took 9877 ms to find 0 implicit places.
[2024-05-21 14:40:59] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-21 14:40:59] [INFO ] Invariant cache hit.
[2024-05-21 14:41:00] [INFO ] Dead Transitions using invariants and state equation in 1113 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11089 ms. Remains : 1062/1062 places, 911/911 transitions.
Computed a total of 20 stabilizing places and 5 stable transitions
Computed a total of 20 stabilizing places and 5 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 81 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 43 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 228235 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228235 steps, saw 89091 distinct states, run finished after 3005 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 14:41:03] [INFO ] Invariant cache hit.
[2024-05-21 14:41:03] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 14:41:04] [INFO ] [Nat]Absence check using 233 positive place invariants in 102 ms returned sat
[2024-05-21 14:41:04] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 14:41:04] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 14:41:05] [INFO ] After 331ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 14:41:05] [INFO ] After 450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-21 14:41:05] [INFO ] After 1613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 911/911 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1062 transition count 908
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 1060 transition count 908
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 1057 transition count 905
Free-agglomeration rule applied 368 times.
Iterating global reduction 2 with 368 rules applied. Total rules applied 379 place count 1057 transition count 537
Reduce places removed 368 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 1297 edges and 689 vertex of which 687 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 370 rules applied. Total rules applied 749 place count 687 transition count 536
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 750 place count 687 transition count 535
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 753 place count 684 transition count 532
Iterating global reduction 4 with 3 rules applied. Total rules applied 756 place count 684 transition count 532
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 759 place count 681 transition count 529
Iterating global reduction 4 with 3 rules applied. Total rules applied 762 place count 681 transition count 529
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 765 place count 678 transition count 526
Iterating global reduction 4 with 3 rules applied. Total rules applied 768 place count 678 transition count 526
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 771 place count 675 transition count 523
Iterating global reduction 4 with 3 rules applied. Total rules applied 774 place count 675 transition count 523
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 777 place count 672 transition count 520
Iterating global reduction 4 with 3 rules applied. Total rules applied 780 place count 672 transition count 520
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 783 place count 669 transition count 517
Iterating global reduction 4 with 3 rules applied. Total rules applied 786 place count 669 transition count 517
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 789 place count 666 transition count 514
Iterating global reduction 4 with 3 rules applied. Total rules applied 792 place count 666 transition count 514
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 794 place count 664 transition count 512
Iterating global reduction 4 with 2 rules applied. Total rules applied 796 place count 664 transition count 512
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 798 place count 662 transition count 510
Iterating global reduction 4 with 2 rules applied. Total rules applied 800 place count 662 transition count 510
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 802 place count 660 transition count 508
Iterating global reduction 4 with 2 rules applied. Total rules applied 804 place count 660 transition count 508
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 806 place count 658 transition count 506
Iterating global reduction 4 with 2 rules applied. Total rules applied 808 place count 658 transition count 506
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 810 place count 656 transition count 504
Iterating global reduction 4 with 2 rules applied. Total rules applied 812 place count 656 transition count 504
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 813 place count 655 transition count 503
Iterating global reduction 4 with 1 rules applied. Total rules applied 814 place count 655 transition count 503
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 815 place count 654 transition count 502
Iterating global reduction 4 with 1 rules applied. Total rules applied 816 place count 654 transition count 502
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 817 place count 653 transition count 501
Iterating global reduction 4 with 1 rules applied. Total rules applied 818 place count 653 transition count 501
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 819 place count 652 transition count 500
Iterating global reduction 4 with 1 rules applied. Total rules applied 820 place count 652 transition count 500
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 821 place count 651 transition count 499
Iterating global reduction 4 with 1 rules applied. Total rules applied 822 place count 651 transition count 499
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 823 place count 650 transition count 498
Iterating global reduction 4 with 1 rules applied. Total rules applied 824 place count 650 transition count 498
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 825 place count 649 transition count 497
Iterating global reduction 4 with 1 rules applied. Total rules applied 826 place count 649 transition count 497
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 827 place count 648 transition count 496
Iterating global reduction 4 with 1 rules applied. Total rules applied 828 place count 648 transition count 496
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 829 place count 647 transition count 495
Iterating global reduction 4 with 1 rules applied. Total rules applied 830 place count 647 transition count 495
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 831 place count 646 transition count 494
Iterating global reduction 4 with 1 rules applied. Total rules applied 832 place count 646 transition count 494
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 833 place count 645 transition count 493
Iterating global reduction 4 with 1 rules applied. Total rules applied 834 place count 645 transition count 493
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 835 place count 644 transition count 492
Iterating global reduction 4 with 1 rules applied. Total rules applied 836 place count 644 transition count 492
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 837 place count 644 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 838 place count 643 transition count 491
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 839 place count 643 transition count 491
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 840 place count 642 transition count 490
Iterating global reduction 5 with 1 rules applied. Total rules applied 841 place count 642 transition count 490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 842 place count 641 transition count 489
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t202.t1255.t726 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 479 edges and 411 vertex of which 259 / 411 are part of one of the 1 SCC in 1 ms
Free SCC test removed 258 places
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 5 with 144 rules applied. Total rules applied 986 place count 153 transition count 346
Reduce places removed 142 places and 0 transitions.
Drop transitions removed 334 transitions
Reduce isomorphic transitions removed 334 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 477 rules applied. Total rules applied 1463 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1464 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1464 place count 10 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1466 place count 9 transition count 10
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 8 with 2 rules applied. Total rules applied 1468 place count 8 transition count 9
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1471 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1474 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1475 place count 5 transition count 5
Applied a total of 1475 rules in 746 ms. Remains 5 /1062 variables (removed 1057) and now considering 5/911 (removed 906) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 746 ms. Remains : 5/1062 places, 5/911 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 438 reset in 1925 ms.
Product exploration explored 100000 steps with 440 reset in 1729 ms.
Built C files in :
/tmp/ltsmin7016072197398885813
[2024-05-21 14:41:10] [INFO ] Computing symmetric may disable matrix : 911 transitions.
[2024-05-21 14:41:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:41:10] [INFO ] Computing symmetric may enable matrix : 911 transitions.
[2024-05-21 14:41:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:41:10] [INFO ] Computing Do-Not-Accords matrix : 911 transitions.
[2024-05-21 14:41:10] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:41:10] [INFO ] Built C files in 150ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7016072197398885813
Running compilation step : cd /tmp/ltsmin7016072197398885813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7016072197398885813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7016072197398885813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 911/911 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1059 transition count 907
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 1057 transition count 907
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 1055 transition count 905
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 1053 transition count 903
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 26 rules applied. Total rules applied 37 place count 1040 transition count 890
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 50 place count 1027 transition count 890
Applied a total of 50 rules in 151 ms. Remains 1027 /1062 variables (removed 35) and now considering 890/911 (removed 21) transitions.
// Phase 1: matrix 890 rows 1027 cols
[2024-05-21 14:41:13] [INFO ] Computed 219 invariants in 6 ms
[2024-05-21 14:41:14] [INFO ] Implicit Places using invariants in 1235 ms returned [651]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1245 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1062 places, 890/911 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1025 transition count 889
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1025 transition count 889
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1024 transition count 888
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1024 transition count 888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1023 transition count 887
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1023 transition count 887
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1022 transition count 886
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1022 transition count 886
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1021 transition count 885
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1021 transition count 885
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1020 transition count 884
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1020 transition count 884
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1019 transition count 883
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1019 transition count 883
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1018 transition count 882
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1018 transition count 882
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1017 transition count 881
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1017 transition count 881
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1016 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1016 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1015 transition count 879
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1015 transition count 879
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1014 transition count 878
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1014 transition count 878
Applied a total of 24 rules in 644 ms. Remains 1014 /1026 variables (removed 12) and now considering 878/890 (removed 12) transitions.
// Phase 1: matrix 878 rows 1014 cols
[2024-05-21 14:41:15] [INFO ] Computed 218 invariants in 7 ms
[2024-05-21 14:41:16] [INFO ] Implicit Places using invariants in 971 ms returned []
[2024-05-21 14:41:16] [INFO ] Invariant cache hit.
[2024-05-21 14:41:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 14:41:18] [INFO ] Implicit Places using invariants and state equation in 2165 ms returned []
Implicit Place search using SMT with State Equation took 3148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1014/1062 places, 878/911 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5188 ms. Remains : 1014/1062 places, 878/911 transitions.
Built C files in :
/tmp/ltsmin6139472110085480302
[2024-05-21 14:41:18] [INFO ] Computing symmetric may disable matrix : 878 transitions.
[2024-05-21 14:41:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:41:18] [INFO ] Computing symmetric may enable matrix : 878 transitions.
[2024-05-21 14:41:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:41:18] [INFO ] Computing Do-Not-Accords matrix : 878 transitions.
[2024-05-21 14:41:18] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:41:18] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6139472110085480302
Running compilation step : cd /tmp/ltsmin6139472110085480302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6139472110085480302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6139472110085480302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 14:41:21] [INFO ] Flatten gal took : 21 ms
[2024-05-21 14:41:22] [INFO ] Flatten gal took : 20 ms
[2024-05-21 14:41:22] [INFO ] Time to serialize gal into /tmp/LTL14800907266485663408.gal : 4 ms
[2024-05-21 14:41:22] [INFO ] Time to serialize properties into /tmp/LTL7055156540504502205.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14800907266485663408.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8070473747895110234.hoa' '-atoms' '/tmp/LTL7055156540504502205.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/LTL7055156540504502205.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8070473747895110234.hoa
Detected timeout of ITS tools.
[2024-05-21 14:41:37] [INFO ] Flatten gal took : 43 ms
[2024-05-21 14:41:37] [INFO ] Flatten gal took : 43 ms
[2024-05-21 14:41:37] [INFO ] Time to serialize gal into /tmp/LTL13891033672880288598.gal : 6 ms
[2024-05-21 14:41:37] [INFO ] Time to serialize properties into /tmp/LTL14623045128488368003.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/LTL13891033672880288598.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14623045128488368003.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...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p963==0)||(p1216==1))")U(("((p713==0)||(p6280==1))")||(F(G(("((p5487==1)&&((p690==0)||(p169==1)))")U(X(!("((p963==0)||(p121...173
Formula 0 simplified : XF(!"((p963==0)||(p1216==1))" R (!"((p713==0)||(p6280==1))" & GF(!"((p5487==1)&&((p690==0)||(p169==1)))" R X"((p963==0)||(p1216==1))...159
Detected timeout of ITS tools.
[2024-05-21 14:41:52] [INFO ] Flatten gal took : 30 ms
[2024-05-21 14:41:52] [INFO ] Applying decomposition
[2024-05-21 14:41:52] [INFO ] Flatten gal took : 29 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/graph2832491391806614489.txt' '-o' '/tmp/graph2832491391806614489.bin' '-w' '/tmp/graph2832491391806614489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2832491391806614489.bin' '-l' '-1' '-v' '-w' '/tmp/graph2832491391806614489.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:41:52] [INFO ] Decomposing Gal with order
[2024-05-21 14:41:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:41:52] [INFO ] Removed a total of 35 redundant transitions.
[2024-05-21 14:41:52] [INFO ] Flatten gal took : 62 ms
[2024-05-21 14:41:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-21 14:41:52] [INFO ] Time to serialize gal into /tmp/LTL4463242538252416523.gal : 16 ms
[2024-05-21 14:41:52] [INFO ] Time to serialize properties into /tmp/LTL8299304900973068532.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/LTL4463242538252416523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8299304900973068532.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 : !((X(G(("((i14.i1.i3.u43.p963==0)||(i19.u64.p1216==1))")U(("((i1.i1.i0.u24.p713==0)||(i13.i0.i0.u389.p6280==1))")||(F(G(("((i16.i2.i0....286
Formula 0 simplified : XF(!"((i14.i1.i3.u43.p963==0)||(i19.u64.p1216==1))" R (!"((i1.i1.i0.u24.p713==0)||(i13.i0.i0.u389.p6280==1))" & GF(!"((i16.i2.i0.u28...272
Reverse transition relation is NOT exact ! Due to transitions t1073, i0.i1.i0.u0.t2, i1.i1.i0.u24.t0, i12.i0.i0.t49, i12.i0.i0.t37, i14.i0.i0.u22.t683, i14...271
Computing Next relation with stutter on 2.83342e+24 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9569067570545748903
[2024-05-21 14:42:07] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9569067570545748903
Running compilation step : cd /tmp/ltsmin9569067570545748903;'/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 2523 ms.
Running link step : cd /tmp/ltsmin9569067570545748903;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9569067570545748903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true) U (<>([](((LTLAPp2==true) U X(!(LTLAPp0==true)))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-96b-LTLCardinality-11 finished in 132666 ms.
[2024-05-21 14:42:22] [INFO ] Flatten gal took : 130 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3435593129608408543
[2024-05-21 14:42:22] [INFO ] Too many transitions (6095) to apply POR reductions. Disabling POR matrices.
[2024-05-21 14:42:23] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3435593129608408543
Running compilation step : cd /tmp/ltsmin3435593129608408543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 14:42:23] [INFO ] Applying decomposition
[2024-05-21 14:42:23] [INFO ] Flatten gal took : 206 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/graph4220130866531951094.txt' '-o' '/tmp/graph4220130866531951094.bin' '-w' '/tmp/graph4220130866531951094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4220130866531951094.bin' '-l' '-1' '-v' '-w' '/tmp/graph4220130866531951094.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:42:23] [INFO ] Decomposing Gal with order
[2024-05-21 14:42:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:42:26] [INFO ] Removed a total of 1117 redundant transitions.
[2024-05-21 14:42:26] [INFO ] Flatten gal took : 285 ms
[2024-05-21 14:42:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2024-05-21 14:42:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality14749202653392338134.gal : 59 ms
[2024-05-21 14:42:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality3969437202139971791.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14749202653392338134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3969437202139971791.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...277
Read 4 LTL properties
Checking formula 0 : !((X((F(G("(i28.i1.i1.i0.u943.p3376!=1)")))U(G("((i44.i1.i0.i1.u1447.p5009==0)||(i45.i1.i0.i0.u1488.p5098==1))")))))
Formula 0 simplified : X(GF!"(i28.i1.i1.i0.u943.p3376!=1)" R F!"((i44.i1.i0.i1.u1447.p5009==0)||(i45.i1.i0.i0.u1488.p5098==1))")
Compilation finished in 42025 ms.
Running link step : cd /tmp/ltsmin3435593129608408543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin3435593129608408543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true))) U []((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin3435593129608408543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true))) U []((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3435593129608408543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 15:07:37] [INFO ] Applying decomposition
[2024-05-21 15:07:38] [INFO ] Flatten gal took : 353 ms
[2024-05-21 15:07:38] [INFO ] Decomposing Gal with order
[2024-05-21 15:08:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:08:03] [INFO ] Removed a total of 206 redundant transitions.
[2024-05-21 15:08:03] [INFO ] Flatten gal took : 527 ms
[2024-05-21 15:09:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 10710 labels/synchronizations in 76651 ms.
[2024-05-21 15:09:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality2782466899858058554.gal : 2739 ms
[2024-05-21 15:09:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality4114611352341868148.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2782466899858058554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4114611352341868148.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...276
Read 4 LTL properties
Checking formula 0 : !((X((F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...1242
Formula 0 simplified : X(GF!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...1233
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin3435593129608408543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3435593129608408543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>(([]((LTLAPp4==true))||(LTLAPp3==true)))||[]((LTLAPp5==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 162968 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16080264 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-96b"
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-96b, 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-171620180200132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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