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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 66M
-rw-r--r-- 1 mcc users 1.3M Apr 12 23:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 23:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 12 21:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.9M Apr 12 21:47 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 1.4M Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1008K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8M Apr 13 03:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14M Apr 13 03:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1M Apr 13 00:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14M Apr 13 00:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 97K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 195K 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 7.1M 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-030-LTLFireability-00
FORMULA_NAME BART-PT-030-LTLFireability-01
FORMULA_NAME BART-PT-030-LTLFireability-02
FORMULA_NAME BART-PT-030-LTLFireability-03
FORMULA_NAME BART-PT-030-LTLFireability-04
FORMULA_NAME BART-PT-030-LTLFireability-05
FORMULA_NAME BART-PT-030-LTLFireability-06
FORMULA_NAME BART-PT-030-LTLFireability-07
FORMULA_NAME BART-PT-030-LTLFireability-08
FORMULA_NAME BART-PT-030-LTLFireability-09
FORMULA_NAME BART-PT-030-LTLFireability-10
FORMULA_NAME BART-PT-030-LTLFireability-11
FORMULA_NAME BART-PT-030-LTLFireability-12
FORMULA_NAME BART-PT-030-LTLFireability-13
FORMULA_NAME BART-PT-030-LTLFireability-14
FORMULA_NAME BART-PT-030-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716348871123

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-030
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 03:34:34] [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:34:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:34:35] [INFO ] Load time of PNML (sax parser for PT used): 733 ms
[2024-05-22 03:34:35] [INFO ] Transformed 4170 places.
[2024-05-22 03:34:35] [INFO ] Transformed 6060 transitions.
[2024-05-22 03:34:35] [INFO ] Found NUPN structural information;
[2024-05-22 03:34:35] [INFO ] Parsed PT model containing 4170 places and 6060 transitions and 48600 arcs in 926 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 193 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-030-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2371 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 332 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
// Phase 1: matrix 6060 rows 3960 cols
[2024-05-22 03:34:36] [INFO ] Computed 30 invariants in 97 ms
[2024-05-22 03:34:37] [INFO ] Implicit Places using invariants in 1420 ms returned []
[2024-05-22 03:34:37] [INFO ] Invariant cache hit.
[2024-05-22 03:34:38] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
[2024-05-22 03:34:38] [INFO ] Invariant cache hit.
[2024-05-22 03:34:39] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3703 ms. Remains : 3960/3960 places, 6060/6060 transitions.
Support contains 2371 out of 3960 places after structural reductions.
[2024-05-22 03:34:40] [INFO ] Flatten gal took : 459 ms
[2024-05-22 03:34:41] [INFO ] Flatten gal took : 285 ms
[2024-05-22 03:34:42] [INFO ] Input system was already deterministic with 6060 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 19) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 03:34:43] [INFO ] Invariant cache hit.
[2024-05-22 03:34:46] [INFO ] [Real]Absence check using 30 positive place invariants in 51 ms returned sat
[2024-05-22 03:34:50] [INFO ] After 4147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 03:34:51] [INFO ] After 4707ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 335 ms.
[2024-05-22 03:34:51] [INFO ] After 6625ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 293 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 23 ms.
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' '!((!p0 U G((p1&&(X(X(G(p3)))||p2)))))'
Support contains 2370 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 257 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
[2024-05-22 03:34:52] [INFO ] Invariant cache hit.
[2024-05-22 03:34:53] [INFO ] Implicit Places using invariants in 953 ms returned []
[2024-05-22 03:34:53] [INFO ] Invariant cache hit.
[2024-05-22 03:34:54] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
[2024-05-22 03:34:54] [INFO ] Invariant cache hit.
[2024-05-22 03:34:55] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3089 ms. Remains : 3960/3960 places, 6060/6060 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 740 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p3), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : BART-PT-030-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 4}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 7}, { cond=(AND p1 p0), acceptance={} source=4 dest: 8}], [{ cond=(NOT p3), acceptance={} source=5 dest: 1}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={1} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=6 dest: 2}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0) p3), acceptance={0} source=6 dest: 7}, { cond=(AND p1 p0 p3), acceptance={} source=6 dest: 8}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 1} source=7 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0) p3), acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p1 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 5}, { cond=(AND p1 p3), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (EQ s9 1) (EQ s28 1) (EQ s4 1) (EQ s1 1) (EQ s22 1) (EQ s20 1) (EQ s14 1) (EQ s24 1) (EQ s8 1) (EQ s7 1) (EQ s5 1) (EQ s27 1) (EQ s10 1) (EQ s26 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 106 steps with 0 reset in 31 ms.
FORMULA BART-PT-030-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-01 finished in 4041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (p0 U G(p2))))'
Support contains 330 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Drop transitions removed 1710 transitions
Trivial Post-agglo rules discarded 1710 transitions
Performed 1710 trivial Post agglomeration. Transition count delta: 1710
Iterating post reduction 0 with 1710 rules applied. Total rules applied 1710 place count 3960 transition count 4350
Reduce places removed 1710 places and 0 transitions.
Iterating post reduction 1 with 1710 rules applied. Total rules applied 3420 place count 2250 transition count 4350
Discarding 150 places :
Symmetric choice reduction at 2 with 150 rule applications. Total rules 3570 place count 2100 transition count 4200
Iterating global reduction 2 with 150 rules applied. Total rules applied 3720 place count 2100 transition count 4200
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 2 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 4620 place count 1650 transition count 3750
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 4650 place count 1650 transition count 3720
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 4710 place count 1620 transition count 3690
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 4740 place count 1620 transition count 3660
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 4800 place count 1590 transition count 3630
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 4830 place count 1590 transition count 3600
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 4 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 4890 place count 1560 transition count 3570
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 4920 place count 1560 transition count 3540
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 4980 place count 1530 transition count 3510
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 5040 place count 1530 transition count 3450
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 5100 place count 1500 transition count 3420
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 7 with 60 rules applied. Total rules applied 5160 place count 1500 transition count 3360
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 8 with 60 rules applied. Total rules applied 5220 place count 1470 transition count 3330
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 8 with 60 rules applied. Total rules applied 5280 place count 1470 transition count 3270
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 60 rules applied. Total rules applied 5340 place count 1440 transition count 3240
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 9 with 60 rules applied. Total rules applied 5400 place count 1440 transition count 3180
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 10 with 60 rules applied. Total rules applied 5460 place count 1410 transition count 3150
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 10 with 60 rules applied. Total rules applied 5520 place count 1410 transition count 3090
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 11 with 60 rules applied. Total rules applied 5580 place count 1380 transition count 3060
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 11 with 60 rules applied. Total rules applied 5640 place count 1380 transition count 3000
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 60 rules applied. Total rules applied 5700 place count 1350 transition count 2970
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 12 with 60 rules applied. Total rules applied 5760 place count 1350 transition count 2910
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 13 with 60 rules applied. Total rules applied 5820 place count 1320 transition count 2880
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 13 with 60 rules applied. Total rules applied 5880 place count 1320 transition count 2820
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 14 with 60 rules applied. Total rules applied 5940 place count 1290 transition count 2790
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 14 with 60 rules applied. Total rules applied 6000 place count 1290 transition count 2730
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 15 with 60 rules applied. Total rules applied 6060 place count 1260 transition count 2700
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 15 with 60 rules applied. Total rules applied 6120 place count 1260 transition count 2640
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 16 with 60 rules applied. Total rules applied 6180 place count 1230 transition count 2610
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 16 with 60 rules applied. Total rules applied 6240 place count 1230 transition count 2550
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 17 with 60 rules applied. Total rules applied 6300 place count 1200 transition count 2520
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 17 with 60 rules applied. Total rules applied 6360 place count 1200 transition count 2460
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 18 with 60 rules applied. Total rules applied 6420 place count 1170 transition count 2430
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 18 with 60 rules applied. Total rules applied 6480 place count 1170 transition count 2370
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 19 with 60 rules applied. Total rules applied 6540 place count 1140 transition count 2340
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 19 with 60 rules applied. Total rules applied 6600 place count 1140 transition count 2280
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 20 with 60 rules applied. Total rules applied 6660 place count 1110 transition count 2250
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 20 with 60 rules applied. Total rules applied 6720 place count 1110 transition count 2190
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 21 with 60 rules applied. Total rules applied 6780 place count 1080 transition count 2160
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 21 with 60 rules applied. Total rules applied 6840 place count 1080 transition count 2100
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 22 with 60 rules applied. Total rules applied 6900 place count 1050 transition count 2070
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 22 with 60 rules applied. Total rules applied 6960 place count 1050 transition count 2010
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 23 with 60 rules applied. Total rules applied 7020 place count 1020 transition count 1980
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 23 with 60 rules applied. Total rules applied 7080 place count 1020 transition count 1920
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 24 with 60 rules applied. Total rules applied 7140 place count 990 transition count 1890
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 24 with 60 rules applied. Total rules applied 7200 place count 990 transition count 1830
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 25 with 60 rules applied. Total rules applied 7260 place count 960 transition count 1800
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 25 with 30 rules applied. Total rules applied 7290 place count 960 transition count 1770
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 26 with 60 rules applied. Total rules applied 7350 place count 930 transition count 1740
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 26 with 30 rules applied. Total rules applied 7380 place count 930 transition count 1710
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 27 with 60 rules applied. Total rules applied 7440 place count 900 transition count 1680
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 27 with 30 rules applied. Total rules applied 7470 place count 900 transition count 1650
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 28 with 60 rules applied. Total rules applied 7530 place count 870 transition count 1620
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 28 with 60 rules applied. Total rules applied 7590 place count 870 transition count 1560
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 29 with 60 rules applied. Total rules applied 7650 place count 840 transition count 1530
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 29 with 60 rules applied. Total rules applied 7710 place count 840 transition count 1470
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 30 with 60 rules applied. Total rules applied 7770 place count 810 transition count 1440
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 30 with 60 rules applied. Total rules applied 7830 place count 810 transition count 1380
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 31 with 60 rules applied. Total rules applied 7890 place count 780 transition count 1350
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 31 with 60 rules applied. Total rules applied 7950 place count 780 transition count 1290
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 32 with 60 rules applied. Total rules applied 8010 place count 750 transition count 1260
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 32 with 30 rules applied. Total rules applied 8040 place count 750 transition count 1230
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 33 with 60 rules applied. Total rules applied 8100 place count 720 transition count 1200
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 33 with 30 rules applied. Total rules applied 8130 place count 720 transition count 1170
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 34 with 60 rules applied. Total rules applied 8190 place count 690 transition count 1140
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 34 with 60 rules applied. Total rules applied 8250 place count 690 transition count 1080
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 35 with 60 rules applied. Total rules applied 8310 place count 660 transition count 1050
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 35 with 60 rules applied. Total rules applied 8370 place count 660 transition count 990
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 36 with 30 rules applied. Total rules applied 8400 place count 660 transition count 960
Partial Post-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 36 with 30 rules applied. Total rules applied 8430 place count 660 transition count 960
Discarding 30 places :
Symmetric choice reduction at 36 with 30 rule applications. Total rules 8460 place count 630 transition count 930
Iterating global reduction 36 with 30 rules applied. Total rules applied 8490 place count 630 transition count 930
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 36 with 30 rules applied. Total rules applied 8520 place count 630 transition count 900
Applied a total of 8520 rules in 3149 ms. Remains 630 /3960 variables (removed 3330) and now considering 900/6060 (removed 5160) transitions.
// Phase 1: matrix 900 rows 630 cols
[2024-05-22 03:34:59] [INFO ] Computed 30 invariants in 5 ms
[2024-05-22 03:34:59] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 03:34:59] [INFO ] Invariant cache hit.
[2024-05-22 03:34:59] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2024-05-22 03:34:59] [INFO ] Redundant transitions in 60 ms returned []
[2024-05-22 03:34:59] [INFO ] Invariant cache hit.
[2024-05-22 03:35:00] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 630/3960 places, 900/6060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4456 ms. Remains : 630/3960 places, 900/6060 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), true, (NOT p2)]
Running random walk in product with property : BART-PT-030-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s30 1) (EQ s31 1) (EQ s32 1) (EQ s33 1) (EQ s34 1) (EQ s35 1) (EQ s36 1) (EQ s37 1) (EQ s39 1) (EQ s38 1) (EQ s41 1) (EQ s40 1) (EQ s43 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 886 ms.
Product exploration explored 100000 steps with 0 reset in 991 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 (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1)))))]
Knowledge based reduction with 9 factoid took 357 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 03:35:06] [INFO ] Invariant cache hit.
[2024-05-22 03:35:07] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-22 03:35:07] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 03:35:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 03:35:10] [INFO ] After 3365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 03:35:13] [INFO ] After 5961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2867 ms.
[2024-05-22 03:35:16] [INFO ] After 9127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (F p2), (F (AND (NOT p0) p2 (NOT p1))), (F (OR (AND p0 p2) (AND p2 p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p2) (NOT p1)))
Knowledge based reduction with 9 factoid took 437 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-030-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-02 finished in 20513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2040 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 3870 transition count 5970
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 3870 transition count 5970
Applied a total of 180 rules in 306 ms. Remains 3870 /3960 variables (removed 90) and now considering 5970/6060 (removed 90) transitions.
// Phase 1: matrix 5970 rows 3870 cols
[2024-05-22 03:35:17] [INFO ] Computed 30 invariants in 47 ms
[2024-05-22 03:35:17] [INFO ] Implicit Places using invariants in 814 ms returned []
[2024-05-22 03:35:17] [INFO ] Invariant cache hit.
[2024-05-22 03:35:18] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
[2024-05-22 03:35:18] [INFO ] Invariant cache hit.
[2024-05-22 03:35:19] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3870/3960 places, 5970/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2587 ms. Remains : 3870/3960 places, 5970/6060 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s199 1) (NEQ s410 1) (NEQ s287 1) (NEQ s513 1) (NEQ s2637 1) (NEQ s3088 1) (NEQ s3093 1) (NEQ s1193 1) (NEQ s2011 1) (NEQ s1178 1) (NEQ s2026...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA BART-PT-030-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-05 finished in 2801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 30 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 960 places :
Symmetric choice reduction at 0 with 960 rule applications. Total rules 960 place count 3000 transition count 5100
Iterating global reduction 0 with 960 rules applied. Total rules applied 1920 place count 3000 transition count 5100
Discarding 810 places :
Symmetric choice reduction at 0 with 810 rule applications. Total rules 2730 place count 2190 transition count 4290
Iterating global reduction 0 with 810 rules applied. Total rules applied 3540 place count 2190 transition count 4290
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3660 place count 2070 transition count 4170
Iterating global reduction 0 with 120 rules applied. Total rules applied 3780 place count 2070 transition count 4170
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3870 place count 1980 transition count 4080
Iterating global reduction 0 with 90 rules applied. Total rules applied 3960 place count 1980 transition count 4080
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4050 place count 1890 transition count 3990
Iterating global reduction 0 with 90 rules applied. Total rules applied 4140 place count 1890 transition count 3990
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4230 place count 1800 transition count 3900
Iterating global reduction 0 with 90 rules applied. Total rules applied 4320 place count 1800 transition count 3900
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4410 place count 1710 transition count 3810
Iterating global reduction 0 with 90 rules applied. Total rules applied 4500 place count 1710 transition count 3810
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4590 place count 1620 transition count 3720
Iterating global reduction 0 with 90 rules applied. Total rules applied 4680 place count 1620 transition count 3720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4740 place count 1560 transition count 3660
Iterating global reduction 0 with 60 rules applied. Total rules applied 4800 place count 1560 transition count 3660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4860 place count 1500 transition count 3600
Iterating global reduction 0 with 60 rules applied. Total rules applied 4920 place count 1500 transition count 3600
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4950 place count 1470 transition count 3570
Iterating global reduction 0 with 30 rules applied. Total rules applied 4980 place count 1470 transition count 3570
Applied a total of 4980 rules in 2128 ms. Remains 1470 /3960 variables (removed 2490) and now considering 3570/6060 (removed 2490) transitions.
// Phase 1: matrix 3570 rows 1470 cols
[2024-05-22 03:35:21] [INFO ] Computed 30 invariants in 13 ms
[2024-05-22 03:35:21] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-22 03:35:22] [INFO ] Invariant cache hit.
[2024-05-22 03:35:22] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
[2024-05-22 03:35:23] [INFO ] Invariant cache hit.
[2024-05-22 03:35:25] [INFO ] Dead Transitions using invariants and state equation in 2729 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1470/3960 places, 3570/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6261 ms. Remains : 1470/3960 places, 3570/6060 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s9 1) (EQ s28 1) (EQ s4 1) (EQ s1 1) (EQ s22 1) (EQ s20 1) (EQ s14 1) (EQ s24 1) (EQ s8 1) (EQ s7 1) (EQ s5 1) (EQ s27 1) (EQ s10 1) (EQ s26 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 2 ms.
FORMULA BART-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-06 finished in 6377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 2070 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 3960 transition count 5970
Reduce places removed 90 places and 0 transitions.
Performed 780 Post agglomeration using F-continuation condition.Transition count delta: 780
Iterating post reduction 1 with 870 rules applied. Total rules applied 960 place count 3870 transition count 5190
Reduce places removed 780 places and 0 transitions.
Iterating post reduction 2 with 780 rules applied. Total rules applied 1740 place count 3090 transition count 5190
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1770 place count 3060 transition count 5160
Iterating global reduction 3 with 30 rules applied. Total rules applied 1800 place count 3060 transition count 5160
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 2040 place count 2940 transition count 5040
Applied a total of 2040 rules in 434 ms. Remains 2940 /3960 variables (removed 1020) and now considering 5040/6060 (removed 1020) transitions.
// Phase 1: matrix 5040 rows 2940 cols
[2024-05-22 03:35:26] [INFO ] Computed 30 invariants in 26 ms
[2024-05-22 03:35:26] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-22 03:35:26] [INFO ] Invariant cache hit.
[2024-05-22 03:35:27] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2024-05-22 03:35:28] [INFO ] Redundant transitions in 738 ms returned []
[2024-05-22 03:35:28] [INFO ] Invariant cache hit.
[2024-05-22 03:35:32] [INFO ] Dead Transitions using invariants and state equation in 4571 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2940/3960 places, 5040/6060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6725 ms. Remains : 2940/3960 places, 5040/6060 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-030-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s199 1) (EQ s380 1) (EQ s287 1) (EQ s453 1) (EQ s2067 1) (EQ s2398 1) (EQ s2403 1) (EQ s1013 1) (EQ s1591 1) (EQ s998 1) (EQ s1606 1) (EQ s2229...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1170 ms.
Product exploration explored 100000 steps with 0 reset in 1330 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 (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 702 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 03:36:07] [INFO ] Invariant cache hit.
[2024-05-22 03:36:10] [INFO ] [Real]Absence check using 30 positive place invariants in 58 ms returned sat
[2024-05-22 03:36:10] [INFO ] After 970ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 03:36:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 56 ms returned sat
[2024-05-22 03:36:14] [INFO ] After 2740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 03:36:14] [INFO ] After 3250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 320 ms.
[2024-05-22 03:36:14] [INFO ] After 4508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 435 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2070 out of 2940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2940/2940 places, 5040/5040 transitions.
Applied a total of 0 rules in 101 ms. Remains 2940 /2940 variables (removed 0) and now considering 5040/5040 (removed 0) transitions.
[2024-05-22 03:36:15] [INFO ] Invariant cache hit.
[2024-05-22 03:36:16] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-22 03:36:16] [INFO ] Invariant cache hit.
[2024-05-22 03:36:16] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
[2024-05-22 03:36:17] [INFO ] Redundant transitions in 446 ms returned []
[2024-05-22 03:36:17] [INFO ] Invariant cache hit.
[2024-05-22 03:36:22] [INFO ] Dead Transitions using invariants and state equation in 5072 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6928 ms. Remains : 2940/2940 places, 5040/5040 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) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 03:36:54] [INFO ] Invariant cache hit.
[2024-05-22 03:36:56] [INFO ] [Real]Absence check using 30 positive place invariants in 56 ms returned sat
[2024-05-22 03:36:56] [INFO ] After 775ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 03:36:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 38 ms returned sat
[2024-05-22 03:37:00] [INFO ] After 2978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 03:37:00] [INFO ] After 3485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 319 ms.
[2024-05-22 03:37:01] [INFO ] After 4672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 435 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 14 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1249 ms.
Product exploration explored 100000 steps with 0 reset in 1360 ms.
Built C files in :
/tmp/ltsmin6134616581682666640
[2024-05-22 03:37:04] [INFO ] Too many transitions (5040) to apply POR reductions. Disabling POR matrices.
[2024-05-22 03:37:04] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6134616581682666640
Running compilation step : cd /tmp/ltsmin6134616581682666640;'/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/ltsmin6134616581682666640;'/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/ltsmin6134616581682666640;'/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 2070 out of 2940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2940/2940 places, 5040/5040 transitions.
Applied a total of 0 rules in 89 ms. Remains 2940 /2940 variables (removed 0) and now considering 5040/5040 (removed 0) transitions.
[2024-05-22 03:37:07] [INFO ] Invariant cache hit.
[2024-05-22 03:37:08] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-05-22 03:37:08] [INFO ] Invariant cache hit.
[2024-05-22 03:37:08] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
[2024-05-22 03:37:09] [INFO ] Redundant transitions in 496 ms returned []
[2024-05-22 03:37:09] [INFO ] Invariant cache hit.
[2024-05-22 03:37:13] [INFO ] Dead Transitions using invariants and state equation in 4135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5921 ms. Remains : 2940/2940 places, 5040/5040 transitions.
Built C files in :
/tmp/ltsmin13604368594411559139
[2024-05-22 03:37:13] [INFO ] Too many transitions (5040) to apply POR reductions. Disabling POR matrices.
[2024-05-22 03:37:13] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13604368594411559139
Running compilation step : cd /tmp/ltsmin13604368594411559139;'/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/ltsmin13604368594411559139;'/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/ltsmin13604368594411559139;'/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:37:16] [INFO ] Flatten gal took : 133 ms
[2024-05-22 03:37:17] [INFO ] Flatten gal took : 137 ms
[2024-05-22 03:37:17] [INFO ] Time to serialize gal into /tmp/LTL674550828882711015.gal : 51 ms
[2024-05-22 03:37:17] [INFO ] Time to serialize properties into /tmp/LTL691908310161444336.prop : 38 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/LTL674550828882711015.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6856449030102553054.hoa' '-atoms' '/tmp/LTL691908310161444336.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL691908310161444336.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6856449030102553054.hoa
Detected timeout of ITS tools.
[2024-05-22 03:37:32] [INFO ] Flatten gal took : 121 ms
[2024-05-22 03:37:32] [INFO ] Flatten gal took : 129 ms
[2024-05-22 03:37:32] [INFO ] Time to serialize gal into /tmp/LTL10915314904128144600.gal : 27 ms
[2024-05-22 03:37:32] [INFO ] Time to serialize properties into /tmp/LTL4691543190636223244.ltl : 24 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/LTL10915314904128144600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4691543190636223244.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((((((TrainState_20_1_5==1)||(TrainState_21_1_8==1))||((TrainState_18_2_6==1)||(TrainState_4_2_9==1)))||(((TrainState_28...190145
Formula 0 simplified : G(F!"((((((((((((((TrainState_20_1_5==1)||(TrainState_21_1_8==1))||((TrainState_18_2_6==1)||(TrainState_4_2_9==1)))||(((TrainState_2...190126
Detected timeout of ITS tools.
[2024-05-22 03:37:48] [INFO ] Flatten gal took : 217 ms
[2024-05-22 03:37:48] [INFO ] Applying decomposition
[2024-05-22 03:37:48] [INFO ] Flatten gal took : 187 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/graph16176107536215090776.txt' '-o' '/tmp/graph16176107536215090776.bin' '-w' '/tmp/graph16176107536215090776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16176107536215090776.bin' '-l' '-1' '-v' '-w' '/tmp/graph16176107536215090776.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:37:48] [INFO ] Decomposing Gal with order
[2024-05-22 03:37:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:37:49] [INFO ] Removed a total of 435 redundant transitions.
[2024-05-22 03:37:50] [INFO ] Flatten gal took : 470 ms
[2024-05-22 03:37:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 32 ms.
[2024-05-22 03:37:50] [INFO ] Time to serialize gal into /tmp/LTL719656919695646135.gal : 37 ms
[2024-05-22 03:37:50] [INFO ] Time to serialize properties into /tmp/LTL3757460349943993358.ltl : 31 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/LTL719656919695646135.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3757460349943993358.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...253
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((((((i11.u73.TrainState_20_1_5==1)||(i23.u107.TrainState_21_1_8==1))||((i25.u72.TrainState_18_2_6==1)||(i0.u55.TrainSta...249077
Formula 0 simplified : G(F!"((((((((((((((i11.u73.TrainState_20_1_5==1)||(i23.u107.TrainState_21_1_8==1))||((i25.u72.TrainState_18_2_6==1)||(i0.u55.TrainSt...249058
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
603 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,6.59479,86040,1,0,103398,22888,31434,132867,4102,67751,233500
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-030-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-030-LTLFireability-07 finished in 151753 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&&(F(p2)||p1)))||F(p3)))'
Support contains 3 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6054 edges and 3960 vertex of which 3564 / 3960 are part of one of the 27 SCC in 5 ms
Free SCC test removed 3537 places
Ensure Unique test removed 5427 transitions
Reduce isomorphic transitions removed 5427 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 218 rules applied. Total rules applied 219 place count 396 transition count 415
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 411 place count 204 transition count 415
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 411 place count 204 transition count 403
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 435 place count 192 transition count 403
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 453 place count 174 transition count 385
Iterating global reduction 2 with 18 rules applied. Total rules applied 471 place count 174 transition count 385
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 474 place count 174 transition count 382
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 486 place count 162 transition count 370
Iterating global reduction 3 with 12 rules applied. Total rules applied 498 place count 162 transition count 370
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 507 place count 153 transition count 361
Iterating global reduction 3 with 9 rules applied. Total rules applied 516 place count 153 transition count 361
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 525 place count 144 transition count 352
Iterating global reduction 3 with 9 rules applied. Total rules applied 534 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 540 place count 138 transition count 346
Iterating global reduction 3 with 6 rules applied. Total rules applied 546 place count 138 transition count 346
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 552 place count 132 transition count 340
Iterating global reduction 3 with 6 rules applied. Total rules applied 558 place count 132 transition count 340
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 561 place count 129 transition count 337
Iterating global reduction 3 with 3 rules applied. Total rules applied 564 place count 129 transition count 337
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 606 place count 108 transition count 316
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 618 place count 108 transition count 304
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 630 place count 102 transition count 298
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 642 place count 102 transition count 286
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 654 place count 96 transition count 280
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 666 place count 96 transition count 268
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 678 place count 90 transition count 262
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 690 place count 90 transition count 250
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 702 place count 84 transition count 244
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 714 place count 84 transition count 232
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 726 place count 78 transition count 226
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 738 place count 78 transition count 214
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 750 place count 72 transition count 208
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 762 place count 72 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 774 place count 66 transition count 190
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 786 place count 66 transition count 178
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 12 rules applied. Total rules applied 798 place count 60 transition count 172
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 810 place count 60 transition count 160
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 822 place count 54 transition count 154
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 834 place count 54 transition count 142
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 13 with 12 rules applied. Total rules applied 846 place count 48 transition count 136
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 858 place count 48 transition count 124
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 14 with 12 rules applied. Total rules applied 870 place count 42 transition count 118
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 14 with 12 rules applied. Total rules applied 882 place count 42 transition count 106
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 894 place count 36 transition count 100
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 906 place count 36 transition count 88
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 16 with 12 rules applied. Total rules applied 918 place count 30 transition count 82
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 16 with 12 rules applied. Total rules applied 930 place count 30 transition count 70
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 17 with 12 rules applied. Total rules applied 942 place count 24 transition count 64
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 17 with 12 rules applied. Total rules applied 954 place count 24 transition count 52
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 18 with 12 rules applied. Total rules applied 966 place count 18 transition count 46
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 18 with 12 rules applied. Total rules applied 978 place count 18 transition count 34
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 19 with 12 rules applied. Total rules applied 990 place count 12 transition count 28
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 19 with 15 rules applied. Total rules applied 1005 place count 12 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 1011 place count 9 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 3 Pre rules applied. Total rules applied 1011 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 21 with 6 rules applied. Total rules applied 1017 place count 6 transition count 7
Applied a total of 1017 rules in 93 ms. Remains 6 /3960 variables (removed 3954) and now considering 7/6060 (removed 6053) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-22 03:37:57] [INFO ] Computed 3 invariants in 1 ms
[2024-05-22 03:37:57] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 03:37:57] [INFO ] Invariant cache hit.
[2024-05-22 03:37:57] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-22 03:37:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 03:37:57] [INFO ] Invariant cache hit.
[2024-05-22 03:37:57] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/3960 places, 7/6060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 6/3960 places, 7/6060 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : BART-PT-030-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s4 0), p3:(EQ s5 1), p1:(OR (EQ s4 0) (EQ s5 0)), p2:(EQ s3 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-030-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-08 finished in 336 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||X(F(p1)))))'
Support contains 2 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2727 place count 2192 transition count 4292
Iterating global reduction 0 with 809 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3656 place count 2072 transition count 4172
Iterating global reduction 0 with 120 rules applied. Total rules applied 3776 place count 2072 transition count 4172
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3866 place count 1982 transition count 4082
Iterating global reduction 0 with 90 rules applied. Total rules applied 3956 place count 1982 transition count 4082
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4046 place count 1892 transition count 3992
Iterating global reduction 0 with 90 rules applied. Total rules applied 4136 place count 1892 transition count 3992
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4226 place count 1802 transition count 3902
Iterating global reduction 0 with 90 rules applied. Total rules applied 4316 place count 1802 transition count 3902
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4406 place count 1712 transition count 3812
Iterating global reduction 0 with 90 rules applied. Total rules applied 4496 place count 1712 transition count 3812
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4586 place count 1622 transition count 3722
Iterating global reduction 0 with 90 rules applied. Total rules applied 4676 place count 1622 transition count 3722
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4736 place count 1562 transition count 3662
Iterating global reduction 0 with 60 rules applied. Total rules applied 4796 place count 1562 transition count 3662
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4856 place count 1502 transition count 3602
Iterating global reduction 0 with 60 rules applied. Total rules applied 4916 place count 1502 transition count 3602
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4946 place count 1472 transition count 3572
Iterating global reduction 0 with 30 rules applied. Total rules applied 4976 place count 1472 transition count 3572
Applied a total of 4976 rules in 1819 ms. Remains 1472 /3960 variables (removed 2488) and now considering 3572/6060 (removed 2488) transitions.
// Phase 1: matrix 3572 rows 1472 cols
[2024-05-22 03:37:59] [INFO ] Computed 30 invariants in 12 ms
[2024-05-22 03:38:00] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-22 03:38:00] [INFO ] Invariant cache hit.
[2024-05-22 03:38:00] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
[2024-05-22 03:38:00] [INFO ] Invariant cache hit.
[2024-05-22 03:38:03] [INFO ] Dead Transitions using invariants and state equation in 2998 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1472/3960 places, 3572/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5940 ms. Remains : 1472/3960 places, 3572/6060 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-030-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s990 1), p1:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 303 reset in 1168 ms.
Product exploration explored 100000 steps with 296 reset in 964 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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 269 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-22 03:38:07] [INFO ] Invariant cache hit.
[2024-05-22 03:38:09] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-030-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-10 finished in 11726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2727 place count 2192 transition count 4292
Iterating global reduction 0 with 809 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3656 place count 2072 transition count 4172
Iterating global reduction 0 with 120 rules applied. Total rules applied 3776 place count 2072 transition count 4172
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3866 place count 1982 transition count 4082
Iterating global reduction 0 with 90 rules applied. Total rules applied 3956 place count 1982 transition count 4082
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4045 place count 1893 transition count 3993
Iterating global reduction 0 with 89 rules applied. Total rules applied 4134 place count 1893 transition count 3993
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4223 place count 1804 transition count 3904
Iterating global reduction 0 with 89 rules applied. Total rules applied 4312 place count 1804 transition count 3904
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4401 place count 1715 transition count 3815
Iterating global reduction 0 with 89 rules applied. Total rules applied 4490 place count 1715 transition count 3815
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4579 place count 1626 transition count 3726
Iterating global reduction 0 with 89 rules applied. Total rules applied 4668 place count 1626 transition count 3726
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4727 place count 1567 transition count 3667
Iterating global reduction 0 with 59 rules applied. Total rules applied 4786 place count 1567 transition count 3667
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4845 place count 1508 transition count 3608
Iterating global reduction 0 with 59 rules applied. Total rules applied 4904 place count 1508 transition count 3608
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 4933 place count 1479 transition count 3579
Iterating global reduction 0 with 29 rules applied. Total rules applied 4962 place count 1479 transition count 3579
Applied a total of 4962 rules in 1755 ms. Remains 1479 /3960 variables (removed 2481) and now considering 3579/6060 (removed 2481) transitions.
// Phase 1: matrix 3579 rows 1479 cols
[2024-05-22 03:38:11] [INFO ] Computed 30 invariants in 13 ms
[2024-05-22 03:38:11] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-22 03:38:11] [INFO ] Invariant cache hit.
[2024-05-22 03:38:12] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2024-05-22 03:38:12] [INFO ] Invariant cache hit.
[2024-05-22 03:38:15] [INFO ] Dead Transitions using invariants and state equation in 2788 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1479/3960 places, 3579/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5642 ms. Remains : 1479/3960 places, 3579/6060 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s270 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4583 ms.
Product exploration explored 100000 steps with 50000 reset in 5051 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-030-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-12 finished in 16308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 2 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 960 places :
Symmetric choice reduction at 0 with 960 rule applications. Total rules 960 place count 3000 transition count 5100
Iterating global reduction 0 with 960 rules applied. Total rules applied 1920 place count 3000 transition count 5100
Discarding 810 places :
Symmetric choice reduction at 0 with 810 rule applications. Total rules 2730 place count 2190 transition count 4290
Iterating global reduction 0 with 810 rules applied. Total rules applied 3540 place count 2190 transition count 4290
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3660 place count 2070 transition count 4170
Iterating global reduction 0 with 120 rules applied. Total rules applied 3780 place count 2070 transition count 4170
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3870 place count 1980 transition count 4080
Iterating global reduction 0 with 90 rules applied. Total rules applied 3960 place count 1980 transition count 4080
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4050 place count 1890 transition count 3990
Iterating global reduction 0 with 90 rules applied. Total rules applied 4140 place count 1890 transition count 3990
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4230 place count 1800 transition count 3900
Iterating global reduction 0 with 90 rules applied. Total rules applied 4320 place count 1800 transition count 3900
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4410 place count 1710 transition count 3810
Iterating global reduction 0 with 90 rules applied. Total rules applied 4500 place count 1710 transition count 3810
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4590 place count 1620 transition count 3720
Iterating global reduction 0 with 90 rules applied. Total rules applied 4680 place count 1620 transition count 3720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4740 place count 1560 transition count 3660
Iterating global reduction 0 with 60 rules applied. Total rules applied 4800 place count 1560 transition count 3660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4860 place count 1500 transition count 3600
Iterating global reduction 0 with 60 rules applied. Total rules applied 4920 place count 1500 transition count 3600
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4950 place count 1470 transition count 3570
Iterating global reduction 0 with 30 rules applied. Total rules applied 4980 place count 1470 transition count 3570
Applied a total of 4980 rules in 1637 ms. Remains 1470 /3960 variables (removed 2490) and now considering 3570/6060 (removed 2490) transitions.
// Phase 1: matrix 3570 rows 1470 cols
[2024-05-22 03:38:27] [INFO ] Computed 30 invariants in 17 ms
[2024-05-22 03:38:27] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-22 03:38:27] [INFO ] Invariant cache hit.
[2024-05-22 03:38:28] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1261 ms to find 0 implicit places.
[2024-05-22 03:38:28] [INFO ] Invariant cache hit.
[2024-05-22 03:38:31] [INFO ] Dead Transitions using invariants and state equation in 2593 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1470/3960 places, 3570/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5498 ms. Remains : 1470/3960 places, 3570/6060 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-030-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s31 1), p1:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 340 steps with 0 reset in 4 ms.
FORMULA BART-PT-030-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-13 finished in 5658 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)) U p0))'
Support contains 1 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6058 edges and 3960 vertex of which 3828 / 3960 are part of one of the 29 SCC in 2 ms
Free SCC test removed 3799 places
Ensure Unique test removed 5829 transitions
Reduce isomorphic transitions removed 5829 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 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 92 rules applied. Total rules applied 93 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 157 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 157 place count 68 transition count 135
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 165 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 171 place count 58 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 177 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 178 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 182 place count 54 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 189 place count 51 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 192 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 48 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 200 place count 46 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 204 place count 44 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 207 place count 43 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 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 222 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 226 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 230 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 234 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 238 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 242 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 246 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 250 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 254 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 258 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 262 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 266 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 270 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 274 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 278 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 282 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 286 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 290 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 294 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 298 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 302 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 306 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 310 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 314 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 318 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 322 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 326 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 330 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 334 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 338 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 342 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 346 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 350 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 355 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 357 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 357 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 359 place count 2 transition count 3
Applied a total of 359 rules in 51 ms. Remains 2 /3960 variables (removed 3958) and now considering 3/6060 (removed 6057) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 03:38:31] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 03:38:31] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 03:38:31] [INFO ] Invariant cache hit.
[2024-05-22 03:38:31] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-22 03:38:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 03:38:31] [INFO ] Invariant cache hit.
[2024-05-22 03:38:31] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/3960 places, 3/6060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 2/3960 places, 3/6060 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-030-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-14 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F(p1)))))'
Support contains 2 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2727 place count 2192 transition count 4292
Iterating global reduction 0 with 809 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3656 place count 2072 transition count 4172
Iterating global reduction 0 with 120 rules applied. Total rules applied 3776 place count 2072 transition count 4172
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 3865 place count 1983 transition count 4083
Iterating global reduction 0 with 89 rules applied. Total rules applied 3954 place count 1983 transition count 4083
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4043 place count 1894 transition count 3994
Iterating global reduction 0 with 89 rules applied. Total rules applied 4132 place count 1894 transition count 3994
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4221 place count 1805 transition count 3905
Iterating global reduction 0 with 89 rules applied. Total rules applied 4310 place count 1805 transition count 3905
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4399 place count 1716 transition count 3816
Iterating global reduction 0 with 89 rules applied. Total rules applied 4488 place count 1716 transition count 3816
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4577 place count 1627 transition count 3727
Iterating global reduction 0 with 89 rules applied. Total rules applied 4666 place count 1627 transition count 3727
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4726 place count 1567 transition count 3667
Iterating global reduction 0 with 60 rules applied. Total rules applied 4786 place count 1567 transition count 3667
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4845 place count 1508 transition count 3608
Iterating global reduction 0 with 59 rules applied. Total rules applied 4904 place count 1508 transition count 3608
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4934 place count 1478 transition count 3578
Iterating global reduction 0 with 30 rules applied. Total rules applied 4964 place count 1478 transition count 3578
Applied a total of 4964 rules in 1968 ms. Remains 1478 /3960 variables (removed 2482) and now considering 3578/6060 (removed 2482) transitions.
// Phase 1: matrix 3578 rows 1478 cols
[2024-05-22 03:38:33] [INFO ] Computed 30 invariants in 11 ms
[2024-05-22 03:38:34] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-22 03:38:34] [INFO ] Invariant cache hit.
[2024-05-22 03:38:35] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
[2024-05-22 03:38:35] [INFO ] Invariant cache hit.
[2024-05-22 03:38:37] [INFO ] Dead Transitions using invariants and state equation in 2646 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1478/3960 places, 3578/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5870 ms. Remains : 1478/3960 places, 3578/6060 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-030-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s510 0), p1:(EQ s59 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 5 reset in 589 ms.
Product exploration explored 100000 steps with 1 reset in 681 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), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 186 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 3845 steps, including 1 resets, run visited all 3 properties in 36 ms. (steps per millisecond=106 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 187 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 1478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1478/1478 places, 3578/3578 transitions.
Applied a total of 0 rules in 125 ms. Remains 1478 /1478 variables (removed 0) and now considering 3578/3578 (removed 0) transitions.
[2024-05-22 03:38:41] [INFO ] Invariant cache hit.
[2024-05-22 03:38:41] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-22 03:38:41] [INFO ] Invariant cache hit.
[2024-05-22 03:38:42] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
[2024-05-22 03:38:42] [INFO ] Invariant cache hit.
[2024-05-22 03:38:46] [INFO ] Dead Transitions using invariants and state equation in 3800 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5327 ms. Remains : 1478/1478 places, 3578/3578 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), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 92 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1170 steps, including 0 resets, run visited all 3 properties in 13 ms. (steps per millisecond=90 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 198 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 833 ms.
Product exploration explored 100000 steps with 1 reset in 968 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 1478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1478/1478 places, 3578/3578 transitions.
Graph (trivial) has 3574 edges and 1478 vertex of which 1421 / 1478 are part of one of the 29 SCC in 1 ms
Free SCC test removed 1392 places
Ensure Unique test removed 3416 transitions
Reduce isomorphic transitions removed 3416 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 58 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 58 transition count 134
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 31 place count 58 transition count 134
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 58 transition count 134
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 57 transition count 133
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 57 transition count 133
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 49 place count 57 transition count 134
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 56 place count 57 transition count 127
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 68 place count 45 transition count 115
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 80 place count 45 transition count 115
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 81 place count 45 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 45 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 44 transition count 112
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 44 transition count 112
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 86 place count 44 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 44 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 89 place count 43 transition count 109
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 43 transition count 109
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 91 place count 43 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 43 transition count 107
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 94 place count 42 transition count 106
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 95 place count 42 transition count 106
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 96 place count 42 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 98 place count 42 transition count 104
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 99 place count 41 transition count 103
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 100 place count 41 transition count 103
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 101 place count 41 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 103 place count 41 transition count 101
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 104 place count 40 transition count 100
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 105 place count 40 transition count 100
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 106 place count 40 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 108 place count 40 transition count 98
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 109 place count 39 transition count 97
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 110 place count 39 transition count 97
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 111 place count 39 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 113 place count 39 transition count 95
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 114 place count 38 transition count 94
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 115 place count 38 transition count 94
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 116 place count 38 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 118 place count 38 transition count 92
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 119 place count 37 transition count 91
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 120 place count 37 transition count 91
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 121 place count 37 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 123 place count 37 transition count 89
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 124 place count 36 transition count 88
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 125 place count 36 transition count 88
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 126 place count 36 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 128 place count 36 transition count 86
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 129 place count 35 transition count 85
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 130 place count 35 transition count 85
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 131 place count 35 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 133 place count 35 transition count 83
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 134 place count 34 transition count 82
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 135 place count 34 transition count 82
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 136 place count 34 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 138 place count 34 transition count 80
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 139 place count 33 transition count 79
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 140 place count 33 transition count 79
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 141 place count 33 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 143 place count 33 transition count 77
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 144 place count 32 transition count 76
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 145 place count 32 transition count 76
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 146 place count 32 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 148 place count 32 transition count 74
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 149 place count 31 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 150 place count 31 transition count 73
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 151 place count 31 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 153 place count 31 transition count 71
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 154 place count 30 transition count 70
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 155 place count 30 transition count 70
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 156 place count 30 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 158 place count 30 transition count 68
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 159 place count 29 transition count 67
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 160 place count 29 transition count 67
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 161 place count 29 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 163 place count 29 transition count 65
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 164 place count 28 transition count 64
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 165 place count 28 transition count 64
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 20 with 1 rules applied. Total rules applied 166 place count 28 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 168 place count 28 transition count 62
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 169 place count 27 transition count 61
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 170 place count 27 transition count 61
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 171 place count 27 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 173 place count 27 transition count 59
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 174 place count 26 transition count 58
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 175 place count 26 transition count 58
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 176 place count 26 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 178 place count 26 transition count 56
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 179 place count 25 transition count 55
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 180 place count 25 transition count 55
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 181 place count 25 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 183 place count 25 transition count 53
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 184 place count 24 transition count 52
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 185 place count 24 transition count 52
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 186 place count 24 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 188 place count 24 transition count 50
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 189 place count 23 transition count 49
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 190 place count 23 transition count 49
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 191 place count 23 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 193 place count 23 transition count 47
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 194 place count 22 transition count 46
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 195 place count 22 transition count 46
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 196 place count 22 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 198 place count 22 transition count 44
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 199 place count 21 transition count 43
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 200 place count 21 transition count 43
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 201 place count 21 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 203 place count 21 transition count 41
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 204 place count 20 transition count 40
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 205 place count 20 transition count 40
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 206 place count 20 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 208 place count 20 transition count 38
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 209 place count 19 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 210 place count 19 transition count 37
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 211 place count 19 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 213 place count 19 transition count 35
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 214 place count 18 transition count 34
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 215 place count 18 transition count 34
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 216 place count 18 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 218 place count 18 transition count 32
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 219 place count 17 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 220 place count 17 transition count 31
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 221 place count 17 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 223 place count 17 transition count 29
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 224 place count 16 transition count 28
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 225 place count 16 transition count 28
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 226 place count 16 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 228 place count 16 transition count 26
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 229 place count 15 transition count 25
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 230 place count 15 transition count 25
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 231 place count 15 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 233 place count 15 transition count 23
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 234 place count 14 transition count 22
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 235 place count 14 transition count 22
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 34 with 1 rules applied. Total rules applied 236 place count 14 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 238 place count 14 transition count 20
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 239 place count 13 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 240 place count 13 transition count 19
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 241 place count 13 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 243 place count 13 transition count 17
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 244 place count 12 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 245 place count 12 transition count 16
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 246 place count 12 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 248 place count 12 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 248 place count 12 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 249 place count 12 transition count 14
Discarding 4 places :
Symmetric choice reduction at 37 with 4 rule applications. Total rules 253 place count 8 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 4 rules applied. Total rules applied 257 place count 8 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 37 with 1 rules applied. Total rules applied 258 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 258 place count 8 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 259 place count 8 transition count 9
Discarding 2 places :
Symmetric choice reduction at 37 with 2 rule applications. Total rules 261 place count 6 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 263 place count 6 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 263 rules in 100 ms. Remains 6 /1478 variables (removed 1472) and now considering 7/3578 (removed 3571) transitions.
[2024-05-22 03:38:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2024-05-22 03:38:51] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 03:38:51] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/1478 places, 7/3578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 6/1478 places, 7/3578 transitions.
Built C files in :
/tmp/ltsmin6004801143503431545
[2024-05-22 03:38:51] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6004801143503431545
Running compilation step : cd /tmp/ltsmin6004801143503431545;'/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/ltsmin6004801143503431545;'/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/ltsmin6004801143503431545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1478/1478 places, 3578/3578 transitions.
Applied a total of 0 rules in 112 ms. Remains 1478 /1478 variables (removed 0) and now considering 3578/3578 (removed 0) transitions.
// Phase 1: matrix 3578 rows 1478 cols
[2024-05-22 03:38:54] [INFO ] Computed 30 invariants in 11 ms
[2024-05-22 03:38:54] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-22 03:38:54] [INFO ] Invariant cache hit.
[2024-05-22 03:38:55] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2024-05-22 03:38:55] [INFO ] Invariant cache hit.
[2024-05-22 03:38:59] [INFO ] Dead Transitions using invariants and state equation in 3429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4604 ms. Remains : 1478/1478 places, 3578/3578 transitions.
Built C files in :
/tmp/ltsmin4127172424046764757
[2024-05-22 03:38:59] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4127172424046764757
Running compilation step : cd /tmp/ltsmin4127172424046764757;'/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/ltsmin4127172424046764757;'/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/ltsmin4127172424046764757;'/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:39:02] [INFO ] Flatten gal took : 61 ms
[2024-05-22 03:39:02] [INFO ] Flatten gal took : 63 ms
[2024-05-22 03:39:02] [INFO ] Time to serialize gal into /tmp/LTL16359918866263042232.gal : 13 ms
[2024-05-22 03:39:02] [INFO ] Time to serialize properties into /tmp/LTL12649060699345923039.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16359918866263042232.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14202568096163944454.hoa' '-atoms' '/tmp/LTL12649060699345923039.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12649060699345923039.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14202568096163944454.hoa
Detected timeout of ITS tools.
[2024-05-22 03:39:17] [INFO ] Flatten gal took : 51 ms
[2024-05-22 03:39:17] [INFO ] Flatten gal took : 54 ms
[2024-05-22 03:39:17] [INFO ] Time to serialize gal into /tmp/LTL4116713740320172004.gal : 12 ms
[2024-05-22 03:39:17] [INFO ] Time to serialize properties into /tmp/LTL5443758985242232155.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4116713740320172004.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5443758985242232155.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(TrainState_3_4_14==0)"))&&(F("(TrainState_30_1_1==0)"))))))
Formula 0 simplified : XG(F!"(TrainState_3_4_14==0)" | G!"(TrainState_30_1_1==0)")
Detected timeout of ITS tools.
[2024-05-22 03:39:32] [INFO ] Flatten gal took : 51 ms
[2024-05-22 03:39:32] [INFO ] Applying decomposition
[2024-05-22 03:39:32] [INFO ] Flatten gal took : 52 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/graph6405754868821120669.txt' '-o' '/tmp/graph6405754868821120669.bin' '-w' '/tmp/graph6405754868821120669.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6405754868821120669.bin' '-l' '-1' '-v' '-w' '/tmp/graph6405754868821120669.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:39:32] [INFO ] Decomposing Gal with order
[2024-05-22 03:39:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:39:33] [INFO ] Removed a total of 1145 redundant transitions.
[2024-05-22 03:39:33] [INFO ] Flatten gal took : 134 ms
[2024-05-22 03:39:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 641 labels/synchronizations in 27 ms.
[2024-05-22 03:39:33] [INFO ] Time to serialize gal into /tmp/LTL5815786251299431249.gal : 20 ms
[2024-05-22 03:39:33] [INFO ] Time to serialize properties into /tmp/LTL9695314389083334806.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5815786251299431249.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9695314389083334806.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(i17.u140.TrainState_3_4_14==0)"))&&(F("(i0.u29.TrainState_30_1_1==0)"))))))
Formula 0 simplified : XG(F!"(i17.u140.TrainState_3_4_14==0)" | G!"(i0.u29.TrainState_30_1_1==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
54 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,0.825086,32800,1,0,5022,1322,2829,6167,609,2725,12679
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-030-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-030-LTLFireability-15 finished in 62278 ms.
All properties solved by simple procedures.
Total runtime 300006 ms.

BK_STOP 1716349175354

--------------------
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-030"
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-030, 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-171620180500298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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