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-167813598300748.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-060, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598300748
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.2K Feb 26 07:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 07:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 05: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 4.0K 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 13K Feb 26 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 08:53 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 219K 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-060-LTLFireability-00
FORMULA_NAME BART-COL-060-LTLFireability-01
FORMULA_NAME BART-COL-060-LTLFireability-02
FORMULA_NAME BART-COL-060-LTLFireability-03
FORMULA_NAME BART-COL-060-LTLFireability-04
FORMULA_NAME BART-COL-060-LTLFireability-05
FORMULA_NAME BART-COL-060-LTLFireability-06
FORMULA_NAME BART-COL-060-LTLFireability-07
FORMULA_NAME BART-COL-060-LTLFireability-08
FORMULA_NAME BART-COL-060-LTLFireability-09
FORMULA_NAME BART-COL-060-LTLFireability-10
FORMULA_NAME BART-COL-060-LTLFireability-11
FORMULA_NAME BART-COL-060-LTLFireability-12
FORMULA_NAME BART-COL-060-LTLFireability-13
FORMULA_NAME BART-COL-060-LTLFireability-14
FORMULA_NAME BART-COL-060-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678644531883

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-060
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:08:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:08:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:08:55] [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 18:08:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 18:08:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 991 ms
[2023-03-12 18:08:56] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2023-03-12 18:08:56] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 25133 PT places and 8.443377072E10 transition bindings in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 18:08:57] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 10 ms.
[2023-03-12 18:08:57] [INFO ] Skeletonized 2 HLPN properties in 2 ms. Removed 14 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.
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 60
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [3:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
[2023-03-12 18:08:58] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 894 ms.
[2023-03-12 18:08:58] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
[2023-03-12 18:08:58] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 18:08:58] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 18:08:58] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 18:08:58] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 18:08:58] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 18:08:58] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 2 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-060-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-060-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-060-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-060-LTLFireability-10 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 26 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 18:08:58] [INFO ] Computed 1 place invariants in 10 ms
[2023-03-12 18:08:58] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-12 18:08:58] [INFO ] Invariant cache hit.
[2023-03-12 18:08:58] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2023-03-12 18:08:58] [INFO ] Invariant cache hit.
[2023-03-12 18:08:59] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1513 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2023-03-12 18:09:00] [INFO ] Flatten gal took : 77 ms
[2023-03-12 18:09:00] [INFO ] Flatten gal took : 21 ms
[2023-03-12 18:09:00] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 977 steps, including 0 resets, run visited all 13 properties in 19 ms. (steps per millisecond=51 )
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(((p1&&F(p2))||p0))))'
Support contains 98 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 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-12 18:09:01] [INFO ] Invariant cache hit.
[2023-03-12 18:09:01] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-12 18:09:01] [INFO ] Invariant cache hit.
[2023-03-12 18:09:01] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-12 18:09:01] [INFO ] Invariant cache hit.
[2023-03-12 18:09:01] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 687 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 511 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BART-COL-060-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (LT s98 1) (LT s49 1) (LT s102 1) (LT s53 1) (LT s106 1) (LT s57 1) (LT s61 1) (LT s65 1) (LT s69 1) (LT s8 1) (LT s73 1) (LT s12 1) (LT s16 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 566 ms.
Product exploration explored 100000 steps with 50000 reset in 425 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p2)))))
Knowledge based reduction with 6 factoid took 189 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-060-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-060-LTLFireability-02 finished in 2554 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((p1&&(p2 U G(!p2))))||p0))))'
Support contains 98 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 5 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-12 18:09:03] [INFO ] Invariant cache hit.
[2023-03-12 18:09:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 18:09:03] [INFO ] Invariant cache hit.
[2023-03-12 18:09:03] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-12 18:09:03] [INFO ] Invariant cache hit.
[2023-03-12 18:09:04] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 669 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Running random walk in product with property : BART-COL-060-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(GEQ s0 1), p0:(OR (GEQ s42 1) (GEQ s111 1) (GEQ s110 1) (GEQ s109 1) (GEQ s108 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 1)), p2:(AND (LT s98 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1607 reset in 572 ms.
Product exploration explored 100000 steps with 1635 reset in 692 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 1109 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 411 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Finished random walk after 244 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=122 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0) p1))), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 1423 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
[2023-03-12 18:09:09] [INFO ] Invariant cache hit.
[2023-03-12 18:09:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:09:09] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2023-03-12 18:09:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:09:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:09:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:09:11] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-12 18:09:11] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-12 18:09:11] [INFO ] Added : 97 causal constraints over 20 iterations in 449 ms. Result :sat
Could not prove EG (AND (NOT p0) p2)
Support contains 98 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 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-12 18:09:11] [INFO ] Invariant cache hit.
[2023-03-12 18:09:11] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 18:09:11] [INFO ] Invariant cache hit.
[2023-03-12 18:09:12] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-12 18:09:12] [INFO ] Invariant cache hit.
[2023-03-12 18:09:12] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 856 ms. Remains : 132/132 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 1158 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Finished random walk after 305 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0) p1))), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 1288 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 362 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
[2023-03-12 18:09:16] [INFO ] Invariant cache hit.
[2023-03-12 18:09:16] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:09:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:09:16] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-12 18:09:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:09:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 27 ms returned sat
[2023-03-12 18:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:09:17] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-12 18:09:17] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-12 18:09:18] [INFO ] Added : 97 causal constraints over 20 iterations in 603 ms. Result :sat
Could not prove EG (AND (NOT p0) p2)
Stuttering acceptance computed with spot in 337 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 1656 reset in 511 ms.
Product exploration explored 100000 steps with 1621 reset in 444 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 341 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 132 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 132 transition count 202
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 132 transition count 202
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 24 place count 132 transition count 202
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 38 place count 118 transition count 188
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 52 place count 118 transition count 188
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 52 rules in 30 ms. Remains 118 /132 variables (removed 14) and now considering 188/202 (removed 14) transitions.
[2023-03-12 18:09:20] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 188 rows 118 cols
[2023-03-12 18:09:20] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:09:20] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/132 places, 188/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 442 ms. Remains : 118/132 places, 188/202 transitions.
Support contains 98 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 18:09:20] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:09:20] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 18:09:20] [INFO ] Invariant cache hit.
[2023-03-12 18:09:20] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-12 18:09:20] [INFO ] Invariant cache hit.
[2023-03-12 18:09:21] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 132/132 places, 202/202 transitions.
Treatment of property BART-COL-060-LTLFireability-03 finished in 17624 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(F(!p0)))'
Support contains 1 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 128 place count 68 transition count 133
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 57 transition count 127
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 57 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 57 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 155 place count 53 transition count 122
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 53 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 50 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 50 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 47 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 47 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 173 place count 45 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 45 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 43 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 43 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 42 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 42 transition count 111
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 195 place count 35 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 199 place count 35 transition count 100
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 203 place count 33 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 207 place count 33 transition count 94
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 211 place count 31 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 215 place count 31 transition count 88
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 219 place count 29 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 223 place count 29 transition count 82
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 227 place count 27 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 231 place count 27 transition count 76
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 235 place count 25 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 239 place count 25 transition count 70
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 243 place count 23 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 247 place count 23 transition count 64
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 251 place count 21 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 255 place count 21 transition count 58
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 259 place count 19 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 263 place count 19 transition count 52
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 267 place count 17 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 271 place count 17 transition count 46
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 275 place count 15 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 279 place count 15 transition count 40
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 283 place count 13 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 287 place count 13 transition count 34
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 291 place count 11 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 295 place count 11 transition count 28
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 299 place count 9 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 303 place count 9 transition count 22
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 307 place count 7 transition count 20
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 311 place count 7 transition count 16
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 315 place count 5 transition count 14
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 319 place count 5 transition count 10
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 323 place count 3 transition count 8
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 328 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 330 place count 2 transition count 2
Applied a total of 330 rules in 40 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-12 18:09:21] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 18:09:21] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-12 18:09:21] [INFO ] Invariant cache hit.
[2023-03-12 18:09:21] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-12 18:09:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 18:09:21] [INFO ] Invariant cache hit.
[2023-03-12 18:09:21] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 2/132 places, 2/202 transitions.
Stuttering acceptance computed with spot in 121 ms :[p0, p0]
Running random walk in product with property : BART-COL-060-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22 reset in 47 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA BART-COL-060-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-060-LTLFireability-04 finished in 373 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(F(p0)))'
Support contains 121 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 200
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 126 transition count 196
Applied a total of 12 rules in 9 ms. Remains 126 /132 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 126 cols
[2023-03-12 18:09:21] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-12 18:09:21] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-12 18:09:21] [INFO ] Invariant cache hit.
[2023-03-12 18:09:21] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-12 18:09:21] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 18:09:21] [INFO ] Invariant cache hit.
[2023-03-12 18:09:22] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/132 places, 196/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 126/132 places, 196/202 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-060-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s44 1) (GEQ s42 1) (GEQ s1 1) (GEQ s3 1) (GEQ s5 1) (GEQ s7 1) (GEQ s9 1) (GEQ s108 1) (GEQ s11 1) (GEQ s106 1) (GEQ s13 1) (GEQ s112 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 261 ms.
Product exploration explored 100000 steps with 3 reset in 289 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 (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (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 (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
[2023-03-12 18:09:23] [INFO ] Invariant cache hit.
[2023-03-12 18:09:24] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2023-03-12 18:09:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:09:24] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-12 18:09:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:09:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:09:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:09:24] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2023-03-12 18:09:24] [INFO ] Computed and/alt/rep : 160/264/160 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-12 18:09:25] [INFO ] Added : 160 causal constraints over 33 iterations in 569 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 121 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-12 18:09:25] [INFO ] Invariant cache hit.
[2023-03-12 18:09:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-12 18:09:25] [INFO ] Invariant cache hit.
[2023-03-12 18:09:25] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-12 18:09:25] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-12 18:09:25] [INFO ] Invariant cache hit.
[2023-03-12 18:09:25] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 352 ms. Remains : 126/126 places, 196/196 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 (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (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 (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 310 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
[2023-03-12 18:09:26] [INFO ] Invariant cache hit.
[2023-03-12 18:09:27] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 18:09:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:09:27] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2023-03-12 18:09:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:09:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-12 18:09:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:09:28] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2023-03-12 18:09:28] [INFO ] Computed and/alt/rep : 160/264/160 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-12 18:09:29] [INFO ] Added : 160 causal constraints over 33 iterations in 988 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 336 ms.
Product exploration explored 100000 steps with 1 reset in 218 ms.
Support contains 121 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 196/196 transitions.
Applied a total of 0 rules in 23 ms. Remains 126 /126 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-12 18:09:29] [INFO ] Invariant cache hit.
[2023-03-12 18:09:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-12 18:09:29] [INFO ] Invariant cache hit.
[2023-03-12 18:09:30] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2023-03-12 18:09:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 18:09:30] [INFO ] Invariant cache hit.
[2023-03-12 18:09:30] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 837 ms. Remains : 126/126 places, 196/196 transitions.
Treatment of property BART-COL-060-LTLFireability-05 finished in 9070 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)))'
Support contains 68 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 3 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 18:09:30] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:09:30] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 18:09:30] [INFO ] Invariant cache hit.
[2023-03-12 18:09:30] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-12 18:09:30] [INFO ] Invariant cache hit.
[2023-03-12 18:09:30] [INFO ] Dead Transitions using invariants and state equation in 169 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 323 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-060-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s111 1) (GEQ s12 1) (GEQ s109 1) (GEQ s14 1) (GEQ s115 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 287 ms.
Product exploration explored 100000 steps with 50000 reset in 236 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 (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 261 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-060-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-060-LTLFireability-06 finished in 1252 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 U (!p1 U G(!p2))) U (F(!p2)&&X(p3)))))'
Support contains 122 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 18:09:31] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:09:32] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 18:09:32] [INFO ] Invariant cache hit.
[2023-03-12 18:09:32] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-12 18:09:32] [INFO ] Invariant cache hit.
[2023-03-12 18:09:32] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 916 ms :[(OR (NOT p3) p2), p2, (NOT p3), (AND p2 (NOT p3)), (NOT p3), (AND p2 (NOT p3)), (AND p2 (NOT p3)), true, p2, p2, p2]
Running random walk in product with property : BART-COL-060-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 7}], [{ cond=(AND p2 p1 (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 9}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 9}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 10}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p2, acceptance={} source=8 dest: 7}, { cond=(NOT p2), acceptance={} source=8 dest: 8}], [{ cond=(AND p2 p1), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 9}, { cond=(AND p2 (NOT p1)), acceptance={0} source=9 dest: 9}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 10}, { cond=(AND p2 p0), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p2:(LT s1 1), p1:(AND (LT s98 1) (LT s49 1) (LT s102 1) (LT s53 1) (LT s106 1) (LT s57 1) (LT s61 1) (LT s65 1) (LT s69 1) (LT s8 1) (LT s73 1) (LT s12 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 10147 steps with 110 reset in 81 ms.
FORMULA BART-COL-060-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-08 finished in 1649 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(!p0) U (!p1||F((p1&&G(!p2))))))'
Support contains 79 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.
[2023-03-12 18:09:33] [INFO ] Invariant cache hit.
[2023-03-12 18:09:33] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 18:09:33] [INFO ] Invariant cache hit.
[2023-03-12 18:09:33] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-12 18:09:33] [INFO ] Invariant cache hit.
[2023-03-12 18:09:34] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 557 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND p1 p2), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (NOT p1) p2), p2]
Running random walk in product with property : BART-COL-060-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) p0) (AND p2 p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s1 1), p2:(AND (OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s114 1) (GEQ s12 1) (GEQ s112 1) (GEQ s14 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 691 reset in 250 ms.
Stack based approach found an accepted trace after 37341 steps with 1172 reset with depth 33876 and stack size 33876 in 124 ms.
FORMULA BART-COL-060-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-060-LTLFireability-09 finished in 1289 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((X(!p1)&&p0))&&X(G(!p2))))'
Support contains 78 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.
[2023-03-12 18:09:34] [INFO ] Invariant cache hit.
[2023-03-12 18:09:34] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-12 18:09:34] [INFO ] Invariant cache hit.
[2023-03-12 18:09:35] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-12 18:09:35] [INFO ] Invariant cache hit.
[2023-03-12 18:09:35] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 564 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 409 ms :[p2, (OR p2 p1), true, (OR (NOT p0) p2 p1), (OR (NOT p0) p2 p1)]
Running random walk in product with property : BART-COL-060-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=p2, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(GEQ s0 1), p1:(OR (GEQ s42 1) (GEQ s111 1) (GEQ s110 1) (GEQ s109 1) (GEQ s108 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 1)), p0:(AND (LT s45 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-060-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-11 finished in 1026 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(G(!p0)))'
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 26 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2023-03-12 18:09:35] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 18:09:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-12 18:09:35] [INFO ] Invariant cache hit.
[2023-03-12 18:09:36] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-12 18:09:36] [INFO ] Invariant cache hit.
[2023-03-12 18:09:36] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 49/132 places, 119/202 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, p0, p0]
Running random walk in product with property : BART-COL-060-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-060-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-12 finished in 533 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((X(p0) U p1)) U p2))'
Support contains 122 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 18:09:36] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 18:09:36] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 18:09:36] [INFO ] Invariant cache hit.
[2023-03-12 18:09:36] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-12 18:09:36] [INFO ] Invariant cache hit.
[2023-03-12 18:09:37] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : BART-COL-060-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s114 1) (GEQ s12 1) (GEQ s112 1) (GEQ s14 1) (GEQ s118 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 95791 steps with 4 reset in 220 ms.
FORMULA BART-COL-060-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-13 finished in 1232 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 0 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 6 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 18:09:37] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:09:37] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 18:09:37] [INFO ] Invariant cache hit.
[2023-03-12 18:09:37] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-12 18:09:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 18:09:37] [INFO ] Invariant cache hit.
[2023-03-12 18:09:38] [INFO ] Dead Transitions using invariants and state equation in 384 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 723 ms. Remains : 97/132 places, 167/202 transitions.
Stuttering acceptance computed with spot in 63 ms :[p0]
Running random walk in product with property : BART-COL-060-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s44 1) (GEQ s42 1) (GEQ s1 1) (GEQ s3 1) (GEQ s5 1) (GEQ s7 1) (GEQ s9 1) (GEQ s79 1) (GEQ s11 1) (GEQ s77 1) (GEQ s13 1) (GEQ s83 1) (GEQ s15...], 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 202 ms.
Stack based approach found an accepted trace after 1322 steps with 0 reset with depth 1323 and stack size 1323 in 4 ms.
FORMULA BART-COL-060-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-060-LTLFireability-14 finished in 1015 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(G(p0)))'
Support contains 68 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 3 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 18:09:38] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 18:09:38] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-12 18:09:38] [INFO ] Invariant cache hit.
[2023-03-12 18:09:38] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-12 18:09:38] [INFO ] Invariant cache hit.
[2023-03-12 18:09:39] [INFO ] Dead Transitions using invariants and state equation in 131 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 395 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-060-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s111 1) (GEQ s12 1) (GEQ s109 1) (GEQ s14 1) (GEQ s115 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 43132 steps with 0 reset in 144 ms.
FORMULA BART-COL-060-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-15 finished in 716 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((p1&&(p2 U G(!p2))))||p0))))'
Found a Shortening insensitive property : BART-COL-060-LTLFireability-03
Stuttering acceptance computed with spot in 348 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Support contains 98 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 201
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 9 rules applied. Total rules applied 10 place count 131 transition count 193
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 18 place count 123 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 123 transition count 192
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 122 transition count 192
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 48 place count 108 transition count 178
Applied a total of 48 rules in 6 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 18:09:39] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 18:09:39] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-12 18:09:39] [INFO ] Invariant cache hit.
[2023-03-12 18:09:40] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-12 18:09:40] [INFO ] Invariant cache hit.
[2023-03-12 18:09:40] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 108/132 places, 178/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 443 ms. Remains : 108/132 places, 178/202 transitions.
Running random walk in product with property : BART-COL-060-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(GEQ s0 1), p0:(OR (GEQ s38 1) (GEQ s103 1) (GEQ s102 1) (GEQ s101 1) (GEQ s100 1) (GEQ s71 1) (GEQ s72 1) (GEQ s73 1) (GEQ s37 1)), p2:(AND (LT s90 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1844 reset in 467 ms.
Product exploration explored 100000 steps with 1861 reset in 470 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 1106 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Finished random walk after 305 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=152 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0) p1))), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 1311 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 417 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
[2023-03-12 18:09:44] [INFO ] Invariant cache hit.
[2023-03-12 18:09:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:09:45] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-12 18:09:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:09:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:09:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:09:45] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-12 18:09:45] [INFO ] Computed and/alt/rep : 142/246/142 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-12 18:09:45] [INFO ] Added : 79 causal constraints over 16 iterations in 244 ms. Result :sat
Could not prove EG (AND (NOT p0) p2)
Support contains 98 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-12 18:09:45] [INFO ] Invariant cache hit.
[2023-03-12 18:09:45] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-12 18:09:45] [INFO ] Invariant cache hit.
[2023-03-12 18:09:45] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-12 18:09:45] [INFO ] Invariant cache hit.
[2023-03-12 18:09:45] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 108/108 places, 178/178 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 973 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Finished random walk after 244 steps, including 0 resets, run visited all 7 properties in 16 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0) p1))), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 1141 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 386 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
[2023-03-12 18:09:49] [INFO ] Invariant cache hit.
[2023-03-12 18:09:49] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:09:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:09:49] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2023-03-12 18:09:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:09:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:09:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:09:50] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-12 18:09:50] [INFO ] Computed and/alt/rep : 142/246/142 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-12 18:09:50] [INFO ] Added : 79 causal constraints over 16 iterations in 402 ms. Result :sat
Could not prove EG (AND (NOT p0) p2)
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 1831 reset in 474 ms.
Product exploration explored 100000 steps with 1802 reset in 459 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 361 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Support contains 98 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-12 18:09:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 18:09:52] [INFO ] Invariant cache hit.
[2023-03-12 18:09:52] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 108/108 places, 178/178 transitions.
Support contains 98 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 178/178 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-12 18:09:52] [INFO ] Invariant cache hit.
[2023-03-12 18:09:52] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 18:09:52] [INFO ] Invariant cache hit.
[2023-03-12 18:09:52] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-12 18:09:52] [INFO ] Invariant cache hit.
[2023-03-12 18:09:52] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 108/108 places, 178/178 transitions.
Treatment of property BART-COL-060-LTLFireability-03 finished in 13576 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(F(p0)))'
[2023-03-12 18:09:53] [INFO ] Flatten gal took : 10 ms
[2023-03-12 18:09:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2023-03-12 18:09:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 202 transitions and 404 arcs took 3 ms.
Total runtime 57363 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1805/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1805/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BART-COL-060-LTLFireability-03
Could not compute solution for formula : BART-COL-060-LTLFireability-05

BK_STOP 1678644593960

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-060-LTLFireability-03
ltl formula formula --ltl=/tmp/1805/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( 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( 3/ 4): LTL layer: formula: /tmp/1805/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1805/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1805/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1805/ltl_0_
pnml2lts-mc( 2/ 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( 0/ 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( 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:
0: pnml2lts-mc(+0xa23f4) [0x560b3bf633f4]
0: pnml2lts-mc(+0xa23f4) [0x560b3bf633f4]
1: pnml2lts-mc(+0xa2496) [0x560b3bf63496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe0f4264140]
1: pnml2lts-mc(+0xa2496) [0x560b3bf63496]
3: pnml2lts-mc(+0x405be5) [0x560b3c2c6be5]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe0f4264140]
4: pnml2lts-mc(+0x16b3f9) [0x560b3c02c3f9]
3: pnml2lts-mc(+0x405be5) [0x560b3c2c6be5]
5: pnml2lts-mc(+0x164ac4) [0x560b3c025ac4]
4: pnml2lts-mc(+0x16b3f9) [0x560b3c02c3f9]
6: pnml2lts-mc(+0x272e0a) [0x560b3c133e0a]
5: pnml2lts-mc(+0x164ac4) [0x560b3c025ac4]
7: pnml2lts-mc(+0xb61f0) [0x560b3bf771f0]
6: pnml2lts-mc(+0x272e0a) [0x560b3c133e0a]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fe0f40b74d7]
7: pnml2lts-mc(+0xb61f0) [0x560b3bf771f0]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fe0f40b767a]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fe0f40b74d7]
10: pnml2lts-mc(+0xa1581) [0x560b3bf62581]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fe0f40b767a]
11: pnml2lts-mc(+0xa1910) [0x560b3bf62910]
10: pnml2lts-mc(+0xa1581) [0x560b3bf62581]
12: pnml2lts-mc(+0xa32a2) [0x560b3bf642a2]
11: pnml2lts-mc(+0xa1910) [0x560b3bf62910]
13: pnml2lts-mc(+0x8e039) [0x560b3bf4f039]
12: pnml2lts-mc(+0xa32a2) [0x560b3bf642a2]
14: pnml2lts-mc(+0x8f01d) [0x560b3bf5001d]
13: pnml2lts-mc(+0x8e039) [0x560b3bf4f039]
15: pnml2lts-mc(+0x7fedb) [0x560b3bf40edb]
14: pnml2lts-mc(+0x8f01d) [0x560b3bf5001d]
16: pnml2lts-mc(+0x6095d) [0x560b3bf2195d]
15: pnml2lts-mc(+0x7fedb) [0x560b3bf40edb]
17: pnml2lts-mc(+0x609f0) [0x560b3bf219f0]
16: pnml2lts-mc(+0x6095d) [0x560b3bf2195d]
18: pnml2lts-mc(+0x5eb0a) [0x560b3bf1fb0a]
17: pnml2lts-mc(+0x609f0) [0x560b3bf219f0]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fe0f409fd0a]
18: pnml2lts-mc(+0x5eb0a) [0x560b3bf1fb0a]
20: pnml2lts-mc(+0x6075e) [0x560b3bf2175e]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fe0f409fd0a]
20: pnml2lts-mc(+0x6075e) [0x560b3bf2175e]
0: pnml2lts-mc(+0xa23f4) [0x560b3bf633f4]
1: pnml2lts-mc(+0xa2496) [0x560b3bf63496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe0f4264140]
3: pnml2lts-mc(+0x405be5) [0x560b3c2c6be5]
4: pnml2lts-mc(+0x16b3f9) [0x560b3c02c3f9]
5: pnml2lts-mc(+0x164ac4) [0x560b3c025ac4]
6: pnml2lts-mc(+0x272e0a) [0x560b3c133e0a]
7: pnml2lts-mc(+0xb61f0) [0x560b3bf771f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fe0f40b74d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fe0f40b767a]
10: pnml2lts-mc(+0xa1581) [0x560b3bf62581]
11: pnml2lts-mc(+0xa1910) [0x560b3bf62910]
12: pnml2lts-mc(+0xa32a2) [0x560b3bf642a2]
13: pnml2lts-mc(+0x8e039) [0x560b3bf4f039]
14: pnml2lts-mc(+0x8f01d) [0x560b3bf5001d]
15: pnml2lts-mc(+0x7fedb) [0x560b3bf40edb]
16: pnml2lts-mc(+0x6095d) [0x560b3bf2195d]
17: pnml2lts-mc(+0x609f0) [0x560b3bf219f0]
18: pnml2lts-mc(+0x5eb0a) [0x560b3bf1fb0a]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fe0f409fd0a]
20: pnml2lts-mc(+0x6075e) [0x560b3bf2175e]
ltl formula name BART-COL-060-LTLFireability-05
ltl formula formula --ltl=/tmp/1805/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( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.040 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1805/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1805/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1805/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1805/ltl_1_
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:
corrupted size vs. prev_size in fastbins
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:
corrupted size vs. prev_size in fastbins
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 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:

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-060"
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-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 r009-oct2-167813598300748"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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