Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r026-smll-171620167600396.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BART-COL-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167600396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.5K Apr 12 22:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 22:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 21:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 21:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 23:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 22:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 22:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 189K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BART-COL-010-LTLFireability-00
FORMULA_NAME BART-COL-010-LTLFireability-01
FORMULA_NAME BART-COL-010-LTLFireability-02
FORMULA_NAME BART-COL-010-LTLFireability-03
FORMULA_NAME BART-COL-010-LTLFireability-04
FORMULA_NAME BART-COL-010-LTLFireability-05
FORMULA_NAME BART-COL-010-LTLFireability-06
FORMULA_NAME BART-COL-010-LTLFireability-07
FORMULA_NAME BART-COL-010-LTLFireability-08
FORMULA_NAME BART-COL-010-LTLFireability-09
FORMULA_NAME BART-COL-010-LTLFireability-10
FORMULA_NAME BART-COL-010-LTLFireability-11
FORMULA_NAME BART-COL-010-LTLFireability-12
FORMULA_NAME BART-COL-010-LTLFireability-13
FORMULA_NAME BART-COL-010-LTLFireability-14
FORMULA_NAME BART-COL-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716367924299

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-22 08:52:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 08:52:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:52:06] [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.
[2024-05-22 08:52:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-22 08:52:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1243 ms
[2024-05-22 08:52:07] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2024-05-22 08:52:07] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 12833 PT places and 1.407229512E10 transition bindings in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 08:52:08] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 7 ms.
[2024-05-22 08:52:08] [INFO ] Skeletonized 0 HLPN properties in 2 ms. Removed 16 properties that had guard overlaps.
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 10
Arc [1:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
[2024-05-22 08:52:08] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 431 ms.
[2024-05-22 08:52:08] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
[2024-05-22 08:52:08] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 08:52:08] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 08:52:08] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 08:52:08] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 08:52:08] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 08:52:08] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 4 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-010-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-010-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-010-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-010-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-010-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 08:52:08] [INFO ] Computed 1 invariants in 30 ms
[2024-05-22 08:52:09] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-22 08:52:09] [INFO ] Invariant cache hit.
[2024-05-22 08:52:09] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 08:52:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6357 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4810 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 11256ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 11286ms
Finished structural reductions in LTL mode , in 1 iterations and 11812 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2024-05-22 08:52:20] [INFO ] Flatten gal took : 83 ms
[2024-05-22 08:52:21] [INFO ] Flatten gal took : 52 ms
[2024-05-22 08:52:21] [INFO ] Input system was already deterministic with 202 transitions.
Reduction of identical properties reduced properties to check from 9 to 7
RANDOM walk for 367 steps (0 resets) in 21 ms. (16 steps per ms) remains 0/7 properties
FORMULA BART-COL-010-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 41 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2024-05-22 08:52:21] [INFO ] Computed 1 invariants in 10 ms
[2024-05-22 08:52:21] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 08:52:21] [INFO ] Invariant cache hit.
[2024-05-22 08:52:21] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-05-22 08:52:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/250 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 0/250 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 91 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3440 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/250 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 124/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 215 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2553 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 6043ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 6049ms
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6294 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-010-LTLFireability-01
Product exploration explored 100000 steps with 1677 reset in 546 ms.
Product exploration explored 100000 steps with 1673 reset in 441 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 6147 steps (0 resets) in 47 ms. (128 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 291 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-22 08:52:30] [INFO ] Invariant cache hit.
[2024-05-22 08:52:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 08:52:30] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-22 08:52:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:52:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 08:52:30] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-22 08:52:30] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-22 08:52:31] [INFO ] Added : 124 causal constraints over 26 iterations in 521 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 90 transition count 149
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 79 transition count 149
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 22 place count 79 transition count 144
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 32 place count 74 transition count 144
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 72 place count 54 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 54 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 53 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 53 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 52 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 79 place count 52 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 81 place count 51 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 82 place count 51 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 84 place count 50 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 86 place count 50 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 88 place count 49 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 90 place count 49 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 92 place count 48 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 94 place count 48 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 96 place count 47 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 98 place count 47 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 100 place count 46 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 102 place count 46 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 104 place count 45 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 106 place count 45 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 108 place count 44 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 110 place count 44 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 112 place count 43 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 114 place count 43 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 116 place count 42 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 118 place count 42 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 120 place count 41 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 122 place count 41 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 124 place count 40 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 126 place count 40 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 128 place count 39 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 130 place count 39 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 132 place count 38 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 134 place count 38 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 136 place count 37 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 138 place count 37 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 140 place count 36 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 142 place count 36 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 144 place count 35 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 146 place count 35 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 148 place count 34 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 150 place count 34 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 152 place count 33 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 154 place count 33 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 156 place count 32 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 158 place count 32 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 160 place count 31 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 161 place count 31 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 163 place count 30 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 164 place count 30 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 166 place count 29 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 167 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 169 place count 28 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 171 place count 28 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 173 place count 27 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 175 place count 27 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 177 place count 26 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 179 place count 26 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 181 place count 25 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 183 place count 25 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 185 place count 24 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 186 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 188 place count 23 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 189 place count 23 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 191 place count 22 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 193 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 195 place count 21 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 197 place count 21 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 198 place count 21 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 199 place count 21 transition count 31
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 200 place count 20 transition count 30
Iterating global reduction 36 with 1 rules applied. Total rules applied 201 place count 20 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 202 place count 20 transition count 29
Applied a total of 202 rules in 203 ms. Remains 20 /90 variables (removed 70) and now considering 29/160 (removed 131) transitions.
// Phase 1: matrix 29 rows 20 cols
[2024-05-22 08:52:31] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 08:52:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 08:52:31] [INFO ] Invariant cache hit.
[2024-05-22 08:52:31] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-22 08:52:31] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-22 08:52:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 29/49 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/49 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 21 constraints, problems are : Problem set: 0 solved, 19 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 29/49 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/49 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 40 constraints, problems are : Problem set: 0 solved, 19 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 535ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 537ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/90 places, 29/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 20/90 places, 29/160 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 360 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 6461 steps (1 resets) in 17 ms. (358 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 348 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-22 08:52:33] [INFO ] Invariant cache hit.
[2024-05-22 08:52:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 08:52:33] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-22 08:52:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:52:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 08:52:33] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 08:52:33] [INFO ] Computed and/alt/rep : 19/28/19 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 08:52:33] [INFO ] Added : 4 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13255 reset in 274 ms.
Stack based approach found an accepted trace after 46 steps with 7 reset with depth 7 and stack size 7 in 1 ms.
FORMULA BART-COL-010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-010-LTLFireability-01 finished in 12692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 9 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 178 edges and 132 vertex of which 41 / 132 are part of one of the 1 SCC in 4 ms
Free SCC test removed 40 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 92 transition count 71
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 68 rules applied. Total rules applied 125 place count 36 transition count 59
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 137 place count 32 transition count 51
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 149 place count 28 transition count 43
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 157 place count 24 transition count 39
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 162 place count 19 transition count 34
Iterating global reduction 5 with 5 rules applied. Total rules applied 167 place count 19 transition count 34
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 172 place count 19 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 19 transition count 28
Applied a total of 173 rules in 27 ms. Remains 19 /132 variables (removed 113) and now considering 28/202 (removed 174) transitions.
// Phase 1: matrix 28 rows 19 cols
[2024-05-22 08:52:34] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 08:52:34] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 08:52:34] [INFO ] Invariant cache hit.
[2024-05-22 08:52:34] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-22 08:52:34] [INFO ] Redundant transitions in 1 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-22 08:52:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 27/46 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 20 constraints, problems are : Problem set: 0 solved, 18 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 27/46 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 38 constraints, problems are : Problem set: 0 solved, 18 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 546ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 546ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/132 places, 28/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 656 ms. Remains : 19/132 places, 28/202 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-COL-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-03 finished in 767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U (p0 U p1)))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 20 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2024-05-22 08:52:35] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 08:52:35] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 08:52:35] [INFO ] Invariant cache hit.
[2024-05-22 08:52:35] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-22 08:52:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 101 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 134/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 235 constraints, problems are : Problem set: 0 solved, 134 unsolved in 2767 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 6315ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 6320ms
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6535 ms. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-COL-010-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 558 ms.
Stack based approach found an accepted trace after 556 steps with 1 reset with depth 518 and stack size 518 in 3 ms.
FORMULA BART-COL-010-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-010-LTLFireability-04 finished in 7312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 69 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 2 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2024-05-22 08:52:42] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 08:52:42] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 08:52:42] [INFO ] Invariant cache hit.
[2024-05-22 08:52:42] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-22 08:52:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 130 constraints, problems are : Problem set: 0 solved, 163 unsolved in 4678 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 163/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 293 constraints, problems are : Problem set: 0 solved, 163 unsolved in 3987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
After SMT, in 8686ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 8689ms
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8841 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-010-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 316 ms.
Product exploration explored 100000 steps with 50000 reset in 330 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-010-LTLFireability-06 finished in 9763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 10 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
[2024-05-22 08:52:52] [INFO ] Invariant cache hit.
[2024-05-22 08:52:52] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 08:52:52] [INFO ] Invariant cache hit.
[2024-05-22 08:52:52] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-22 08:52:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 130 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5941 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 163/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 293 constraints, problems are : Problem set: 0 solved, 163 unsolved in 3991 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
After SMT, in 9967ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 9971ms
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10216 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-COL-010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-08 finished in 10360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p0)||(X(!p0)&&G(!p1))))))'
Support contains 97 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 08:53:02] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 08:53:02] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 08:53:02] [INFO ] Invariant cache hit.
[2024-05-22 08:53:02] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 08:53:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5469 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 9713ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 9719ms
Finished structural reductions in LTL mode , in 1 iterations and 9937 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 172 ms :[p0, p0, (AND p1 p0), p0]
Running random walk in product with property : BART-COL-010-LTLFireability-10
Product exploration explored 100000 steps with 122 reset in 947 ms.
Stack based approach found an accepted trace after 6068 steps with 4 reset with depth 516 and stack size 516 in 47 ms.
FORMULA BART-COL-010-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-010-LTLFireability-10 finished in 11135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G((p1||X(p2)))))'
Support contains 70 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 3 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2024-05-22 08:53:13] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 08:53:13] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 08:53:13] [INFO ] Invariant cache hit.
[2024-05-22 08:53:13] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-22 08:53:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 130 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 163/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 293 constraints, problems are : Problem set: 0 solved, 163 unsolved in 4316 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
After SMT, in 9505ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 9507ms
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9644 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 527 ms.
Product exploration explored 100000 steps with 50000 reset in 538 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 25 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-010-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-010-LTLFireability-11 finished in 10989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1)) U p1))'
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 29 rules applied. Total rules applied 32 place count 129 transition count 173
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 102 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 102 transition count 172
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 68 place count 98 transition count 168
Applied a total of 68 rules in 9 ms. Remains 98 /132 variables (removed 34) and now considering 168/202 (removed 34) transitions.
// Phase 1: matrix 168 rows 98 cols
[2024-05-22 08:53:24] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 08:53:24] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 08:53:24] [INFO ] Invariant cache hit.
[2024-05-22 08:53:24] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-22 08:53:24] [INFO ] Redundant transitions in 6 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-22 08:53:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 168/266 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 0/266 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 99 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3809 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 168/266 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 132/231 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 231 constraints, problems are : Problem set: 0 solved, 132 unsolved in 2251 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 6075ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 6076ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/132 places, 168/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6222 ms. Remains : 98/132 places, 168/202 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BART-COL-010-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-12 finished in 6415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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
[2024-05-22 08:53:31] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 08:53:31] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 08:53:31] [INFO ] Invariant cache hit.
[2024-05-22 08:53:31] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-22 08:53:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 130 constraints, problems are : Problem set: 0 solved, 163 unsolved in 4968 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 163/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 293 constraints, problems are : Problem set: 0 solved, 163 unsolved in 4795 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
After SMT, in 9782ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 9784ms
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9932 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-13 finished in 10049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 88 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 7 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2024-05-22 08:53:41] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 08:53:41] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 08:53:41] [INFO ] Invariant cache hit.
[2024-05-22 08:53:41] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-22 08:53:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 101 constraints, problems are : Problem set: 0 solved, 134 unsolved in 4261 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 134/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 235 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3368 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 7652ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 7655ms
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7846 ms. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-14
Entered a terminal (fully accepting) state of product in 62 steps with 0 reset in 0 ms.
FORMULA BART-COL-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-14 finished in 8007 ms.
All properties solved by simple procedures.
Total runtime 102804 ms.

BK_STOP 1716368029199

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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