Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813598300716.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BART-COL-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598300716
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.1K Feb 26 04:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 04:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 04:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 04:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 06:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 06:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 05:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 05:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 195K Mar 5 18:22 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-COL-020-LTLFireability-00
FORMULA_NAME BART-COL-020-LTLFireability-01
FORMULA_NAME BART-COL-020-LTLFireability-02
FORMULA_NAME BART-COL-020-LTLFireability-03
FORMULA_NAME BART-COL-020-LTLFireability-04
FORMULA_NAME BART-COL-020-LTLFireability-05
FORMULA_NAME BART-COL-020-LTLFireability-06
FORMULA_NAME BART-COL-020-LTLFireability-07
FORMULA_NAME BART-COL-020-LTLFireability-08
FORMULA_NAME BART-COL-020-LTLFireability-09
FORMULA_NAME BART-COL-020-LTLFireability-10
FORMULA_NAME BART-COL-020-LTLFireability-11
FORMULA_NAME BART-COL-020-LTLFireability-12
FORMULA_NAME BART-COL-020-LTLFireability-13
FORMULA_NAME BART-COL-020-LTLFireability-14
FORMULA_NAME BART-COL-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678643615334

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:53:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:53:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:53:38] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 17:53:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 17:53:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 649 ms
[2023-03-12 17:53:39] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2023-03-12 17:53:39] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 15293 PT places and 2.814459024E10 transition bindings in 73 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 17:53:39] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 5 ms.
[2023-03-12 17:53:39] [INFO ] Skeletonized 1 HLPN properties in 0 ms. Removed 15 properties that had guard overlaps.
Computed a total of 4 stabilizing places and 2 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 20
Arc [1:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
[2023-03-12 17:53:39] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 271 ms.
[2023-03-12 17:53:39] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 6 formulas.
[2023-03-12 17:53:39] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:53:39] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:53:39] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:53:39] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:53:39] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 3 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-020-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-12 17:53:39] [INFO ] Computed 1 place invariants in 8 ms
[2023-03-12 17:53:40] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-12 17:53:40] [INFO ] Invariant cache hit.
[2023-03-12 17:53:40] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-12 17:53:40] [INFO ] Invariant cache hit.
[2023-03-12 17:53:40] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 783 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2023-03-12 17:53:40] [INFO ] Flatten gal took : 69 ms
[2023-03-12 17:53:40] [INFO ] Flatten gal took : 26 ms
[2023-03-12 17:53:40] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 2174 steps, including 0 resets, run visited all 8 properties in 43 ms. (steps per millisecond=50 )
FORMULA BART-COL-020-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(X(G(p1))&&(G(F(p0))||(F(p0)&&F(p2))))))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 22 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2023-03-12 17:53:41] [INFO ] Computed 1 place invariants in 6 ms
[2023-03-12 17:53:41] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-12 17:53:41] [INFO ] Invariant cache hit.
[2023-03-12 17:53:41] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-12 17:53:41] [INFO ] Invariant cache hit.
[2023-03-12 17:53:41] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 704 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BART-COL-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s1 1), p2:(AND (LT s78 1) (LT s77 1) (LT s85 1) (LT s88 1) (LT s86 1) (LT s87 1) (LT s42 1) (LT s41 1) (LT s79 1)), p1:(OR (GEQ s78 1) (GEQ s77 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 114 reset in 354 ms.
Stack based approach found an accepted trace after 33113 steps with 45 reset with depth 729 and stack size 729 in 83 ms.
FORMULA BART-COL-020-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-020-LTLFireability-00 finished in 1679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((!p1 U p2)))))'
Support contains 70 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 11 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2023-03-12 17:53:43] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-12 17:53:43] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 17:53:43] [INFO ] Invariant cache hit.
[2023-03-12 17:53:43] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-12 17:53:43] [INFO ] Invariant cache hit.
[2023-03-12 17:53:43] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : BART-COL-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p2:(GEQ s0 1), p1:(LT s1 1), p0:(OR (GEQ s20 1) (GEQ s121 1) (GEQ s22 1) (GEQ s119 1) (GEQ s24 1) (GEQ s125 1) (GEQ s26 1) (GEQ s123 1) (GEQ s12 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 1 ms.
FORMULA BART-COL-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-020-LTLFireability-01 finished in 689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p0&&G(!p1))))'
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 132 transition count 178
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 108 transition count 178
Applied a total of 48 rules in 41 ms. Remains 108 /132 variables (removed 24) and now considering 178/202 (removed 24) transitions.
// Phase 1: matrix 178 rows 108 cols
[2023-03-12 17:53:43] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-12 17:53:43] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-12 17:53:43] [INFO ] Invariant cache hit.
[2023-03-12 17:53:44] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-12 17:53:44] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-12 17:53:44] [INFO ] Invariant cache hit.
[2023-03-12 17:53:44] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/132 places, 178/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 401 ms. Remains : 108/132 places, 178/202 transitions.
Stuttering acceptance computed with spot in 190 ms :[p1, true, (OR p0 p1)]
Running random walk in product with property : BART-COL-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (GEQ s19 1) (GEQ s100 1) (GEQ s21 1) (GEQ s98 1) (GEQ s23 1) (GEQ s104 1) (GEQ s25 1) (GEQ s102 1) (GEQ s11 1) (GEQ s92 1) (GEQ s13 1) (GEQ s90 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 0 ms.
FORMULA BART-COL-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-020-LTLFireability-03 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 30 rules applied. Total rules applied 33 place count 129 transition count 172
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 60 place count 102 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 101 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 101 transition count 171
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 97 transition count 167
Applied a total of 70 rules in 26 ms. Remains 97 /132 variables (removed 35) and now considering 167/202 (removed 35) transitions.
// Phase 1: matrix 167 rows 97 cols
[2023-03-12 17:53:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 17:53:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 17:53:44] [INFO ] Invariant cache hit.
[2023-03-12 17:53:44] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-12 17:53:44] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 17:53:44] [INFO ] Invariant cache hit.
[2023-03-12 17:53:44] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/132 places, 167/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 360 ms. Remains : 97/132 places, 167/202 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s19 1) (GEQ s89 1) (GEQ s21 1) (GEQ s87 1) (GEQ s23 1) (GEQ s93 1) (GEQ s25 1) (GEQ s91 1) (GEQ s11 1) (GEQ s81 1) (GEQ s13 1) (GEQ s79 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 293 ms.
Product exploration explored 100000 steps with 0 reset in 489 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 215 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 290 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
[2023-03-12 17:53:46] [INFO ] Invariant cache hit.
[2023-03-12 17:53:46] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 17:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:53:46] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-12 17:53:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:53:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 17:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:53:47] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-12 17:53:47] [INFO ] Computed and/alt/rep : 131/235/131 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-12 17:53:47] [INFO ] Added : 131 causal constraints over 27 iterations in 730 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 68 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 167/167 transitions.
Applied a total of 0 rules in 20 ms. Remains 97 /97 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2023-03-12 17:53:47] [INFO ] Invariant cache hit.
[2023-03-12 17:53:48] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-12 17:53:48] [INFO ] Invariant cache hit.
[2023-03-12 17:53:48] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-12 17:53:48] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 17:53:48] [INFO ] Invariant cache hit.
[2023-03-12 17:53:48] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 691 ms. Remains : 97/97 places, 167/167 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 272 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 314 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
[2023-03-12 17:53:49] [INFO ] Invariant cache hit.
[2023-03-12 17:53:50] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 17:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:53:50] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-12 17:53:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:53:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 17:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:53:51] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2023-03-12 17:53:51] [INFO ] Computed and/alt/rep : 131/235/131 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-12 17:53:51] [INFO ] Added : 131 causal constraints over 27 iterations in 695 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 280 ms.
Product exploration explored 100000 steps with 0 reset in 352 ms.
Support contains 68 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 167/167 transitions.
Applied a total of 0 rules in 17 ms. Remains 97 /97 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2023-03-12 17:53:52] [INFO ] Invariant cache hit.
[2023-03-12 17:53:52] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 17:53:52] [INFO ] Invariant cache hit.
[2023-03-12 17:53:52] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-12 17:53:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 17:53:52] [INFO ] Invariant cache hit.
[2023-03-12 17:53:53] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 552 ms. Remains : 97/97 places, 167/167 transitions.
Treatment of property BART-COL-020-LTLFireability-05 finished in 8788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0))&&((!p1 U X(X(p1))) U (p1&&(!p1 U X(X(p1))))))))'
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-12 17:53:53] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-12 17:53:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-12 17:53:53] [INFO ] Invariant cache hit.
[2023-03-12 17:53:53] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-12 17:53:53] [INFO ] Invariant cache hit.
[2023-03-12 17:53:53] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BART-COL-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s20 1) (GEQ s124 1) (GEQ s22 1) (GEQ s122 1) (GEQ s24 1) (GEQ s128 1) (GEQ s26 1) (GEQ s126 1) (GEQ s12 1) (GEQ s116 1) (GEQ s14 1) (GEQ s114 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 303 ms.
Stack based approach found an accepted trace after 31582 steps with 1 reset with depth 31579 and stack size 31576 in 74 ms.
FORMULA BART-COL-020-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-020-LTLFireability-06 finished in 1285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0||(F(!p1) U X(!p2))))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 6 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2023-03-12 17:53:54] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 17:53:54] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-12 17:53:54] [INFO ] Invariant cache hit.
[2023-03-12 17:53:54] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-12 17:53:54] [INFO ] Invariant cache hit.
[2023-03-12 17:53:54] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Running random walk in product with property : BART-COL-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1), p2:(AND (OR (GEQ s78 1) (GEQ s77 1) (GEQ s85 1) (GEQ s88 1) (GEQ s86 1) (GEQ s87 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 1)) (GEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33124 reset in 202 ms.
Product exploration explored 100000 steps with 33183 reset in 187 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X p0)]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 2 factoid took 286 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND p2 p0), (AND p2 p0), (AND p2 p0)]
Finished random walk after 6161 steps, including 1 resets, run visited all 1 properties in 26 ms. (steps per millisecond=236 )
Knowledge obtained : [(AND p0 (NOT p2)), (X p0)]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (AND p2 p0))]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND p2 p0), (AND p2 p0), (AND p2 p0)]
Stuttering acceptance computed with spot in 216 ms :[(AND p2 p0), (AND p2 p0), (AND p2 p0)]
Support contains 10 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Applied a total of 0 rules in 11 ms. Remains 90 /90 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2023-03-12 17:53:56] [INFO ] Invariant cache hit.
[2023-03-12 17:53:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-12 17:53:56] [INFO ] Invariant cache hit.
[2023-03-12 17:53:57] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-12 17:53:57] [INFO ] Invariant cache hit.
[2023-03-12 17:53:57] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 90/90 places, 160/160 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0)]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Finished random walk after 491 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=98 )
Knowledge obtained : [(AND (NOT p2) p0)]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (AND p0 p2))]
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 210 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 240 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 33102 reset in 239 ms.
Product exploration explored 100000 steps with 33176 reset in 185 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 156 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Support contains 10 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 90 transition count 160
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 11 place count 90 transition count 160
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 90 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 89 transition count 159
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 89 transition count 159
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 38 place count 89 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 89 transition count 159
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 58 place count 70 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 77 place count 70 transition count 140
Performed 33 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 110 place count 70 transition count 602
Ensure Unique test removed 281 transitions
Reduce isomorphic transitions removed 281 transitions.
Iterating post reduction 2 with 281 rules applied. Total rules applied 391 place count 70 transition count 321
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 416 place count 45 transition count 101
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 441 place count 45 transition count 101
Deduced a syphon composed of 24 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 442 place count 45 transition count 100
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 442 rules in 37 ms. Remains 45 /90 variables (removed 45) and now considering 100/160 (removed 60) transitions.
[2023-03-12 17:53:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 45 cols
[2023-03-12 17:53:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 17:53:59] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/90 places, 100/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 45/90 places, 100/160 transitions.
Support contains 10 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 160/160 (removed 0) transitions.
// Phase 1: matrix 160 rows 90 cols
[2023-03-12 17:53:59] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 17:53:59] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-12 17:53:59] [INFO ] Invariant cache hit.
[2023-03-12 17:53:59] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-12 17:53:59] [INFO ] Invariant cache hit.
[2023-03-12 17:54:00] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1085 ms. Remains : 90/90 places, 160/160 transitions.
Treatment of property BART-COL-020-LTLFireability-08 finished in 6124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G((F(G(!p1))&&F(p2)))))))'
Support contains 99 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-12 17:54:00] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 17:54:00] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-12 17:54:00] [INFO ] Invariant cache hit.
[2023-03-12 17:54:01] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2023-03-12 17:54:01] [INFO ] Invariant cache hit.
[2023-03-12 17:54:02] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1735 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 560 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), p1, (NOT p2), (OR (NOT p2) p1), (NOT p0)]
Running random walk in product with property : BART-COL-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LT s78 1) (LT s77 1) (LT s108 1) (LT s111 1) (LT s109 1) (LT s110 1) (LT s42 1) (LT s41 1) (LT s79 1)), p2:(AND (OR (GEQ s20 1) (GEQ s24 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 276 ms.
Stack based approach found an accepted trace after 10962 steps with 3 reset with depth 10678 and stack size 10677 in 20 ms.
FORMULA BART-COL-020-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-020-LTLFireability-09 finished in 2691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 22 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2023-03-12 17:54:03] [INFO ] Computed 1 place invariants in 7 ms
[2023-03-12 17:54:03] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-12 17:54:03] [INFO ] Invariant cache hit.
[2023-03-12 17:54:03] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-12 17:54:03] [INFO ] Invariant cache hit.
[2023-03-12 17:54:04] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1051 ms. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s0 1), p1:(OR (GEQ s20 1) (GEQ s24 1) (GEQ s12 1) (GEQ s68 1) (GEQ s16 1) (GEQ s60 1) (GEQ s8 1) (GEQ s64 1) (GEQ s52 1) (GEQ s56 1) (GEQ s43 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-020-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-020-LTLFireability-10 finished in 1677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0&&F(p1)))||X(F(!p1))))'
Support contains 97 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-12 17:54:05] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 17:54:05] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 17:54:05] [INFO ] Invariant cache hit.
[2023-03-12 17:54:05] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-12 17:54:05] [INFO ] Invariant cache hit.
[2023-03-12 17:54:05] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 265 ms :[p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : BART-COL-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s20 1) (GEQ s24 1) (GEQ s12 1) (GEQ s73 1) (GEQ s16 1) (GEQ s65 1) (GEQ s8 1) (GEQ s69 1) (GEQ s57 1) (GEQ s61 1) (GEQ s48 1) (GEQ s105 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 478 reset in 345 ms.
Stack based approach found an accepted trace after 83748 steps with 399 reset with depth 257 and stack size 257 in 226 ms.
FORMULA BART-COL-020-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-020-LTLFireability-13 finished in 1327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0||(F(!p1) U X(!p2))))))'
Found a Shortening insensitive property : BART-COL-020-LTLFireability-08
Stuttering acceptance computed with spot in 201 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 132 transition count 145
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 75 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 114 place count 75 transition count 144
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 116 place count 74 transition count 144
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 69 transition count 139
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 69 transition count 139
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 156 place count 54 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 54 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 53 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 53 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 52 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 52 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 51 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 166 place count 51 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 168 place count 50 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 170 place count 50 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 172 place count 49 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 174 place count 49 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 176 place count 48 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 178 place count 48 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 180 place count 47 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 182 place count 47 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 184 place count 46 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 186 place count 46 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 188 place count 45 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 190 place count 45 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 192 place count 44 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 194 place count 44 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 196 place count 43 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 198 place count 43 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 200 place count 42 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 202 place count 42 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 204 place count 41 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 206 place count 41 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 208 place count 40 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 210 place count 40 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 212 place count 39 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 214 place count 39 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 216 place count 38 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 218 place count 38 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 220 place count 37 transition count 77
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 37 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 224 place count 36 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 226 place count 36 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 228 place count 35 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 230 place count 35 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 232 place count 34 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 234 place count 34 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 236 place count 33 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 238 place count 33 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 240 place count 32 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 242 place count 32 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 244 place count 31 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 245 place count 31 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 247 place count 30 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 248 place count 30 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 250 place count 29 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 251 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 253 place count 28 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 255 place count 28 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 257 place count 27 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 259 place count 27 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 261 place count 26 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 263 place count 26 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 265 place count 25 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 267 place count 25 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 269 place count 24 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 270 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 272 place count 23 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 273 place count 23 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 275 place count 22 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 277 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 279 place count 21 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 281 place count 21 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 282 place count 21 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 283 place count 21 transition count 31
Discarding 1 places :
Symmetric choice reduction at 37 with 1 rule applications. Total rules 284 place count 20 transition count 30
Iterating global reduction 37 with 1 rules applied. Total rules applied 285 place count 20 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 37 with 1 rules applied. Total rules applied 286 place count 20 transition count 29
Applied a total of 286 rules in 71 ms. Remains 20 /132 variables (removed 112) and now considering 29/202 (removed 173) transitions.
// Phase 1: matrix 29 rows 20 cols
[2023-03-12 17:54:06] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 17:54:06] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 17:54:06] [INFO ] Invariant cache hit.
[2023-03-12 17:54:06] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-12 17:54:06] [INFO ] Invariant cache hit.
[2023-03-12 17:54:07] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 20/132 places, 29/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 215 ms. Remains : 20/132 places, 29/202 transitions.
Running random walk in product with property : BART-COL-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1), p2:(AND (OR (GEQ s9 1) (GEQ s8 1) (GEQ s15 1) (GEQ s18 1) (GEQ s16 1) (GEQ s17 1) (GEQ s4 1) (GEQ s3 1) (GEQ s10 1)) (GEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 18698 reset in 133 ms.
Stack based approach found an accepted trace after 56 steps with 6 reset with depth 36 and stack size 36 in 0 ms.
Treatment of property BART-COL-020-LTLFireability-08 finished in 660 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-12 17:54:07] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:54:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 17:54:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 202 transitions and 404 arcs took 1 ms.
Total runtime 28706 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1099/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1099/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BART-COL-020-LTLFireability-05
Could not compute solution for formula : BART-COL-020-LTLFireability-08

BK_STOP 1678643648182

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BART-COL-020-LTLFireability-05
ltl formula formula --ltl=/tmp/1099/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 132 places, 202 transitions and 404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1099/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1099/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1099/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.000 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1099/ltl_0_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
ltl formula name BART-COL-020-LTLFireability-08
ltl formula formula --ltl=/tmp/1099/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 132 places, 202 transitions and 404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1099/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1099/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1099/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1099/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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-COL-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BART-COL-020, 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 r009-oct2-167813598300716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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