Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990300650.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-PT-060, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990300650
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 4.2K Mar 20 13:27 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 20 13:27 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Jun 8 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Jun 8 09:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 8 09:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 8 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 8 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 20 13:27 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 20 13:27 instance
-rw-r--r-- 1 mcc users 6 Mar 20 13:27 iscolored
-rw-r--r-- 1 mcc users 15M Mar 20 13:27 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-060-00
FORMULA_NAME BART-PT-060-01
FORMULA_NAME BART-PT-060-02
FORMULA_NAME BART-PT-060-03
FORMULA_NAME BART-PT-060-04
FORMULA_NAME BART-PT-060-05
FORMULA_NAME BART-PT-060-06
FORMULA_NAME BART-PT-060-07
FORMULA_NAME BART-PT-060-08
FORMULA_NAME BART-PT-060-09
FORMULA_NAME BART-PT-060-10
FORMULA_NAME BART-PT-060-11
FORMULA_NAME BART-PT-060-12
FORMULA_NAME BART-PT-060-13
FORMULA_NAME BART-PT-060-14
FORMULA_NAME BART-PT-060-15

=== Now, execution of the tool begins

BK_START 1623177546931

Running Version 0
[2021-06-08 18:39:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-08 18:39:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 18:39:09] [INFO ] Load time of PNML (sax parser for PT used): 652 ms
[2021-06-08 18:39:09] [INFO ] Transformed 8130 places.
[2021-06-08 18:39:09] [INFO ] Transformed 12120 transitions.
[2021-06-08 18:39:09] [INFO ] Found NUPN structural information;
[2021-06-08 18:39:09] [INFO ] Parsed PT model containing 8130 places and 12120 transitions in 816 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-06-08 18:39:09] [INFO ] Initial state test concluded for 1 properties.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-060-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 7920 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Discarding 1907 places :
Symmetric choice reduction at 0 with 1907 rule applications. Total rules 1907 place count 6013 transition count 10213
Iterating global reduction 0 with 1907 rules applied. Total rules applied 3814 place count 6013 transition count 10213
Discarding 1600 places :
Symmetric choice reduction at 0 with 1600 rule applications. Total rules 5414 place count 4413 transition count 8613
Iterating global reduction 0 with 1600 rules applied. Total rules applied 7014 place count 4413 transition count 8613
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 7252 place count 4175 transition count 8375
Iterating global reduction 0 with 238 rules applied. Total rules applied 7490 place count 4175 transition count 8375
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 7668 place count 3997 transition count 8197
Iterating global reduction 0 with 178 rules applied. Total rules applied 7846 place count 3997 transition count 8197
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 8024 place count 3819 transition count 8019
Iterating global reduction 0 with 178 rules applied. Total rules applied 8202 place count 3819 transition count 8019
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 8380 place count 3641 transition count 7841
Iterating global reduction 0 with 178 rules applied. Total rules applied 8558 place count 3641 transition count 7841
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 8736 place count 3463 transition count 7663
Iterating global reduction 0 with 178 rules applied. Total rules applied 8914 place count 3463 transition count 7663
Discarding 175 places :
Symmetric choice reduction at 0 with 175 rule applications. Total rules 9089 place count 3288 transition count 7488
Iterating global reduction 0 with 175 rules applied. Total rules applied 9264 place count 3288 transition count 7488
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 9382 place count 3170 transition count 7370
Iterating global reduction 0 with 118 rules applied. Total rules applied 9500 place count 3170 transition count 7370
Discarding 116 places :
Symmetric choice reduction at 0 with 116 rule applications. Total rules 9616 place count 3054 transition count 7254
Iterating global reduction 0 with 116 rules applied. Total rules applied 9732 place count 3054 transition count 7254
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 9791 place count 2995 transition count 7195
Iterating global reduction 0 with 59 rules applied. Total rules applied 9850 place count 2995 transition count 7195
Applied a total of 9850 rules in 4863 ms. Remains 2995 /7920 variables (removed 4925) and now considering 7195/12120 (removed 4925) transitions.
// Phase 1: matrix 7195 rows 2995 cols
[2021-06-08 18:39:14] [INFO ] Computed 60 place invariants in 56 ms
[2021-06-08 18:39:15] [INFO ] Implicit Places using invariants in 701 ms returned []
// Phase 1: matrix 7195 rows 2995 cols
[2021-06-08 18:39:15] [INFO ] Computed 60 place invariants in 25 ms
[2021-06-08 18:39:16] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
// Phase 1: matrix 7195 rows 2995 cols
[2021-06-08 18:39:16] [INFO ] Computed 60 place invariants in 24 ms
[2021-06-08 18:39:19] [INFO ] Dead Transitions using invariants and state equation in 3313 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2995/7920 places, 7195/12120 transitions.
[2021-06-08 18:39:20] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-06-08 18:39:20] [INFO ] Flatten gal took : 331 ms
FORMULA BART-PT-060-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-08 18:39:20] [INFO ] Flatten gal took : 181 ms
[2021-06-08 18:39:20] [INFO ] Input system was already deterministic with 7195 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1078 ms. (steps per millisecond=92 ) properties (out of 29) seen :26
Running SMT prover for 3 properties.
// Phase 1: matrix 7195 rows 2995 cols
[2021-06-08 18:39:22] [INFO ] Computed 60 place invariants in 23 ms
[2021-06-08 18:39:22] [INFO ] [Real]Absence check using 60 positive place invariants in 45 ms returned sat
[2021-06-08 18:39:22] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:3
[2021-06-08 18:39:23] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2021-06-08 18:39:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-08 18:39:25] [INFO ] [Nat]Absence check using state equation in 2520 ms returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 492 ms.
[2021-06-08 18:39:26] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :3
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U p1)&&G(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2995 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2995/2995 places, 7195/7195 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 2973 transition count 7173
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 2973 transition count 7173
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 57 place count 2960 transition count 7160
Iterating global reduction 0 with 13 rules applied. Total rules applied 70 place count 2960 transition count 7160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 2955 transition count 7155
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 2955 transition count 7155
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 2951 transition count 7151
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 2951 transition count 7151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 2948 transition count 7148
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 2948 transition count 7148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 2946 transition count 7146
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 2946 transition count 7146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 2944 transition count 7144
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 2944 transition count 7144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 2942 transition count 7142
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 2942 transition count 7142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 2941 transition count 7141
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 2941 transition count 7141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 2940 transition count 7140
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 2940 transition count 7140
Applied a total of 110 rules in 1716 ms. Remains 2940 /2995 variables (removed 55) and now considering 7140/7195 (removed 55) transitions.
// Phase 1: matrix 7140 rows 2940 cols
[2021-06-08 18:39:28] [INFO ] Computed 60 place invariants in 51 ms
[2021-06-08 18:39:28] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 7140 rows 2940 cols
[2021-06-08 18:39:28] [INFO ] Computed 60 place invariants in 19 ms
[2021-06-08 18:39:29] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
// Phase 1: matrix 7140 rows 2940 cols
[2021-06-08 18:39:29] [INFO ] Computed 60 place invariants in 21 ms
[2021-06-08 18:39:32] [INFO ] Dead Transitions using invariants and state equation in 3121 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2940/2995 places, 7140/7195 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-060-00 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(EQ s1784 1), p1:(EQ s38 1), p0:(EQ s1113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BART-PT-060-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-00 finished in 6460 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(F(p1) U G((p2||X((p0 U p3))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2995 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2995/2995 places, 7195/7195 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2974 transition count 7174
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2974 transition count 7174
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 54 place count 2962 transition count 7162
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 2962 transition count 7162
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 2957 transition count 7157
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 2957 transition count 7157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 2953 transition count 7153
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 2953 transition count 7153
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 2950 transition count 7150
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 2950 transition count 7150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 2948 transition count 7148
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 2948 transition count 7148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 2946 transition count 7146
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 2946 transition count 7146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 2944 transition count 7144
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 2944 transition count 7144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 2943 transition count 7143
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 2943 transition count 7143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 2942 transition count 7142
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 2942 transition count 7142
Applied a total of 106 rules in 1711 ms. Remains 2942 /2995 variables (removed 53) and now considering 7142/7195 (removed 53) transitions.
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:39:34] [INFO ] Computed 60 place invariants in 15 ms
[2021-06-08 18:39:34] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:39:34] [INFO ] Computed 60 place invariants in 18 ms
[2021-06-08 18:39:35] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:39:35] [INFO ] Computed 60 place invariants in 18 ms
[2021-06-08 18:39:38] [INFO ] Dead Transitions using invariants and state equation in 3142 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2942/2995 places, 7142/7195 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : BART-PT-060-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s2165 1), p2:(EQ s960 1), p1:(EQ s19 1), p3:(AND (EQ s2165 1) (EQ s960 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 131 reset in 1405 ms.
Product exploration explored 100000 steps with 128 reset in 1302 ms.
Knowledge obtained : [(NOT p0), (NOT p2), p1, (NOT p3)]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 136 reset in 1267 ms.
Product exploration explored 100000 steps with 146 reset in 1389 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Support contains 3 out of 2942 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2942/2942 places, 7142/7142 transitions.
Graph (trivial) has 7099 edges and 2942 vertex of which 2890 / 2942 are part of one of the 59 SCC in 15 ms
Free SCC test removed 2831 places
Ensure Unique test removed 6959 transitions
Reduce isomorphic transitions removed 6959 transitions.
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 54 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 59 place count 54 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 54 transition count 127
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 52 transition count 125
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 52 transition count 125
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 52 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 52 transition count 123
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 85 place count 44 transition count 115
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 93 place count 44 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 44 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 44 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 43 transition count 112
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 43 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 43 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 101 place count 43 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 42 transition count 109
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 42 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 42 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 106 place count 42 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 41 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 41 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 41 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 111 place count 41 transition count 104
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 112 place count 40 transition count 103
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 113 place count 40 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 40 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 116 place count 40 transition count 101
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 117 place count 39 transition count 100
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 118 place count 39 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 119 place count 39 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 121 place count 39 transition count 98
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 122 place count 38 transition count 97
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 123 place count 38 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 124 place count 38 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 126 place count 38 transition count 95
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 127 place count 37 transition count 94
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 128 place count 37 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 129 place count 37 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 131 place count 37 transition count 92
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 132 place count 36 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 133 place count 36 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 134 place count 36 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 136 place count 36 transition count 89
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 137 place count 35 transition count 88
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 138 place count 35 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 139 place count 35 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 141 place count 35 transition count 86
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 142 place count 34 transition count 85
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 143 place count 34 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 144 place count 34 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 146 place count 34 transition count 83
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 147 place count 33 transition count 82
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 148 place count 33 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 149 place count 33 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 151 place count 33 transition count 80
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 152 place count 32 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 153 place count 32 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 154 place count 32 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 156 place count 32 transition count 77
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 157 place count 31 transition count 76
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 158 place count 31 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 159 place count 31 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 161 place count 31 transition count 74
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 162 place count 30 transition count 73
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 163 place count 30 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 164 place count 30 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 166 place count 30 transition count 71
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 167 place count 29 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 168 place count 29 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 169 place count 29 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 171 place count 29 transition count 68
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 172 place count 28 transition count 67
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 173 place count 28 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 174 place count 28 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 176 place count 28 transition count 65
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 177 place count 27 transition count 64
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 178 place count 27 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 179 place count 27 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 181 place count 27 transition count 62
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 182 place count 26 transition count 61
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 183 place count 26 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 184 place count 26 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 186 place count 26 transition count 59
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 187 place count 25 transition count 58
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 188 place count 25 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 189 place count 25 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 191 place count 25 transition count 56
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 192 place count 24 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 193 place count 24 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 194 place count 24 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 196 place count 24 transition count 53
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 197 place count 23 transition count 52
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 198 place count 23 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 199 place count 23 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 201 place count 23 transition count 50
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 202 place count 22 transition count 49
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 203 place count 22 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 204 place count 22 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 206 place count 22 transition count 47
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 207 place count 21 transition count 46
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 208 place count 21 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 209 place count 21 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 211 place count 21 transition count 44
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 212 place count 20 transition count 43
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 213 place count 20 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 214 place count 20 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 216 place count 20 transition count 41
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 217 place count 19 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 218 place count 19 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 219 place count 19 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 221 place count 19 transition count 38
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 222 place count 18 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 223 place count 18 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 224 place count 18 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 226 place count 18 transition count 35
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 227 place count 17 transition count 34
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 228 place count 17 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 229 place count 17 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 231 place count 17 transition count 32
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 232 place count 16 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 233 place count 16 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 234 place count 16 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 236 place count 16 transition count 29
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 237 place count 15 transition count 28
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 238 place count 15 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 239 place count 15 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 241 place count 15 transition count 26
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 242 place count 14 transition count 25
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 243 place count 14 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 244 place count 14 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 246 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 247 place count 13 transition count 22
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 248 place count 13 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 249 place count 13 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 251 place count 13 transition count 20
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 252 place count 12 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 253 place count 12 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 254 place count 12 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 256 place count 12 transition count 17
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 257 place count 11 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 258 place count 11 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 259 place count 11 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 261 place count 11 transition count 14
Discarding 2 places :
Symmetric choice reduction at 36 with 2 rule applications. Total rules 263 place count 9 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 36 with 2 rules applied. Total rules applied 265 place count 9 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 36 with 2 rules applied. Total rules applied 267 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 267 place count 9 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 268 place count 9 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 268 rules in 99 ms. Remains 9 /2942 variables (removed 2933) and now considering 10/7142 (removed 7132) transitions.
[2021-06-08 18:39:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2021-06-08 18:39:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-06-08 18:39:45] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/2942 places, 10/7142 transitions.
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 16 ms.
FORMULA BART-PT-060-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-01 finished in 12727 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((F(p1)&&p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2995 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2995/2995 places, 7195/7195 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2975 transition count 7175
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2975 transition count 7175
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 2962 transition count 7162
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 2962 transition count 7162
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 2957 transition count 7157
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 2957 transition count 7157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 2953 transition count 7153
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 2953 transition count 7153
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 2950 transition count 7150
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 2950 transition count 7150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 2948 transition count 7148
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 2948 transition count 7148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 2946 transition count 7146
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 2946 transition count 7146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 2944 transition count 7144
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 2944 transition count 7144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 2943 transition count 7143
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 2943 transition count 7143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 2942 transition count 7142
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 2942 transition count 7142
Applied a total of 106 rules in 2881 ms. Remains 2942 /2995 variables (removed 53) and now considering 7142/7195 (removed 53) transitions.
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:39:48] [INFO ] Computed 60 place invariants in 20 ms
[2021-06-08 18:39:48] [INFO ] Implicit Places using invariants in 317 ms returned []
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:39:48] [INFO ] Computed 60 place invariants in 22 ms
[2021-06-08 18:39:49] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:39:49] [INFO ] Computed 60 place invariants in 26 ms
[2021-06-08 18:39:52] [INFO ] Dead Transitions using invariants and state equation in 2894 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2942/2995 places, 7142/7195 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BART-PT-060-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (NEQ s305 0) (OR (NEQ s51 1) (NEQ s2418 1))), p1:(NEQ s2418 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA BART-PT-060-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-03 finished in 7156 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((X(G(p1))||p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 2995 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2995/2995 places, 7195/7195 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2975 transition count 7175
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2975 transition count 7175
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 2963 transition count 7163
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 2963 transition count 7163
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 2958 transition count 7158
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 2958 transition count 7158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 2954 transition count 7154
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 2954 transition count 7154
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 2951 transition count 7151
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 2951 transition count 7151
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 2949 transition count 7149
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 2949 transition count 7149
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 2947 transition count 7147
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 2947 transition count 7147
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 2945 transition count 7145
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 2945 transition count 7145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 2944 transition count 7144
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 2944 transition count 7144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 2943 transition count 7143
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 2943 transition count 7143
Applied a total of 104 rules in 2512 ms. Remains 2943 /2995 variables (removed 52) and now considering 7143/7195 (removed 52) transitions.
// Phase 1: matrix 7143 rows 2943 cols
[2021-06-08 18:39:55] [INFO ] Computed 60 place invariants in 21 ms
[2021-06-08 18:39:55] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 7143 rows 2943 cols
[2021-06-08 18:39:55] [INFO ] Computed 60 place invariants in 21 ms
[2021-06-08 18:39:56] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
// Phase 1: matrix 7143 rows 2943 cols
[2021-06-08 18:39:56] [INFO ] Computed 60 place invariants in 16 ms
[2021-06-08 18:39:59] [INFO ] Dead Transitions using invariants and state equation in 2972 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2943/2995 places, 7143/7195 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BART-PT-060-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s2840 1), p0:(OR (EQ s2042 1) (EQ s480 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19456 steps with 0 reset in 159 ms.
FORMULA BART-PT-060-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-04 finished in 6994 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U (X(p1) U ((p2&&X(p1)&&(p3||G(p4)))||X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2995 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2995/2995 places, 7195/7195 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2975 transition count 7175
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2975 transition count 7175
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 2962 transition count 7162
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 2962 transition count 7162
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 2957 transition count 7157
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 2957 transition count 7157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 2953 transition count 7153
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 2953 transition count 7153
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 2950 transition count 7150
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 2950 transition count 7150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 2948 transition count 7148
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 2948 transition count 7148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 2946 transition count 7146
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 2946 transition count 7146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 2944 transition count 7144
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 2944 transition count 7144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 2943 transition count 7143
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 2943 transition count 7143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 2942 transition count 7142
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 2942 transition count 7142
Applied a total of 106 rules in 2428 ms. Remains 2942 /2995 variables (removed 53) and now considering 7142/7195 (removed 53) transitions.
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:40:02] [INFO ] Computed 60 place invariants in 23 ms
[2021-06-08 18:40:02] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:40:02] [INFO ] Computed 60 place invariants in 18 ms
[2021-06-08 18:40:03] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:40:03] [INFO ] Computed 60 place invariants in 16 ms
[2021-06-08 18:40:06] [INFO ] Dead Transitions using invariants and state equation in 2940 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2942/2995 places, 7142/7195 transitions.
Stuttering acceptance computed with spot in 404 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p4) (NOT p1)), true, (NOT p4)]
Running random walk in product with property : BART-PT-060-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p2 p3 p0) (AND p2 p4 p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p3) (NOT p4) p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3) p4 p0), acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p0))), acceptance={} source=0 dest: 5}, { cond=(AND p2 (NOT p3) p4 (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=(OR (AND p2 p3 p0 (NOT p1)) (AND p2 p4 p0 (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p3) (NOT p4) p0 (NOT p1))), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p2 (NOT p3) p4 p0 (NOT p1)), acceptance={1} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p0) (NOT p1))), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p3) p4 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND p2 p3 p0 (NOT p1)) (AND p2 p4 p0 (NOT p1))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p2 p3 p0 p1) (AND p2 p4 p0 p1)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p3) (NOT p4) p0 (NOT p1))), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p2) p0 p1) (AND (NOT p3) (NOT p4) p0 p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3) p4 p0 (NOT p1)), acceptance={1} source=2 dest: 3}, { cond=(AND p2 (NOT p3) p4 p0 p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p0))), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p3) p4 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND p2 p3 (NOT p4) p0 (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 p3 (NOT p4) p0 p1), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p4) p0 (NOT p1)) (AND (NOT p3) (NOT p4) p0 (NOT p1))), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p4) p0 p1) (AND (NOT p3) (NOT p4) p0 p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p4 p0 (NOT p1)) (AND (NOT p3) p4 p0 (NOT p1))), acceptance={1} source=3 dest: 3}, { cond=(OR (AND (NOT p2) p4 p0 p1) (AND (NOT p3) p4 p0 p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p4) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p0))), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p2) p4 (NOT p0)) (AND (NOT p3) p4 (NOT p0))), acceptance={} source=3 dest: 6}, { cond=(AND p2 p3 p4 p0 (NOT p1)), acceptance={1} source=3 dest: 7}, { cond=(AND p2 p3 p4 p0 p1), acceptance={} source=3 dest: 7}, { cond=(AND p4 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))), acceptance={0, 1} source=5 dest: 5}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p3) (NOT p4) p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p3) p4 (NOT p1)), acceptance={1} source=5 dest: 6}, { cond=(AND p2 (NOT p3) p4 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p4), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p4) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))), acceptance={0, 1} source=6 dest: 5}, { cond=(OR (AND (NOT p2) (NOT p4) p1) (AND (NOT p3) (NOT p4) p1)), acceptance={0} source=6 dest: 5}, { cond=(OR (AND (NOT p2) p4 (NOT p1)) (AND (NOT p3) p4 (NOT p1))), acceptance={1} source=6 dest: 6}, { cond=(OR (AND (NOT p2) p4 p1) (AND (NOT p3) p4 p1)), acceptance={} source=6 dest: 6}, { cond=p4, acceptance={} source=6 dest: 8}], [{ cond=(AND p2 p3 (NOT p4) p0 (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p4) p0 (NOT p1)) (AND (NOT p3) (NOT p4) p0 (NOT p1))), acceptance={0, 1} source=7 dest: 2}, { cond=(OR (AND (NOT p2) p4 p0 (NOT p1)) (AND (NOT p3) p4 p0 (NOT p1))), acceptance={1} source=7 dest: 3}, { cond=(AND (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p4) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p0) (NOT p1))), acceptance={} source=7 dest: 5}, { cond=(OR (AND (NOT p2) p4 (NOT p0) (NOT p1)) (AND (NOT p3) p4 (NOT p0) (NOT p1))), acceptance={} source=7 dest: 6}, { cond=(AND p2 p3 p4 p0 (NOT p1)), acceptance={1} source=7 dest: 7}, { cond=(AND p4 (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p4) (NOT p1)), acceptance={} source=8 dest: 9}, { cond=(AND p4 (NOT p1)), acceptance={} source=8 dest: 10}], [{ cond=true, acceptance={0, 1} source=9 dest: 9}], [{ cond=(NOT p4), acceptance={} source=10 dest: 9}, { cond=p4, acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(NEQ s1147 1), p3:(NEQ s1741 1), p0:(EQ s367 0), p4:(NEQ s803 1), p1:(NEQ s492 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21637 steps with 1 reset in 180 ms.
FORMULA BART-PT-060-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-05 finished in 7226 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F((G(p1)&&X(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2995 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2995/2995 places, 7195/7195 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2975 transition count 7175
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2975 transition count 7175
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 2963 transition count 7163
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 2963 transition count 7163
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 2959 transition count 7159
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 2959 transition count 7159
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 2956 transition count 7156
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 2956 transition count 7156
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 2954 transition count 7154
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 2954 transition count 7154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 2953 transition count 7153
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 2953 transition count 7153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 2952 transition count 7152
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 2952 transition count 7152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 2951 transition count 7151
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 2951 transition count 7151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 2950 transition count 7150
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 2950 transition count 7150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 2949 transition count 7149
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 2949 transition count 7149
Applied a total of 92 rules in 2497 ms. Remains 2949 /2995 variables (removed 46) and now considering 7149/7195 (removed 46) transitions.
// Phase 1: matrix 7149 rows 2949 cols
[2021-06-08 18:40:09] [INFO ] Computed 60 place invariants in 23 ms
[2021-06-08 18:40:09] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 7149 rows 2949 cols
[2021-06-08 18:40:09] [INFO ] Computed 60 place invariants in 17 ms
[2021-06-08 18:40:10] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
// Phase 1: matrix 7149 rows 2949 cols
[2021-06-08 18:40:10] [INFO ] Computed 60 place invariants in 14 ms
[2021-06-08 18:40:13] [INFO ] Dead Transitions using invariants and state equation in 2881 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2949/2995 places, 7149/7195 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : BART-PT-060-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=p1, acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s2029 1), p1:(EQ s1021 1), p2:(EQ s603 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 758 ms.
Product exploration explored 100000 steps with 0 reset in 858 ms.
Knowledge obtained : [p0, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 766 ms.
Product exploration explored 100000 steps with 0 reset in 806 ms.
[2021-06-08 18:40:17] [INFO ] Flatten gal took : 133 ms
[2021-06-08 18:40:17] [INFO ] Flatten gal took : 131 ms
[2021-06-08 18:40:17] [INFO ] Time to serialize gal into /tmp/LTL6611925754575900271.gal : 101 ms
[2021-06-08 18:40:17] [INFO ] Time to serialize properties into /tmp/LTL14045854454642960416.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6611925754575900271.gal, -t, CGAL, -LTL, /tmp/LTL14045854454642960416.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6611925754575900271.gal -t CGAL -LTL /tmp/LTL14045854454642960416.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(TrainState_44_1_28!=1)")&&(F((G("(TrainState_19_4_14==1)"))&&(X("(TrainState_4_2_9==1)")))))))
Formula 0 simplified : !X("(TrainState_44_1_28!=1)" & F(G"(TrainState_19_4_14==1)" & X"(TrainState_4_2_9==1)"))
Detected timeout of ITS tools.
[2021-06-08 18:40:32] [INFO ] Flatten gal took : 115 ms
[2021-06-08 18:40:32] [INFO ] Applying decomposition
[2021-06-08 18:40:33] [INFO ] Flatten gal took : 123 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7230179506636408366.txt, -o, /tmp/graph7230179506636408366.bin, -w, /tmp/graph7230179506636408366.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7230179506636408366.bin, -l, -1, -v, -w, /tmp/graph7230179506636408366.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-08 18:40:33] [INFO ] Decomposing Gal with order
[2021-06-08 18:40:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-08 18:40:34] [INFO ] Removed a total of 2288 redundant transitions.
[2021-06-08 18:40:34] [INFO ] Flatten gal took : 359 ms
[2021-06-08 18:40:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1281 labels/synchronizations in 37 ms.
[2021-06-08 18:40:34] [INFO ] Time to serialize gal into /tmp/LTL10078383653237796480.gal : 29 ms
[2021-06-08 18:40:34] [INFO ] Time to serialize properties into /tmp/LTL15188137311032576861.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10078383653237796480.gal, -t, CGAL, -LTL, /tmp/LTL15188137311032576861.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10078383653237796480.gal -t CGAL -LTL /tmp/LTL15188137311032576861.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i16.u426.TrainState_44_1_28!=1)")&&(F((G("(i25.u288.TrainState_19_4_14==1)"))&&(X("(i0.u63.TrainState_4_2_9==1)")))))))
Formula 0 simplified : !X("(i16.u426.TrainState_44_1_28!=1)" & F(G"(i25.u288.TrainState_19_4_14==1)" & X"(i0.u63.TrainState_4_2_9==1)"))
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
101 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.357,51444,1,0,5069,2170,4081,3565,865,4169,16613
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-060-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-060-07 finished in 28801 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2995 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2995/2995 places, 7195/7195 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2974 transition count 7174
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2974 transition count 7174
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 54 place count 2962 transition count 7162
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 2962 transition count 7162
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 2957 transition count 7157
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 2957 transition count 7157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 2953 transition count 7153
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 2953 transition count 7153
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 2950 transition count 7150
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 2950 transition count 7150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 2948 transition count 7148
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 2948 transition count 7148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 2946 transition count 7146
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 2946 transition count 7146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 2944 transition count 7144
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 2944 transition count 7144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 2943 transition count 7143
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 2943 transition count 7143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 2942 transition count 7142
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 2942 transition count 7142
Applied a total of 106 rules in 2447 ms. Remains 2942 /2995 variables (removed 53) and now considering 7142/7195 (removed 53) transitions.
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:40:38] [INFO ] Computed 60 place invariants in 20 ms
[2021-06-08 18:40:38] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:40:38] [INFO ] Computed 60 place invariants in 18 ms
[2021-06-08 18:40:39] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:40:39] [INFO ] Computed 60 place invariants in 25 ms
[2021-06-08 18:40:42] [INFO ] Dead Transitions using invariants and state equation in 3044 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2942/2995 places, 7142/7195 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BART-PT-060-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s60 1), p1:(NEQ s2520 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23539 steps with 0 reset in 180 ms.
FORMULA BART-PT-060-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-08 finished in 7119 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||(p0&&F(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2995 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2995/2995 places, 7195/7195 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2975 transition count 7175
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2975 transition count 7175
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 2963 transition count 7163
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 2963 transition count 7163
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 2959 transition count 7159
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 2959 transition count 7159
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 2955 transition count 7155
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 2955 transition count 7155
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 2952 transition count 7152
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 2952 transition count 7152
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 2950 transition count 7150
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 2950 transition count 7150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 2948 transition count 7148
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 2948 transition count 7148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 2946 transition count 7146
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 2946 transition count 7146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 2945 transition count 7145
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 2945 transition count 7145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 2944 transition count 7144
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 2944 transition count 7144
Applied a total of 102 rules in 2388 ms. Remains 2944 /2995 variables (removed 51) and now considering 7144/7195 (removed 51) transitions.
// Phase 1: matrix 7144 rows 2944 cols
[2021-06-08 18:40:45] [INFO ] Computed 60 place invariants in 15 ms
[2021-06-08 18:40:45] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 7144 rows 2944 cols
[2021-06-08 18:40:45] [INFO ] Computed 60 place invariants in 21 ms
[2021-06-08 18:40:46] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
// Phase 1: matrix 7144 rows 2944 cols
[2021-06-08 18:40:46] [INFO ] Computed 60 place invariants in 25 ms
[2021-06-08 18:40:49] [INFO ] Dead Transitions using invariants and state equation in 2837 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2944/2995 places, 7144/7195 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-060-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (NEQ s22 1) (NEQ s2521 1)), p1:(AND (EQ s2280 1) (NEQ s2521 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 765 ms.
Product exploration explored 100000 steps with 0 reset in 868 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 748 ms.
Product exploration explored 100000 steps with 0 reset in 858 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Support contains 3 out of 2944 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2944/2944 places, 7144/7144 transitions.
Graph (trivial) has 7103 edges and 2944 vertex of which 2891 / 2944 are part of one of the 59 SCC in 12 ms
Free SCC test removed 2832 places
Ensure Unique test removed 6960 transitions
Reduce isomorphic transitions removed 6960 transitions.
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 55 transition count 128
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 60 place count 55 transition count 128
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 55 transition count 128
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 53 transition count 126
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 53 transition count 126
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 75 place count 53 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 53 transition count 124
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 86 place count 45 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 94 place count 45 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 45 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 45 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 44 transition count 113
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 44 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 44 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 44 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 43 transition count 110
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 43 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 43 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 107 place count 43 transition count 108
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 108 place count 42 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 42 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 42 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 112 place count 42 transition count 105
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 113 place count 41 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 41 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 115 place count 41 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 117 place count 41 transition count 102
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 118 place count 40 transition count 101
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 119 place count 40 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 120 place count 40 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 122 place count 40 transition count 99
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 123 place count 39 transition count 98
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 124 place count 39 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 125 place count 39 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 127 place count 39 transition count 96
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 128 place count 38 transition count 95
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 129 place count 38 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 130 place count 38 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 132 place count 38 transition count 93
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 133 place count 37 transition count 92
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 134 place count 37 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 135 place count 37 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 137 place count 37 transition count 90
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 138 place count 36 transition count 89
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 139 place count 36 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 140 place count 36 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 142 place count 36 transition count 87
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 143 place count 35 transition count 86
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 144 place count 35 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 145 place count 35 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 147 place count 35 transition count 84
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 148 place count 34 transition count 83
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 149 place count 34 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 150 place count 34 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 152 place count 34 transition count 81
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 153 place count 33 transition count 80
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 154 place count 33 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 155 place count 33 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 157 place count 33 transition count 78
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 158 place count 32 transition count 77
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 159 place count 32 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 160 place count 32 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 162 place count 32 transition count 75
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 163 place count 31 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 164 place count 31 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 165 place count 31 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 167 place count 31 transition count 72
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 168 place count 30 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 169 place count 30 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 170 place count 30 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 172 place count 30 transition count 69
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 173 place count 29 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 174 place count 29 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 175 place count 29 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 177 place count 29 transition count 66
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 178 place count 28 transition count 65
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 179 place count 28 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 180 place count 28 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 182 place count 28 transition count 63
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 183 place count 27 transition count 62
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 184 place count 27 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 185 place count 27 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 187 place count 27 transition count 60
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 188 place count 26 transition count 59
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 189 place count 26 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 190 place count 26 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 192 place count 26 transition count 57
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 193 place count 25 transition count 56
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 194 place count 25 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 195 place count 25 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 197 place count 25 transition count 54
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 198 place count 24 transition count 53
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 199 place count 24 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 200 place count 24 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 202 place count 24 transition count 51
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 203 place count 23 transition count 50
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 204 place count 23 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 205 place count 23 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 207 place count 23 transition count 48
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 208 place count 22 transition count 47
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 209 place count 22 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 210 place count 22 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 212 place count 22 transition count 45
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 213 place count 21 transition count 44
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 214 place count 21 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 215 place count 21 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 217 place count 21 transition count 42
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 218 place count 20 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 219 place count 20 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 220 place count 20 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 222 place count 20 transition count 39
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 223 place count 19 transition count 38
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 224 place count 19 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 225 place count 19 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 227 place count 19 transition count 36
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 228 place count 18 transition count 35
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 229 place count 18 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 230 place count 18 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 232 place count 18 transition count 33
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 233 place count 17 transition count 32
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 234 place count 17 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 235 place count 17 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 237 place count 17 transition count 30
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 238 place count 16 transition count 29
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 239 place count 16 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 240 place count 16 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 242 place count 16 transition count 27
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 243 place count 15 transition count 26
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 244 place count 15 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 245 place count 15 transition count 26
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 247 place count 15 transition count 24
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 248 place count 14 transition count 23
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 249 place count 14 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 250 place count 14 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 252 place count 14 transition count 21
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 253 place count 13 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 254 place count 13 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 255 place count 13 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 257 place count 13 transition count 18
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 258 place count 12 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 259 place count 12 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 260 place count 12 transition count 17
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 262 place count 12 transition count 15
Discarding 2 places :
Symmetric choice reduction at 36 with 2 rule applications. Total rules 264 place count 10 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 36 with 2 rules applied. Total rules applied 266 place count 10 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 36 with 2 rules applied. Total rules applied 268 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 268 place count 10 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 269 place count 10 transition count 11
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 270 place count 9 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 271 place count 9 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 271 rules in 51 ms. Remains 9 /2944 variables (removed 2935) and now considering 10/7144 (removed 7134) transitions.
[2021-06-08 18:40:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2021-06-08 18:40:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-06-08 18:40:53] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/2944 places, 10/7144 transitions.
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 197 ms.
[2021-06-08 18:40:53] [INFO ] Flatten gal took : 100 ms
[2021-06-08 18:40:53] [INFO ] Flatten gal took : 102 ms
[2021-06-08 18:40:53] [INFO ] Time to serialize gal into /tmp/LTL4303350605217070521.gal : 16 ms
[2021-06-08 18:40:53] [INFO ] Time to serialize properties into /tmp/LTL14000547623105631030.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4303350605217070521.gal, -t, CGAL, -LTL, /tmp/LTL14000547623105631030.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4303350605217070521.gal -t CGAL -LTL /tmp/LTL14000547623105631030.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((TrainState_23_0_0!=1)||(TrainState_26_2_34!=1))"))||((F(G("((TrainState_48_4_31==1)&&(TrainState_26_2_34!=1))")))&&("((TrainState_23_0_0!=1)||(TrainState_26_2_34!=1))"))))))
Formula 0 simplified : !XF(G"((TrainState_23_0_0!=1)||(TrainState_26_2_34!=1))" | ("((TrainState_23_0_0!=1)||(TrainState_26_2_34!=1))" & FG"((TrainState_48_4_31==1)&&(TrainState_26_2_34!=1))"))
Detected timeout of ITS tools.
[2021-06-08 18:41:08] [INFO ] Flatten gal took : 101 ms
[2021-06-08 18:41:08] [INFO ] Applying decomposition
[2021-06-08 18:41:09] [INFO ] Flatten gal took : 109 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10680255088553073632.txt, -o, /tmp/graph10680255088553073632.bin, -w, /tmp/graph10680255088553073632.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10680255088553073632.bin, -l, -1, -v, -w, /tmp/graph10680255088553073632.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-08 18:41:09] [INFO ] Decomposing Gal with order
[2021-06-08 18:41:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-08 18:41:09] [INFO ] Removed a total of 2255 redundant transitions.
[2021-06-08 18:41:09] [INFO ] Flatten gal took : 241 ms
[2021-06-08 18:41:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 1365 labels/synchronizations in 20 ms.
[2021-06-08 18:41:09] [INFO ] Time to serialize gal into /tmp/LTL9780440136584450161.gal : 25 ms
[2021-06-08 18:41:09] [INFO ] Time to serialize properties into /tmp/LTL9145792333965764451.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9780440136584450161.gal, -t, CGAL, -LTL, /tmp/LTL9145792333965764451.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9780440136584450161.gal -t CGAL -LTL /tmp/LTL9145792333965764451.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((i54.u303.TrainState_23_0_0!=1)||(i6.u512.TrainState_26_2_34!=1))"))||((F(G("((i18.u513.TrainState_48_4_31==1)&&(i6.u512.TrainState_26_2_34!=1))")))&&("((i54.u303.TrainState_23_0_0!=1)||(i6.u512.TrainState_26_2_34!=1))"))))))
Formula 0 simplified : !XF(G"((i54.u303.TrainState_23_0_0!=1)||(i6.u512.TrainState_26_2_34!=1))" | ("((i54.u303.TrainState_23_0_0!=1)||(i6.u512.TrainState_26_2_34!=1))" & FG"((i18.u513.TrainState_48_4_31==1)&&(i6.u512.TrainState_26_2_34!=1))"))
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
405 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,4.40322,170996,1,0,367747,1137,2248,361714,494,2738,208108
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-060-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-060-10 finished in 32269 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2995 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2995/2995 places, 7195/7195 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2974 transition count 7174
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2974 transition count 7174
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 54 place count 2962 transition count 7162
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 2962 transition count 7162
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 2958 transition count 7158
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 2958 transition count 7158
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 2955 transition count 7155
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 2955 transition count 7155
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 2953 transition count 7153
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 2953 transition count 7153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 2952 transition count 7152
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 2952 transition count 7152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 2951 transition count 7151
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 2951 transition count 7151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 2950 transition count 7150
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 2950 transition count 7150
Applied a total of 90 rules in 2020 ms. Remains 2950 /2995 variables (removed 45) and now considering 7150/7195 (removed 45) transitions.
// Phase 1: matrix 7150 rows 2950 cols
[2021-06-08 18:41:17] [INFO ] Computed 60 place invariants in 22 ms
[2021-06-08 18:41:17] [INFO ] Implicit Places using invariants in 317 ms returned []
// Phase 1: matrix 7150 rows 2950 cols
[2021-06-08 18:41:17] [INFO ] Computed 60 place invariants in 15 ms
[2021-06-08 18:41:18] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
// Phase 1: matrix 7150 rows 2950 cols
[2021-06-08 18:41:18] [INFO ] Computed 60 place invariants in 17 ms
[2021-06-08 18:41:21] [INFO ] Dead Transitions using invariants and state equation in 2882 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2950/2995 places, 7150/7195 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-060-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s420 0) (NEQ s2900 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 48733 reset in 4809 ms.
Product exploration explored 100000 steps with 48794 reset in 4905 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 48682 reset in 4825 ms.
Product exploration explored 100000 steps with 48543 reset in 4848 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2950 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2950/2950 places, 7150/7150 transitions.
Graph (trivial) has 7144 edges and 2950 vertex of which 2939 / 2950 are part of one of the 60 SCC in 8 ms
Free SCC test removed 2879 places
Ensure Unique test removed 7068 transitions
Reduce isomorphic transitions removed 7068 transitions.
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 13 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 13 transition count 24
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 13 transition count 24
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 74 place count 13 transition count 17
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 81 place count 6 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 88 place count 6 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 6 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 90 rules in 20 ms. Remains 6 /2950 variables (removed 2944) and now considering 8/7150 (removed 7142) transitions.
[2021-06-08 18:41:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2021-06-08 18:41:40] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:41:40] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/2950 places, 8/7150 transitions.
Stuttering criterion allowed to conclude after 853 steps with 426 reset in 42 ms.
FORMULA BART-PT-060-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-11 finished in 25841 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||(X(p1)&&(p2||X(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2995 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2995/2995 places, 7195/7195 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2974 transition count 7174
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2974 transition count 7174
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 54 place count 2962 transition count 7162
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 2962 transition count 7162
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 2957 transition count 7157
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 2957 transition count 7157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 2953 transition count 7153
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 2953 transition count 7153
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 2950 transition count 7150
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 2950 transition count 7150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 2948 transition count 7148
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 2948 transition count 7148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 2946 transition count 7146
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 2946 transition count 7146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 2944 transition count 7144
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 2944 transition count 7144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 2943 transition count 7143
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 2943 transition count 7143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 2942 transition count 7142
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 2942 transition count 7142
Applied a total of 106 rules in 2409 ms. Remains 2942 /2995 variables (removed 53) and now considering 7142/7195 (removed 53) transitions.
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:41:43] [INFO ] Computed 60 place invariants in 21 ms
[2021-06-08 18:41:43] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:41:43] [INFO ] Computed 60 place invariants in 20 ms
[2021-06-08 18:41:44] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
// Phase 1: matrix 7142 rows 2942 cols
[2021-06-08 18:41:44] [INFO ] Computed 60 place invariants in 15 ms
[2021-06-08 18:41:47] [INFO ] Dead Transitions using invariants and state equation in 2890 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2942/2995 places, 7142/7195 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Running random walk in product with property : BART-PT-060-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 4}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 5}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s2244 1), p2:(NEQ s24 1), p1:(NEQ s2340 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8878 steps with 0 reset in 76 ms.
FORMULA BART-PT-060-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-13 finished in 6817 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2995 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2995/2995 places, 7195/7195 transitions.
Graph (trivial) has 7156 edges and 2995 vertex of which 2939 / 2995 are part of one of the 59 SCC in 8 ms
Free SCC test removed 2880 places
Ensure Unique test removed 7007 transitions
Reduce isomorphic transitions removed 7007 transitions.
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 57 transition count 125
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 8 rules applied. Total rules applied 72 place count 51 transition count 123
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 50 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 74 place count 50 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 49 transition count 121
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 96 place count 39 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 39 transition count 108
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 103 place count 37 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 107 place count 37 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 5 with 4 rules applied. Total rules applied 111 place count 35 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 115 place count 35 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 6 with 4 rules applied. Total rules applied 119 place count 33 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 123 place count 33 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 7 with 4 rules applied. Total rules applied 127 place count 31 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 131 place count 31 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 8 with 4 rules applied. Total rules applied 135 place count 29 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 139 place count 29 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 9 with 4 rules applied. Total rules applied 143 place count 27 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 147 place count 27 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 10 with 4 rules applied. Total rules applied 151 place count 25 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 155 place count 25 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 11 with 4 rules applied. Total rules applied 159 place count 23 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 163 place count 23 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 12 with 4 rules applied. Total rules applied 167 place count 21 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 171 place count 21 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 13 with 4 rules applied. Total rules applied 175 place count 19 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 179 place count 19 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 14 with 4 rules applied. Total rules applied 183 place count 17 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 187 place count 17 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 15 with 4 rules applied. Total rules applied 191 place count 15 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 195 place count 15 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 16 with 4 rules applied. Total rules applied 199 place count 13 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 203 place count 13 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 17 with 4 rules applied. Total rules applied 207 place count 11 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 211 place count 11 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 18 with 4 rules applied. Total rules applied 215 place count 9 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 219 place count 9 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 19 with 4 rules applied. Total rules applied 223 place count 7 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 227 place count 7 transition count 12
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 231 place count 5 transition count 9
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 233 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 234 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 234 place count 5 transition count 5
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 236 place count 4 transition count 5
Applied a total of 236 rules in 37 ms. Remains 4 /2995 variables (removed 2991) and now considering 5/7195 (removed 7190) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:41:47] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:41:47] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:41:47] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:41:47] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-06-08 18:41:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:41:47] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:41:47] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/2995 places, 5/7195 transitions.
Stuttering acceptance computed with spot in 24 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : BART-PT-060-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s0 1), p1:(EQ s2 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-060-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-14 finished in 125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 2995 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2995/2995 places, 7195/7195 transitions.
Graph (trivial) has 7152 edges and 2995 vertex of which 2942 / 2995 are part of one of the 59 SCC in 4 ms
Free SCC test removed 2883 places
Ensure Unique test removed 7011 transitions
Reduce isomorphic transitions removed 7011 transitions.
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 55 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 53 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 61 place count 53 transition count 125
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 52 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 51 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 51 transition count 124
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 85 place count 41 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 41 transition count 111
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 3 with 4 rules applied. Total rules applied 92 place count 39 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 96 place count 39 transition count 105
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 100 place count 37 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 104 place count 37 transition count 99
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 108 place count 35 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 112 place count 35 transition count 93
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 116 place count 33 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 120 place count 33 transition count 87
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 124 place count 31 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 128 place count 31 transition count 81
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 132 place count 29 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 136 place count 29 transition count 75
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 140 place count 27 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 144 place count 27 transition count 69
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 148 place count 25 transition count 67
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 152 place count 25 transition count 63
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 156 place count 23 transition count 61
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 160 place count 23 transition count 57
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 164 place count 21 transition count 55
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 168 place count 21 transition count 51
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 172 place count 19 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 176 place count 19 transition count 45
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 180 place count 17 transition count 43
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 184 place count 17 transition count 39
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 188 place count 15 transition count 37
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 192 place count 15 transition count 33
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 196 place count 13 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 200 place count 13 transition count 27
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 204 place count 11 transition count 25
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 208 place count 11 transition count 21
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 212 place count 9 transition count 19
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 216 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 220 place count 7 transition count 12
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 222 place count 7 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 224 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 20 with 1 Pre rules applied. Total rules applied 224 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 226 place count 6 transition count 7
Applied a total of 226 rules in 34 ms. Remains 6 /2995 variables (removed 2989) and now considering 7/7195 (removed 7188) transitions.
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:41:47] [INFO ] Computed 3 place invariants in 0 ms
[2021-06-08 18:41:47] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:41:47] [INFO ] Computed 3 place invariants in 0 ms
[2021-06-08 18:41:47] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-06-08 18:41:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:41:47] [INFO ] Computed 3 place invariants in 1 ms
[2021-06-08 18:41:47] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/2995 places, 7/7195 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-060-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s3 1) (EQ s0 1) (AND (EQ s0 0) (EQ s2 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA BART-PT-060-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-15 finished in 144 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623177709106

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-060"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is BART-PT-060, 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 r007-tall-162037990300650"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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