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-171620180500288.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 BART-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180500288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 1020K Apr 12 22:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.7M Apr 12 22:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 356K Apr 12 21:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 12 21:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 377K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 386K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 1010K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1M Apr 12 23:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.4M Apr 12 23:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 22:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.1M Apr 12 22:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 172K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 2.4M 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 BART-PT-010-LTLFireability-00
FORMULA_NAME BART-PT-010-LTLFireability-01
FORMULA_NAME BART-PT-010-LTLFireability-02
FORMULA_NAME BART-PT-010-LTLFireability-03
FORMULA_NAME BART-PT-010-LTLFireability-04
FORMULA_NAME BART-PT-010-LTLFireability-05
FORMULA_NAME BART-PT-010-LTLFireability-06
FORMULA_NAME BART-PT-010-LTLFireability-07
FORMULA_NAME BART-PT-010-LTLFireability-08
FORMULA_NAME BART-PT-010-LTLFireability-09
FORMULA_NAME BART-PT-010-LTLFireability-10
FORMULA_NAME BART-PT-010-LTLFireability-11
FORMULA_NAME BART-PT-010-LTLFireability-12
FORMULA_NAME BART-PT-010-LTLFireability-13
FORMULA_NAME BART-PT-010-LTLFireability-14
FORMULA_NAME BART-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716348010523

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-010
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 03:20:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 03:20:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:20:14] [INFO ] Load time of PNML (sax parser for PT used): 420 ms
[2024-05-22 03:20:14] [INFO ] Transformed 1530 places.
[2024-05-22 03:20:14] [INFO ] Transformed 2020 transitions.
[2024-05-22 03:20:14] [INFO ] Found NUPN structural information;
[2024-05-22 03:20:14] [INFO ] Parsed PT model containing 1530 places and 2020 transitions and 16200 arcs in 559 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 68 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-010-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1320 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 42 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
// Phase 1: matrix 2020 rows 1320 cols
[2024-05-22 03:20:15] [INFO ] Computed 10 invariants in 44 ms
[2024-05-22 03:20:16] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2024-05-22 03:20:16] [INFO ] Invariant cache hit.
[2024-05-22 03:20:16] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
[2024-05-22 03:20:16] [INFO ] Invariant cache hit.
[2024-05-22 03:20:18] [INFO ] Dead Transitions using invariants and state equation in 2053 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3714 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Support contains 1320 out of 1320 places after structural reductions.
[2024-05-22 03:20:19] [INFO ] Flatten gal took : 302 ms
[2024-05-22 03:20:20] [INFO ] Flatten gal took : 136 ms
[2024-05-22 03:20:20] [INFO ] Input system was already deterministic with 2020 transitions.
Finished random walk after 8339 steps, including 2 resets, run visited all 17 properties in 432 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BART-PT-010-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BART-PT-010-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(X(F((p0&&F(p1)))))'
Support contains 100 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 230 places :
Symmetric choice reduction at 0 with 230 rule applications. Total rules 230 place count 1090 transition count 1790
Iterating global reduction 0 with 230 rules applied. Total rules applied 460 place count 1090 transition count 1790
Discarding 190 places :
Symmetric choice reduction at 0 with 190 rule applications. Total rules 650 place count 900 transition count 1600
Iterating global reduction 0 with 190 rules applied. Total rules applied 840 place count 900 transition count 1600
Applied a total of 840 rules in 354 ms. Remains 900 /1320 variables (removed 420) and now considering 1600/2020 (removed 420) transitions.
// Phase 1: matrix 1600 rows 900 cols
[2024-05-22 03:20:21] [INFO ] Computed 10 invariants in 16 ms
[2024-05-22 03:20:22] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-22 03:20:22] [INFO ] Invariant cache hit.
[2024-05-22 03:20:23] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2024-05-22 03:20:23] [INFO ] Invariant cache hit.
[2024-05-22 03:20:24] [INFO ] Dead Transitions using invariants and state equation in 1474 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 900/1320 places, 1600/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3163 ms. Remains : 900/1320 places, 1600/2020 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 419 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s9 1) (EQ s4 1) (EQ s5 1) (EQ s0 1) (EQ s1 1) (EQ s6 1) (EQ s2 1) (EQ s7 1) (EQ s3 1) (EQ s8 1)), p0:(OR (EQ s70 1) (EQ s277 1) (EQ s303 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1646 reset in 1210 ms.
Product exploration explored 100000 steps with 1650 reset in 910 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 68 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-22 03:20:28] [INFO ] Invariant cache hit.
[2024-05-22 03:20:30] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-05-22 03:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 03:20:32] [INFO ] [Real]Absence check using state equation in 1558 ms returned sat
[2024-05-22 03:20:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:20:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2024-05-22 03:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 03:20:35] [INFO ] [Nat]Absence check using state equation in 1259 ms returned sat
[2024-05-22 03:20:36] [INFO ] Computed and/alt/rep : 1240/2280/1240 causal constraints (skipped 0 transitions) in 133 ms.
[2024-05-22 03:20:48] [INFO ] Deduced a trap composed of 90 places in 1027 ms of which 9 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.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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-22 03:20:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 100 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 1600/1600 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 900 transition count 1490
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 220 place count 790 transition count 1490
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 220 place count 790 transition count 1440
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 320 place count 740 transition count 1440
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 720 place count 540 transition count 1240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 730 place count 540 transition count 1230
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 750 place count 530 transition count 1220
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 760 place count 530 transition count 1210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 780 place count 520 transition count 1200
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 790 place count 520 transition count 1190
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 810 place count 510 transition count 1180
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 820 place count 510 transition count 1170
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 840 place count 500 transition count 1160
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 860 place count 500 transition count 1140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 880 place count 490 transition count 1130
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 900 place count 490 transition count 1110
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 920 place count 480 transition count 1100
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 940 place count 480 transition count 1080
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 960 place count 470 transition count 1070
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 980 place count 470 transition count 1050
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1000 place count 460 transition count 1040
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 1020 place count 460 transition count 1020
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1040 place count 450 transition count 1010
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 1060 place count 450 transition count 990
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 1080 place count 440 transition count 980
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 1100 place count 440 transition count 960
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 20 rules applied. Total rules applied 1120 place count 430 transition count 950
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 1140 place count 430 transition count 930
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 14 with 20 rules applied. Total rules applied 1160 place count 420 transition count 920
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 14 with 20 rules applied. Total rules applied 1180 place count 420 transition count 900
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 15 with 20 rules applied. Total rules applied 1200 place count 410 transition count 890
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 15 with 20 rules applied. Total rules applied 1220 place count 410 transition count 870
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 16 with 20 rules applied. Total rules applied 1240 place count 400 transition count 860
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 16 with 20 rules applied. Total rules applied 1260 place count 400 transition count 840
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 17 with 20 rules applied. Total rules applied 1280 place count 390 transition count 830
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 17 with 20 rules applied. Total rules applied 1300 place count 390 transition count 810
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 18 with 20 rules applied. Total rules applied 1320 place count 380 transition count 800
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 18 with 20 rules applied. Total rules applied 1340 place count 380 transition count 780
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 19 with 20 rules applied. Total rules applied 1360 place count 370 transition count 770
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 19 with 20 rules applied. Total rules applied 1380 place count 370 transition count 750
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 20 with 20 rules applied. Total rules applied 1400 place count 360 transition count 740
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 20 with 20 rules applied. Total rules applied 1420 place count 360 transition count 720
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 21 with 20 rules applied. Total rules applied 1440 place count 350 transition count 710
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 21 with 20 rules applied. Total rules applied 1460 place count 350 transition count 690
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 22 with 20 rules applied. Total rules applied 1480 place count 340 transition count 680
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 22 with 20 rules applied. Total rules applied 1500 place count 340 transition count 660
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 23 with 20 rules applied. Total rules applied 1520 place count 330 transition count 650
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 23 with 20 rules applied. Total rules applied 1540 place count 330 transition count 630
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 24 with 20 rules applied. Total rules applied 1560 place count 320 transition count 620
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 24 with 20 rules applied. Total rules applied 1580 place count 320 transition count 600
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 25 with 20 rules applied. Total rules applied 1600 place count 310 transition count 590
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 25 with 10 rules applied. Total rules applied 1610 place count 310 transition count 580
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 26 with 20 rules applied. Total rules applied 1630 place count 300 transition count 570
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 26 with 10 rules applied. Total rules applied 1640 place count 300 transition count 560
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 27 with 20 rules applied. Total rules applied 1660 place count 290 transition count 550
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 27 with 10 rules applied. Total rules applied 1670 place count 290 transition count 540
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 28 with 20 rules applied. Total rules applied 1690 place count 280 transition count 530
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 28 with 20 rules applied. Total rules applied 1710 place count 280 transition count 510
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 29 with 20 rules applied. Total rules applied 1730 place count 270 transition count 500
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 29 with 20 rules applied. Total rules applied 1750 place count 270 transition count 480
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 30 with 20 rules applied. Total rules applied 1770 place count 260 transition count 470
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 30 with 20 rules applied. Total rules applied 1790 place count 260 transition count 450
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 31 with 20 rules applied. Total rules applied 1810 place count 250 transition count 440
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 31 with 20 rules applied. Total rules applied 1830 place count 250 transition count 420
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 32 with 20 rules applied. Total rules applied 1850 place count 240 transition count 410
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 32 with 10 rules applied. Total rules applied 1860 place count 240 transition count 400
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 33 with 20 rules applied. Total rules applied 1880 place count 230 transition count 390
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 33 with 10 rules applied. Total rules applied 1890 place count 230 transition count 380
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 34 with 20 rules applied. Total rules applied 1910 place count 220 transition count 370
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 34 with 20 rules applied. Total rules applied 1930 place count 220 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 35 with 20 rules applied. Total rules applied 1950 place count 210 transition count 340
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 35 with 20 rules applied. Total rules applied 1970 place count 210 transition count 320
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 36 with 10 rules applied. Total rules applied 1980 place count 210 transition count 310
Partial Post-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 36 with 10 rules applied. Total rules applied 1990 place count 210 transition count 310
Discarding 10 places :
Symmetric choice reduction at 36 with 10 rule applications. Total rules 2000 place count 200 transition count 300
Iterating global reduction 36 with 10 rules applied. Total rules applied 2010 place count 200 transition count 300
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 36 with 10 rules applied. Total rules applied 2020 place count 200 transition count 290
Applied a total of 2020 rules in 865 ms. Remains 200 /900 variables (removed 700) and now considering 290/1600 (removed 1310) transitions.
// Phase 1: matrix 290 rows 200 cols
[2024-05-22 03:20:49] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 03:20:49] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 03:20:49] [INFO ] Invariant cache hit.
[2024-05-22 03:20:49] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-22 03:20:49] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-22 03:20:49] [INFO ] Invariant cache hit.
[2024-05-22 03:20:50] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/900 places, 290/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1352 ms. Remains : 200/900 places, 290/1600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 6 factoid took 213 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F p0), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 447 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 417 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-22 03:20:51] [INFO ] Invariant cache hit.
[2024-05-22 03:20:52] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-22 03:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 03:20:52] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2024-05-22 03:20:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:20:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-22 03:20:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 03:20:53] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2024-05-22 03:20:53] [INFO ] Computed and/alt/rep : 190/280/190 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-22 03:20:54] [INFO ] Added : 21 causal constraints over 5 iterations in 219 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8493 reset in 1021 ms.
Stack based approach found an accepted trace after 1810 steps with 146 reset with depth 12 and stack size 12 in 17 ms.
FORMULA BART-PT-010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-010-LTLFireability-01 finished in 34161 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 90 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1780 edges and 1320 vertex of which 410 / 1320 are part of one of the 10 SCC in 6 ms
Free SCC test removed 400 places
Ensure Unique test removed 750 transitions
Reduce isomorphic transitions removed 750 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 561 place count 920 transition count 710
Reduce places removed 560 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 680 rules applied. Total rules applied 1241 place count 360 transition count 590
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 2 with 120 rules applied. Total rules applied 1361 place count 320 transition count 510
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 120 rules applied. Total rules applied 1481 place count 280 transition count 430
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 1561 place count 240 transition count 390
Discarding 50 places :
Symmetric choice reduction at 5 with 50 rule applications. Total rules 1611 place count 190 transition count 340
Iterating global reduction 5 with 50 rules applied. Total rules applied 1661 place count 190 transition count 340
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 5 with 50 rules applied. Total rules applied 1711 place count 190 transition count 290
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 1721 place count 190 transition count 280
Applied a total of 1721 rules in 43 ms. Remains 190 /1320 variables (removed 1130) and now considering 280/2020 (removed 1740) transitions.
[2024-05-22 03:20:55] [INFO ] Flow matrix only has 271 transitions (discarded 9 similar events)
// Phase 1: matrix 271 rows 190 cols
[2024-05-22 03:20:55] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 03:20:55] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 03:20:55] [INFO ] Flow matrix only has 271 transitions (discarded 9 similar events)
[2024-05-22 03:20:55] [INFO ] Invariant cache hit.
[2024-05-22 03:20:55] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-22 03:20:55] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-22 03:20:55] [INFO ] Flow matrix only has 271 transitions (discarded 9 similar events)
[2024-05-22 03:20:55] [INFO ] Invariant cache hit.
[2024-05-22 03:20:56] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/1320 places, 280/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 740 ms. Remains : 190/1320 places, 280/2020 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s10 1) (EQ s117 1) (EQ s123 1) (EQ s45 1) (EQ s104 1) (EQ s17 1) (EQ s63 1) (EQ s67 1) (EQ s41 1) (EQ s100 1) (EQ s136 1) (EQ s127 1) (EQ s132 ...], 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 BART-PT-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-03 finished in 962 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((F(G(p0)) U (p0 U p1)))))'
Support contains 890 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 1230 transition count 1930
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 1230 transition count 1930
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 240 place count 1170 transition count 1870
Iterating global reduction 0 with 60 rules applied. Total rules applied 300 place count 1170 transition count 1870
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 330 place count 1140 transition count 1840
Iterating global reduction 0 with 30 rules applied. Total rules applied 360 place count 1140 transition count 1840
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 390 place count 1110 transition count 1810
Iterating global reduction 0 with 30 rules applied. Total rules applied 420 place count 1110 transition count 1810
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 450 place count 1080 transition count 1780
Iterating global reduction 0 with 30 rules applied. Total rules applied 480 place count 1080 transition count 1780
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 510 place count 1050 transition count 1750
Iterating global reduction 0 with 30 rules applied. Total rules applied 540 place count 1050 transition count 1750
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 560 place count 1030 transition count 1730
Iterating global reduction 0 with 20 rules applied. Total rules applied 580 place count 1030 transition count 1730
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 600 place count 1010 transition count 1710
Iterating global reduction 0 with 20 rules applied. Total rules applied 620 place count 1010 transition count 1710
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 630 place count 1000 transition count 1700
Iterating global reduction 0 with 10 rules applied. Total rules applied 640 place count 1000 transition count 1700
Applied a total of 640 rules in 113 ms. Remains 1000 /1320 variables (removed 320) and now considering 1700/2020 (removed 320) transitions.
// Phase 1: matrix 1700 rows 1000 cols
[2024-05-22 03:20:56] [INFO ] Computed 10 invariants in 15 ms
[2024-05-22 03:20:56] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-22 03:20:56] [INFO ] Invariant cache hit.
[2024-05-22 03:20:57] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2024-05-22 03:20:57] [INFO ] Invariant cache hit.
[2024-05-22 03:20:59] [INFO ] Dead Transitions using invariants and state equation in 1748 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1320 places, 1700/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2865 ms. Remains : 1000/1320 places, 1700/2020 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s16 1) (EQ s17 1) (EQ s18 1) (EQ s19 1) (EQ s10 1) (EQ s11 1) (EQ s12 1) (EQ s13 1) (EQ s14 1) (EQ s15 1)), p0:(OR (EQ s180 1) (EQ s162 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2887 ms.
Product exploration explored 100000 steps with 1 reset in 2795 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Finished random walk after 45 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 428 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
[2024-05-22 03:21:06] [INFO ] Invariant cache hit.
[2024-05-22 03:21:08] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-22 03:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 03:21:08] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2024-05-22 03:21:09] [INFO ] Computed and/alt/rep : 1340/2380/1340 causal constraints (skipped 0 transitions) in 113 ms.
[2024-05-22 03:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:21:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-22 03:21:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 03:21:11] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2024-05-22 03:21:11] [INFO ] Computed and/alt/rep : 1340/2380/1340 causal constraints (skipped 0 transitions) in 130 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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-22 03:21:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 890 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1700/1700 transitions.
Applied a total of 0 rules in 9 ms. Remains 1000 /1000 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-05-22 03:21:24] [INFO ] Invariant cache hit.
[2024-05-22 03:21:24] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-22 03:21:24] [INFO ] Invariant cache hit.
[2024-05-22 03:21:25] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
[2024-05-22 03:21:25] [INFO ] Invariant cache hit.
[2024-05-22 03:21:27] [INFO ] Dead Transitions using invariants and state equation in 1837 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3100 ms. Remains : 1000/1000 places, 1700/1700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 337 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Finished random walk after 50 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 424 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
[2024-05-22 03:21:29] [INFO ] Invariant cache hit.
[2024-05-22 03:21:30] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-05-22 03:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 03:21:31] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2024-05-22 03:21:31] [INFO ] Computed and/alt/rep : 1340/2380/1340 causal constraints (skipped 0 transitions) in 126 ms.
[2024-05-22 03:21:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:21:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-22 03:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 03:21:33] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2024-05-22 03:21:34] [INFO ] Computed and/alt/rep : 1340/2380/1340 causal constraints (skipped 0 transitions) in 124 ms.
[2024-05-22 03:21:47] [INFO ] Added : 420 causal constraints over 84 iterations in 13284 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4 reset in 2929 ms.
Product exploration explored 100000 steps with 17 reset in 3088 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 890 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1700/1700 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 1700
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 10 place count 1000 transition count 1700
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 20 place count 1000 transition count 1700
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 30 place count 990 transition count 1690
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 40 place count 990 transition count 1690
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 110 place count 990 transition count 1690
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 120 place count 990 transition count 1680
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 180 place count 930 transition count 1620
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 240 place count 930 transition count 1620
Deduced a syphon composed of 20 places in 1 ms
Applied a total of 240 rules in 98 ms. Remains 930 /1000 variables (removed 70) and now considering 1620/1700 (removed 80) transitions.
[2024-05-22 03:21:54] [INFO ] Redundant transitions in 122 ms returned []
// Phase 1: matrix 1620 rows 930 cols
[2024-05-22 03:21:54] [INFO ] Computed 10 invariants in 14 ms
[2024-05-22 03:21:55] [INFO ] Dead Transitions using invariants and state equation in 1097 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 930/1000 places, 1620/1700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1336 ms. Remains : 930/1000 places, 1620/1700 transitions.
Built C files in :
/tmp/ltsmin3805139729619317161
[2024-05-22 03:21:55] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3805139729619317161
Running compilation step : cd /tmp/ltsmin3805139729619317161;'/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/ltsmin3805139729619317161;'/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/ltsmin3805139729619317161;'/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 890 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1700/1700 transitions.
Applied a total of 0 rules in 6 ms. Remains 1000 /1000 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
// Phase 1: matrix 1700 rows 1000 cols
[2024-05-22 03:21:58] [INFO ] Computed 10 invariants in 13 ms
[2024-05-22 03:21:58] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-22 03:21:58] [INFO ] Invariant cache hit.
[2024-05-22 03:21:59] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
[2024-05-22 03:21:59] [INFO ] Invariant cache hit.
[2024-05-22 03:22:00] [INFO ] Dead Transitions using invariants and state equation in 1382 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2609 ms. Remains : 1000/1000 places, 1700/1700 transitions.
Built C files in :
/tmp/ltsmin3797264530199064896
[2024-05-22 03:22:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3797264530199064896
Running compilation step : cd /tmp/ltsmin3797264530199064896;'/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/ltsmin3797264530199064896;'/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/ltsmin3797264530199064896;'/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-22 03:22:04] [INFO ] Flatten gal took : 63 ms
[2024-05-22 03:22:04] [INFO ] Flatten gal took : 53 ms
[2024-05-22 03:22:04] [INFO ] Time to serialize gal into /tmp/LTL14822065335224874854.gal : 16 ms
[2024-05-22 03:22:04] [INFO ] Time to serialize properties into /tmp/LTL12346156544115411005.prop : 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/LTL14822065335224874854.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7579307951960929198.hoa' '-atoms' '/tmp/LTL12346156544115411005.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12346156544115411005.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7579307951960929198.hoa
Detected timeout of ITS tools.
[2024-05-22 03:22:19] [INFO ] Flatten gal took : 71 ms
[2024-05-22 03:22:19] [INFO ] Flatten gal took : 54 ms
[2024-05-22 03:22:19] [INFO ] Time to serialize gal into /tmp/LTL286202099684834361.gal : 9 ms
[2024-05-22 03:22:19] [INFO ] Time to serialize properties into /tmp/LTL3639993365040630614.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL286202099684834361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3639993365040630614.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...274
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("(((((((((((TrainState_1_2_13==1)||(TrainState_3_2_12==1))||((TrainState_5_2_11==1)||(TrainState_3_1_40==1)))||(((TrainSta...46149
Formula 0 simplified : XF(GF!"(((((((((((TrainState_1_2_13==1)||(TrainState_3_2_12==1))||((TrainState_5_2_11==1)||(TrainState_3_1_40==1)))||(((TrainState_5...46141
Detected timeout of ITS tools.
[2024-05-22 03:22:34] [INFO ] Flatten gal took : 52 ms
[2024-05-22 03:22:34] [INFO ] Applying decomposition
[2024-05-22 03:22:34] [INFO ] Flatten gal took : 53 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/graph17647371548403831522.txt' '-o' '/tmp/graph17647371548403831522.bin' '-w' '/tmp/graph17647371548403831522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17647371548403831522.bin' '-l' '-1' '-v' '-w' '/tmp/graph17647371548403831522.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:22:34] [INFO ] Decomposing Gal with order
[2024-05-22 03:22:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:22:35] [INFO ] Removed a total of 276 redundant transitions.
[2024-05-22 03:22:35] [INFO ] Flatten gal took : 183 ms
[2024-05-22 03:22:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 19 ms.
[2024-05-22 03:22:35] [INFO ] Time to serialize gal into /tmp/LTL15125569920407504378.gal : 21 ms
[2024-05-22 03:22:35] [INFO ] Time to serialize properties into /tmp/LTL6385608427638372170.ltl : 7 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/LTL15125569920407504378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6385608427638372170.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((F(G("(((((((((((i0.i0.u8.TrainState_1_2_13==1)||(i2.i0.u21.TrainState_3_2_12==1))||((i8.i1.u19.TrainState_5_2_11==1)||(i2.i0.u...64646
Formula 0 simplified : XF(GF!"(((((((((((i0.i0.u8.TrainState_1_2_13==1)||(i2.i0.u21.TrainState_3_2_12==1))||((i8.i1.u19.TrainState_5_2_11==1)||(i2.i0.u21.T...64638
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
108 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.25154,41600,1,0,31956,16466,11063,83240,2849,35321,67975
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-010-LTLFireability-04 finished in 100669 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(p1))||p0)))'
Support contains 690 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1290 transition count 1990
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1290 transition count 1990
Applied a total of 60 rules in 575 ms. Remains 1290 /1320 variables (removed 30) and now considering 1990/2020 (removed 30) transitions.
// Phase 1: matrix 1990 rows 1290 cols
[2024-05-22 03:22:37] [INFO ] Computed 10 invariants in 9 ms
[2024-05-22 03:22:38] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-22 03:22:38] [INFO ] Invariant cache hit.
[2024-05-22 03:22:39] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
[2024-05-22 03:22:39] [INFO ] Invariant cache hit.
[2024-05-22 03:22:40] [INFO ] Dead Transitions using invariants and state equation in 1554 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1290/1320 places, 1990/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3444 ms. Remains : 1290/1320 places, 1990/2020 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s1070 1) (EQ s666 1) (EQ s430 1) (EQ s1119 1) (EQ s709 1) (EQ s516 1) (EQ s310 1) (EQ s559 1) (EQ s35 1) (EQ s1286 1) (EQ s142 1) (EQ s623 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2496 ms.
Product exploration explored 100000 steps with 50000 reset in 2628 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-06 finished in 8809 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(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||(!p1&&(X(p0) U ((p1&&X(p0))||X(G(p0))))))))))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 320 places :
Symmetric choice reduction at 0 with 320 rule applications. Total rules 320 place count 1000 transition count 1700
Iterating global reduction 0 with 320 rules applied. Total rules applied 640 place count 1000 transition count 1700
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 909 place count 731 transition count 1431
Iterating global reduction 0 with 269 rules applied. Total rules applied 1178 place count 731 transition count 1431
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1218 place count 691 transition count 1391
Iterating global reduction 0 with 40 rules applied. Total rules applied 1258 place count 691 transition count 1391
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1288 place count 661 transition count 1361
Iterating global reduction 0 with 30 rules applied. Total rules applied 1318 place count 661 transition count 1361
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1348 place count 631 transition count 1331
Iterating global reduction 0 with 30 rules applied. Total rules applied 1378 place count 631 transition count 1331
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1408 place count 601 transition count 1301
Iterating global reduction 0 with 30 rules applied. Total rules applied 1438 place count 601 transition count 1301
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1468 place count 571 transition count 1271
Iterating global reduction 0 with 30 rules applied. Total rules applied 1498 place count 571 transition count 1271
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1528 place count 541 transition count 1241
Iterating global reduction 0 with 30 rules applied. Total rules applied 1558 place count 541 transition count 1241
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1578 place count 521 transition count 1221
Iterating global reduction 0 with 20 rules applied. Total rules applied 1598 place count 521 transition count 1221
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1618 place count 501 transition count 1201
Iterating global reduction 0 with 20 rules applied. Total rules applied 1638 place count 501 transition count 1201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1648 place count 491 transition count 1191
Iterating global reduction 0 with 10 rules applied. Total rules applied 1658 place count 491 transition count 1191
Applied a total of 1658 rules in 497 ms. Remains 491 /1320 variables (removed 829) and now considering 1191/2020 (removed 829) transitions.
// Phase 1: matrix 1191 rows 491 cols
[2024-05-22 03:22:46] [INFO ] Computed 10 invariants in 8 ms
[2024-05-22 03:22:46] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 03:22:46] [INFO ] Invariant cache hit.
[2024-05-22 03:22:47] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2024-05-22 03:22:47] [INFO ] Invariant cache hit.
[2024-05-22 03:22:47] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 491/1320 places, 1191/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1734 ms. Remains : 491/1320 places, 1191/2020 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Running random walk in product with property : BART-PT-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={1} source=1 dest: 1}, { cond=true, acceptance={0, 1} source=1 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s340 1), p0:(NEQ s7 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12790 reset in 1628 ms.
Product exploration explored 100000 steps with 12825 reset in 1710 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 288 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 03:22:52] [INFO ] Invariant cache hit.
[2024-05-22 03:22:52] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-22 03:22:52] [INFO ] After 649ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 03:22:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-22 03:22:53] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 03:22:53] [INFO ] After 605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-22 03:22:53] [INFO ] After 808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 495 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (NOT p0), (NOT p0), false]
[2024-05-22 03:22:54] [INFO ] Invariant cache hit.
[2024-05-22 03:22:54] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 460 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-09 finished in 9532 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||X((p1||F(G(p2))))))))'
Support contains 4 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 318 places :
Symmetric choice reduction at 0 with 318 rule applications. Total rules 318 place count 1002 transition count 1702
Iterating global reduction 0 with 318 rules applied. Total rules applied 636 place count 1002 transition count 1702
Discarding 268 places :
Symmetric choice reduction at 0 with 268 rule applications. Total rules 904 place count 734 transition count 1434
Iterating global reduction 0 with 268 rules applied. Total rules applied 1172 place count 734 transition count 1434
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1211 place count 695 transition count 1395
Iterating global reduction 0 with 39 rules applied. Total rules applied 1250 place count 695 transition count 1395
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1279 place count 666 transition count 1366
Iterating global reduction 0 with 29 rules applied. Total rules applied 1308 place count 666 transition count 1366
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1336 place count 638 transition count 1338
Iterating global reduction 0 with 28 rules applied. Total rules applied 1364 place count 638 transition count 1338
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1392 place count 610 transition count 1310
Iterating global reduction 0 with 28 rules applied. Total rules applied 1420 place count 610 transition count 1310
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1448 place count 582 transition count 1282
Iterating global reduction 0 with 28 rules applied. Total rules applied 1476 place count 582 transition count 1282
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1504 place count 554 transition count 1254
Iterating global reduction 0 with 28 rules applied. Total rules applied 1532 place count 554 transition count 1254
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 1550 place count 536 transition count 1236
Iterating global reduction 0 with 18 rules applied. Total rules applied 1568 place count 536 transition count 1236
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 1586 place count 518 transition count 1218
Iterating global reduction 0 with 18 rules applied. Total rules applied 1604 place count 518 transition count 1218
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 1612 place count 510 transition count 1210
Iterating global reduction 0 with 8 rules applied. Total rules applied 1620 place count 510 transition count 1210
Applied a total of 1620 rules in 317 ms. Remains 510 /1320 variables (removed 810) and now considering 1210/2020 (removed 810) transitions.
// Phase 1: matrix 1210 rows 510 cols
[2024-05-22 03:22:55] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 03:22:55] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 03:22:55] [INFO ] Invariant cache hit.
[2024-05-22 03:22:56] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-05-22 03:22:56] [INFO ] Invariant cache hit.
[2024-05-22 03:22:57] [INFO ] Dead Transitions using invariants and state equation in 975 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 510/1320 places, 1210/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1932 ms. Remains : 510/1320 places, 1210/2020 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BART-PT-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s178 0), p1:(EQ s93 0), p2:(OR (EQ s50 0) (EQ s11 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 38 reset in 254 ms.
Product exploration explored 100000 steps with 21 reset in 293 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), true, (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 106 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), true, (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 352 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 1210/1210 transitions.
Applied a total of 0 rules in 11 ms. Remains 510 /510 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
[2024-05-22 03:22:59] [INFO ] Invariant cache hit.
[2024-05-22 03:22:59] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 03:22:59] [INFO ] Invariant cache hit.
[2024-05-22 03:23:00] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2024-05-22 03:23:00] [INFO ] Invariant cache hit.
[2024-05-22 03:23:01] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1587 ms. Remains : 510/510 places, 1210/1210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), true, (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 5681 steps, including 1 resets, run visited all 3 properties in 24 ms. (steps per millisecond=236 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), true, (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 290 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 38 reset in 405 ms.
Product exploration explored 100000 steps with 45 reset in 331 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 1210/1210 transitions.
Graph (trivial) has 1200 edges and 510 vertex of which 440 / 510 are part of one of the 9 SCC in 2 ms
Free SCC test removed 431 places
Ensure Unique test removed 1042 transitions
Reduce isomorphic transitions removed 1042 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 73 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 73 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 73 transition count 161
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 73 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 72 transition count 160
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 72 transition count 160
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 38 place count 72 transition count 161
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 55 place count 72 transition count 144
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 77 place count 50 transition count 122
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 22 rules applied. Total rules applied 99 place count 50 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 50 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 49 transition count 119
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 49 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 49 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 107 place count 49 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 108 place count 48 transition count 116
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 48 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 48 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 112 place count 48 transition count 114
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 113 place count 47 transition count 113
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 47 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 115 place count 47 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 117 place count 47 transition count 111
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 118 place count 46 transition count 110
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 119 place count 46 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 120 place count 46 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 122 place count 46 transition count 108
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 123 place count 45 transition count 107
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 124 place count 45 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 125 place count 45 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 127 place count 45 transition count 105
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 128 place count 44 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 129 place count 44 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 130 place count 44 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 132 place count 44 transition count 102
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 133 place count 43 transition count 101
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 134 place count 43 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 135 place count 43 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 137 place count 43 transition count 99
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 138 place count 42 transition count 98
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 139 place count 42 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 140 place count 42 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 142 place count 42 transition count 96
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 143 place count 41 transition count 95
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 144 place count 41 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 145 place count 41 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 147 place count 41 transition count 93
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 148 place count 40 transition count 92
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 149 place count 40 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 150 place count 40 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 152 place count 40 transition count 90
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 153 place count 39 transition count 89
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 154 place count 39 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 155 place count 39 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 157 place count 39 transition count 87
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 158 place count 38 transition count 86
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 159 place count 38 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 160 place count 38 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 162 place count 38 transition count 84
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 163 place count 37 transition count 83
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 164 place count 37 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 165 place count 37 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 167 place count 37 transition count 81
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 168 place count 36 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 169 place count 36 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 170 place count 36 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 172 place count 36 transition count 78
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 173 place count 35 transition count 77
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 174 place count 35 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 175 place count 35 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 177 place count 35 transition count 75
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 178 place count 34 transition count 74
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 179 place count 34 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 180 place count 34 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 182 place count 34 transition count 72
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 183 place count 33 transition count 71
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 184 place count 33 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 185 place count 33 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 187 place count 33 transition count 69
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 188 place count 32 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 189 place count 32 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 190 place count 32 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 192 place count 32 transition count 66
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 193 place count 31 transition count 65
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 194 place count 31 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 195 place count 31 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 197 place count 31 transition count 63
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 198 place count 30 transition count 62
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 199 place count 30 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 200 place count 30 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 202 place count 30 transition count 60
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 203 place count 29 transition count 59
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 204 place count 29 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 205 place count 29 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 207 place count 29 transition count 57
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 208 place count 28 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 209 place count 28 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 210 place count 28 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 212 place count 28 transition count 54
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 213 place count 27 transition count 53
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 214 place count 27 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 215 place count 27 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 217 place count 27 transition count 51
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 218 place count 26 transition count 50
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 219 place count 26 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 220 place count 26 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 222 place count 26 transition count 48
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 223 place count 25 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 224 place count 25 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 225 place count 25 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 227 place count 25 transition count 45
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 228 place count 24 transition count 44
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 229 place count 24 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 230 place count 24 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 232 place count 24 transition count 42
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 233 place count 23 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 234 place count 23 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 235 place count 23 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 237 place count 23 transition count 39
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 238 place count 22 transition count 38
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 239 place count 22 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 240 place count 22 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 242 place count 22 transition count 36
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 243 place count 21 transition count 35
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 244 place count 21 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 245 place count 21 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 247 place count 21 transition count 33
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 248 place count 20 transition count 32
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 249 place count 20 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 250 place count 20 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 252 place count 20 transition count 30
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 253 place count 19 transition count 29
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 254 place count 19 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 255 place count 19 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 257 place count 19 transition count 27
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 258 place count 18 transition count 26
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 259 place count 18 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 260 place count 18 transition count 26
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 262 place count 18 transition count 24
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 263 place count 17 transition count 23
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 264 place count 17 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 265 place count 17 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 267 place count 17 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 267 place count 17 transition count 21
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 268 place count 17 transition count 21
Discarding 4 places :
Symmetric choice reduction at 37 with 4 rule applications. Total rules 272 place count 13 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 4 rules applied. Total rules applied 276 place count 13 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 37 with 3 rules applied. Total rules applied 279 place count 13 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 2 Pre rules applied. Total rules applied 279 place count 13 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 281 place count 13 transition count 14
Discarding 2 places :
Symmetric choice reduction at 37 with 2 rule applications. Total rules 283 place count 11 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 285 place count 11 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 285 rules in 153 ms. Remains 11 /510 variables (removed 499) and now considering 12/1210 (removed 1198) transitions.
[2024-05-22 03:23:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 11 cols
[2024-05-22 03:23:03] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 03:23:03] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/510 places, 12/1210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 11/510 places, 12/1210 transitions.
Built C files in :
/tmp/ltsmin8725752863422891758
[2024-05-22 03:23:03] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8725752863422891758
Running compilation step : cd /tmp/ltsmin8725752863422891758;'/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/ltsmin8725752863422891758;'/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/ltsmin8725752863422891758;'/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 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 1210/1210 transitions.
Applied a total of 0 rules in 15 ms. Remains 510 /510 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
// Phase 1: matrix 1210 rows 510 cols
[2024-05-22 03:23:06] [INFO ] Computed 10 invariants in 8 ms
[2024-05-22 03:23:06] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 03:23:06] [INFO ] Invariant cache hit.
[2024-05-22 03:23:07] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2024-05-22 03:23:07] [INFO ] Invariant cache hit.
[2024-05-22 03:23:08] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1884 ms. Remains : 510/510 places, 1210/1210 transitions.
Built C files in :
/tmp/ltsmin18226222218014999392
[2024-05-22 03:23:08] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18226222218014999392
Running compilation step : cd /tmp/ltsmin18226222218014999392;'/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/ltsmin18226222218014999392;'/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/ltsmin18226222218014999392;'/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-22 03:23:11] [INFO ] Flatten gal took : 26 ms
[2024-05-22 03:23:11] [INFO ] Flatten gal took : 32 ms
[2024-05-22 03:23:11] [INFO ] Time to serialize gal into /tmp/LTL5307210055203297416.gal : 7 ms
[2024-05-22 03:23:11] [INFO ] Time to serialize properties into /tmp/LTL10672769222757361988.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/LTL5307210055203297416.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6986066393278653899.hoa' '-atoms' '/tmp/LTL10672769222757361988.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/LTL10672769222757361988.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6986066393278653899.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
360 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.69889,84988,1,0,62,408649,34,36,13528,208180,187
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-010-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BART-PT-010-LTLFireability-10 finished in 20240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p1)||X(F(p2))))))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 319 places :
Symmetric choice reduction at 0 with 319 rule applications. Total rules 319 place count 1001 transition count 1701
Iterating global reduction 0 with 319 rules applied. Total rules applied 638 place count 1001 transition count 1701
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 907 place count 732 transition count 1432
Iterating global reduction 0 with 269 rules applied. Total rules applied 1176 place count 732 transition count 1432
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1215 place count 693 transition count 1393
Iterating global reduction 0 with 39 rules applied. Total rules applied 1254 place count 693 transition count 1393
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1284 place count 663 transition count 1363
Iterating global reduction 0 with 30 rules applied. Total rules applied 1314 place count 663 transition count 1363
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1344 place count 633 transition count 1333
Iterating global reduction 0 with 30 rules applied. Total rules applied 1374 place count 633 transition count 1333
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1404 place count 603 transition count 1303
Iterating global reduction 0 with 30 rules applied. Total rules applied 1434 place count 603 transition count 1303
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1463 place count 574 transition count 1274
Iterating global reduction 0 with 29 rules applied. Total rules applied 1492 place count 574 transition count 1274
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1521 place count 545 transition count 1245
Iterating global reduction 0 with 29 rules applied. Total rules applied 1550 place count 545 transition count 1245
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1569 place count 526 transition count 1226
Iterating global reduction 0 with 19 rules applied. Total rules applied 1588 place count 526 transition count 1226
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1607 place count 507 transition count 1207
Iterating global reduction 0 with 19 rules applied. Total rules applied 1626 place count 507 transition count 1207
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 1635 place count 498 transition count 1198
Iterating global reduction 0 with 9 rules applied. Total rules applied 1644 place count 498 transition count 1198
Applied a total of 1644 rules in 147 ms. Remains 498 /1320 variables (removed 822) and now considering 1198/2020 (removed 822) transitions.
// Phase 1: matrix 1198 rows 498 cols
[2024-05-22 03:23:15] [INFO ] Computed 10 invariants in 8 ms
[2024-05-22 03:23:15] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-22 03:23:15] [INFO ] Invariant cache hit.
[2024-05-22 03:23:16] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2024-05-22 03:23:16] [INFO ] Invariant cache hit.
[2024-05-22 03:23:17] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 498/1320 places, 1198/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1818 ms. Remains : 498/1320 places, 1198/2020 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=1, aps=[p2:(EQ s140 1), p0:(EQ s16 1), p1:(EQ s140 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 151 reset in 368 ms.
Product exploration explored 100000 steps with 159 reset in 381 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 183 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 03:23:19] [INFO ] Invariant cache hit.
[2024-05-22 03:23:19] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 03:23:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-22 03:23:19] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p1 (NOT p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 26 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-11 finished in 3761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 2018 edges and 1320 vertex of which 1188 / 1320 are part of one of the 9 SCC in 1 ms
Free SCC test removed 1179 places
Ensure Unique test removed 1809 transitions
Reduce isomorphic transitions removed 1809 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 137 place count 68 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 137 place count 68 transition count 135
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 145 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 151 place count 58 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 162 place count 54 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 166 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 51 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 175 place count 48 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 178 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 46 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 44 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 43 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 202 place count 36 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 206 place count 36 transition count 102
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 4 with 4 rules applied. Total rules applied 210 place count 34 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 214 place count 34 transition count 96
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 5 with 4 rules applied. Total rules applied 218 place count 32 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 222 place count 32 transition count 90
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 6 with 4 rules applied. Total rules applied 226 place count 30 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 230 place count 30 transition count 84
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 7 with 4 rules applied. Total rules applied 234 place count 28 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 238 place count 28 transition count 78
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 8 with 4 rules applied. Total rules applied 242 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 246 place count 26 transition count 72
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 9 with 4 rules applied. Total rules applied 250 place count 24 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 254 place count 24 transition count 66
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 10 with 4 rules applied. Total rules applied 258 place count 22 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 262 place count 22 transition count 60
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 11 with 4 rules applied. Total rules applied 266 place count 20 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 270 place count 20 transition count 54
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 12 with 4 rules applied. Total rules applied 274 place count 18 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 278 place count 18 transition count 48
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 13 with 4 rules applied. Total rules applied 282 place count 16 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 286 place count 16 transition count 42
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 14 with 4 rules applied. Total rules applied 290 place count 14 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 294 place count 14 transition count 36
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 15 with 4 rules applied. Total rules applied 298 place count 12 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 302 place count 12 transition count 30
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 16 with 4 rules applied. Total rules applied 306 place count 10 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 310 place count 10 transition count 24
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 17 with 4 rules applied. Total rules applied 314 place count 8 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 318 place count 8 transition count 18
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 18 with 4 rules applied. Total rules applied 322 place count 6 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 326 place count 6 transition count 12
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 19 with 4 rules applied. Total rules applied 330 place count 4 transition count 10
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 335 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 337 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 337 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 339 place count 2 transition count 3
Applied a total of 339 rules in 37 ms. Remains 2 /1320 variables (removed 1318) and now considering 3/2020 (removed 2017) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 03:23:19] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 03:23:19] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 03:23:19] [INFO ] Invariant cache hit.
[2024-05-22 03:23:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-22 03:23:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 03:23:19] [INFO ] Invariant cache hit.
[2024-05-22 03:23:19] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1320 places, 3/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 2/1320 places, 3/2020 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-15 finished in 191 ms.
All properties solved by simple procedures.
Total runtime 185722 ms.

BK_STOP 1716348200890

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-010.tgz
mv BART-PT-010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;