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.r468-smll-171620167700444.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 ltsminxred
Input is BART-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167700444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 231K Apr 12 21:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 891K Apr 12 21:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Apr 12 21:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 351K Apr 12 21:17 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 105K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 278K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 405K Apr 12 22:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 22:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 383K Apr 12 21:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 12 21:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 37K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 534K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717232359345

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:59:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:59:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:59:21] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-06-01 08:59:21] [INFO ] Transformed 474 places.
[2024-06-01 08:59:21] [INFO ] Transformed 404 transitions.
[2024-06-01 08:59:21] [INFO ] Found NUPN structural information;
[2024-06-01 08:59:21] [INFO ] Parsed PT model containing 474 places and 404 transitions and 3240 arcs in 429 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-002-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 264 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 26 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2024-06-01 08:59:22] [INFO ] Computed 2 invariants in 66 ms
[2024-06-01 08:59:22] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-06-01 08:59:22] [INFO ] Invariant cache hit.
[2024-06-01 08:59:22] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 08:59:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 530 constraints, problems are : Problem set: 0 solved, 332 unsolved in 19326 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 332/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 862 constraints, problems are : Problem set: 0 solved, 332 unsolved in 13240 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 32723ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 32759ms
Finished structural reductions in LTL mode , in 1 iterations and 33789 ms. Remains : 264/264 places, 404/404 transitions.
Support contains 264 out of 264 places after structural reductions.
[2024-06-01 08:59:56] [INFO ] Flatten gal took : 70 ms
[2024-06-01 08:59:56] [INFO ] Flatten gal took : 33 ms
[2024-06-01 08:59:56] [INFO ] Input system was already deterministic with 404 transitions.
Reduction of identical properties reduced properties to check from 22 to 20
RANDOM walk for 6726 steps (0 resets) in 377 ms. (17 steps per ms) remains 0/20 properties
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' '!(F(p0))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 264 transition count 276
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 256 place count 136 transition count 276
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 256 place count 136 transition count 268
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 272 place count 128 transition count 268
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 284 place count 116 transition count 256
Iterating global reduction 2 with 12 rules applied. Total rules applied 296 place count 116 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 298 place count 116 transition count 254
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 306 place count 108 transition count 246
Iterating global reduction 3 with 8 rules applied. Total rules applied 314 place count 108 transition count 246
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 320 place count 102 transition count 240
Iterating global reduction 3 with 6 rules applied. Total rules applied 326 place count 102 transition count 240
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 332 place count 96 transition count 234
Iterating global reduction 3 with 6 rules applied. Total rules applied 338 place count 96 transition count 234
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 342 place count 92 transition count 230
Iterating global reduction 3 with 4 rules applied. Total rules applied 346 place count 92 transition count 230
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 350 place count 88 transition count 226
Iterating global reduction 3 with 4 rules applied. Total rules applied 354 place count 88 transition count 226
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 356 place count 86 transition count 224
Iterating global reduction 3 with 2 rules applied. Total rules applied 358 place count 86 transition count 224
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 386 place count 72 transition count 210
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 394 place count 72 transition count 202
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 4 with 8 rules applied. Total rules applied 402 place count 68 transition count 198
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 410 place count 68 transition count 190
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 418 place count 64 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 426 place count 64 transition count 178
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 6 with 8 rules applied. Total rules applied 434 place count 60 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 442 place count 60 transition count 166
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 7 with 8 rules applied. Total rules applied 450 place count 56 transition count 162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 458 place count 56 transition count 154
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 466 place count 52 transition count 150
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 474 place count 52 transition count 142
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 482 place count 48 transition count 138
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 490 place count 48 transition count 130
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 10 with 8 rules applied. Total rules applied 498 place count 44 transition count 126
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 506 place count 44 transition count 118
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 11 with 8 rules applied. Total rules applied 514 place count 40 transition count 114
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 522 place count 40 transition count 106
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 12 with 8 rules applied. Total rules applied 530 place count 36 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 538 place count 36 transition count 94
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 13 with 8 rules applied. Total rules applied 546 place count 32 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 554 place count 32 transition count 82
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 562 place count 28 transition count 78
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 570 place count 28 transition count 70
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 15 with 8 rules applied. Total rules applied 578 place count 24 transition count 66
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 586 place count 24 transition count 58
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 16 with 8 rules applied. Total rules applied 594 place count 20 transition count 54
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 602 place count 20 transition count 46
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 17 with 8 rules applied. Total rules applied 610 place count 16 transition count 42
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 618 place count 16 transition count 34
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 626 place count 12 transition count 30
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 634 place count 12 transition count 22
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 19 with 8 rules applied. Total rules applied 642 place count 8 transition count 18
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 19 with 10 rules applied. Total rules applied 652 place count 8 transition count 8
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 656 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 2 Pre rules applied. Total rules applied 656 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 660 place count 4 transition count 4
Applied a total of 660 rules in 129 ms. Remains 4 /264 variables (removed 260) and now considering 4/404 (removed 400) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 08:59:57] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:59:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 08:59:57] [INFO ] Invariant cache hit.
[2024-06-01 08:59:57] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-06-01 08:59:57] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 08:59:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/264 places, 4/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 268 ms. Remains : 4/264 places, 4/404 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 31 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-002-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-002-LTLFireability-00 finished in 1021 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||X(G(p1))))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 30 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
// Phase 1: matrix 238 rows 98 cols
[2024-06-01 08:59:57] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 08:59:58] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 08:59:58] [INFO ] Invariant cache hit.
[2024-06-01 08:59:58] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 08:59:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 100 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5891 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 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/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 166/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 266 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4938 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 10860ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 10864ms
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11080 ms. Remains : 98/264 places, 238/404 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-002-LTLFireability-01
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-01 finished in 11291 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' '!(F(G(p0)))'
Support contains 178 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 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 0 with 4 rules applied. Total rules applied 4 place count 264 transition count 400
Reduce places removed 4 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 22 rules applied. Total rules applied 26 place count 260 transition count 382
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 44 place count 242 transition count 382
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 44 place count 242 transition count 374
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 60 place count 234 transition count 374
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 72 place count 222 transition count 362
Iterating global reduction 3 with 12 rules applied. Total rules applied 84 place count 222 transition count 362
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 222 transition count 360
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 92 place count 216 transition count 354
Iterating global reduction 4 with 6 rules applied. Total rules applied 98 place count 216 transition count 354
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 104 place count 210 transition count 348
Iterating global reduction 4 with 6 rules applied. Total rules applied 110 place count 210 transition count 348
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 116 place count 204 transition count 342
Iterating global reduction 4 with 6 rules applied. Total rules applied 122 place count 204 transition count 342
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 126 place count 200 transition count 338
Iterating global reduction 4 with 4 rules applied. Total rules applied 130 place count 200 transition count 338
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 134 place count 196 transition count 334
Iterating global reduction 4 with 4 rules applied. Total rules applied 138 place count 196 transition count 334
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 194 transition count 332
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 194 transition count 332
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 166 place count 182 transition count 320
Applied a total of 166 rules in 82 ms. Remains 182 /264 variables (removed 82) and now considering 320/404 (removed 84) transitions.
// Phase 1: matrix 320 rows 182 cols
[2024-06-01 09:00:09] [INFO ] Computed 2 invariants in 5 ms
[2024-06-01 09:00:09] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 09:00:09] [INFO ] Invariant cache hit.
[2024-06-01 09:00:09] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-06-01 09:00:09] [INFO ] Redundant transitions in 32 ms returned []
Running 248 sub problems to find dead transitions.
[2024-06-01 09:00:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 2/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 320/502 variables, 182/184 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 0/502 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 184 constraints, problems are : Problem set: 0 solved, 248 unsolved in 12427 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 2/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 320/502 variables, 182/184 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 248/432 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/502 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 432 constraints, problems are : Problem set: 0 solved, 248 unsolved in 9530 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
After SMT, in 22020ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 22026ms
Starting structural reductions in SI_LTL mode, iteration 1 : 182/264 places, 320/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22474 ms. Remains : 182/264 places, 320/404 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 696 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 1 ms.
FORMULA BART-PT-002-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-02 finished in 23271 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)||F(p1))))'
Support contains 138 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 258 transition count 398
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 258 transition count 398
Applied a total of 12 rules in 9 ms. Remains 258 /264 variables (removed 6) and now considering 398/404 (removed 6) transitions.
// Phase 1: matrix 398 rows 258 cols
[2024-06-01 09:00:32] [INFO ] Computed 2 invariants in 5 ms
[2024-06-01 09:00:32] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 09:00:32] [INFO ] Invariant cache hit.
[2024-06-01 09:00:33] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2024-06-01 09:00:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 2/258 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 398/656 variables, 258/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (OVERLAPS) 0/656 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 656/656 variables, and 260 constraints, problems are : Problem set: 0 solved, 326 unsolved in 22505 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 2/258 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 398/656 variables, 258/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 326/586 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/656 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 0/656 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 656/656 variables, and 586 constraints, problems are : Problem set: 0 solved, 326 unsolved in 15407 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints]
After SMT, in 37977ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 37991ms
Starting structural reductions in LTL mode, iteration 1 : 258/264 places, 398/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38553 ms. Remains : 258/264 places, 398/404 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-002-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 867 ms.
Product exploration explored 100000 steps with 50000 reset in 570 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) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 25 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-PT-002-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-002-LTLFireability-03 finished in 40258 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((p0&&F(G(p1)))))'
Support contains 178 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 246 transition count 386
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 246 transition count 386
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 234 transition count 374
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 234 transition count 374
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 228 transition count 368
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 228 transition count 368
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 222 transition count 362
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 222 transition count 362
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 216 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 216 transition count 356
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 210 transition count 350
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 210 transition count 350
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 112 place count 206 transition count 346
Iterating global reduction 0 with 4 rules applied. Total rules applied 116 place count 206 transition count 346
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 120 place count 202 transition count 342
Iterating global reduction 0 with 4 rules applied. Total rules applied 124 place count 202 transition count 342
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 200 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 200 transition count 340
Applied a total of 128 rules in 23 ms. Remains 200 /264 variables (removed 64) and now considering 340/404 (removed 64) transitions.
// Phase 1: matrix 340 rows 200 cols
[2024-06-01 09:01:12] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 09:01:12] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 09:01:12] [INFO ] Invariant cache hit.
[2024-06-01 09:01:13] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-06-01 09:01:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 2/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 340/540 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 0/540 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 202 constraints, problems are : Problem set: 0 solved, 268 unsolved in 15456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 2/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 340/540 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 268/470 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/540 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/540 variables, and 470 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11715 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 27239ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 27245ms
Starting structural reductions in LTL mode, iteration 1 : 200/264 places, 340/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27537 ms. Remains : 200/264 places, 340/404 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BART-PT-002-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 216 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA BART-PT-002-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-04 finished in 28025 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(p0)||F(G((p1&&(p1 U X(p0)))))))'
Support contains 20 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 218 transition count 358
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 218 transition count 358
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 130 place count 180 transition count 320
Iterating global reduction 0 with 38 rules applied. Total rules applied 168 place count 180 transition count 320
Applied a total of 168 rules in 14 ms. Remains 180 /264 variables (removed 84) and now considering 320/404 (removed 84) transitions.
// Phase 1: matrix 320 rows 180 cols
[2024-06-01 09:01:40] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 09:01:40] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 09:01:40] [INFO ] Invariant cache hit.
[2024-06-01 09:01:41] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-06-01 09:01:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 2/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 320/500 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 0/500 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 182 constraints, problems are : Problem set: 0 solved, 248 unsolved in 13381 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 2/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 320/500 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 248/430 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 430 constraints, problems are : Problem set: 0 solved, 248 unsolved in 10005 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
After SMT, in 23436ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 23442ms
Starting structural reductions in LTL mode, iteration 1 : 180/264 places, 320/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23754 ms. Remains : 180/264 places, 320/404 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-06
Product exploration explored 100000 steps with 1189 reset in 665 ms.
Stack based approach found an accepted trace after 260 steps with 3 reset with depth 41 and stack size 41 in 2 ms.
FORMULA BART-PT-002-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-06 finished in 24697 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))&&F(p1)))'
Support contains 20 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 218 transition count 358
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 218 transition count 358
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 130 place count 180 transition count 320
Iterating global reduction 0 with 38 rules applied. Total rules applied 168 place count 180 transition count 320
Applied a total of 168 rules in 11 ms. Remains 180 /264 variables (removed 84) and now considering 320/404 (removed 84) transitions.
[2024-06-01 09:02:05] [INFO ] Invariant cache hit.
[2024-06-01 09:02:05] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 09:02:05] [INFO ] Invariant cache hit.
[2024-06-01 09:02:05] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-06-01 09:02:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 2/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 320/500 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 0/500 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 182 constraints, problems are : Problem set: 0 solved, 248 unsolved in 13805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 2/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 320/500 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 248/430 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 430 constraints, problems are : Problem set: 0 solved, 248 unsolved in 9127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
After SMT, in 22980ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 22985ms
Starting structural reductions in LTL mode, iteration 1 : 180/264 places, 320/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23314 ms. Remains : 180/264 places, 320/404 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-002-LTLFireability-07
Product exploration explored 100000 steps with 7053 reset in 325 ms.
Product exploration explored 100000 steps with 7091 reset in 312 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) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 132 steps (0 resets) in 7 ms. (16 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 338 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
[2024-06-01 09:02:30] [INFO ] Invariant cache hit.
[2024-06-01 09:02:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 09:02:31] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-06-01 09:02:31] [INFO ] Computed and/alt/rep : 248/456/248 causal constraints (skipped 0 transitions) in 39 ms.
[2024-06-01 09:02:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:02:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 09:02:31] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-01 09:02:31] [INFO ] Computed and/alt/rep : 248/456/248 causal constraints (skipped 0 transitions) in 40 ms.
[2024-06-01 09:02:33] [INFO ] Added : 248 causal constraints over 50 iterations in 2005 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 09:02:33] [INFO ] Invariant cache hit.
[2024-06-01 09:02:34] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-01 09:02:34] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2024-06-01 09:02:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:02:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-01 09:02:34] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-06-01 09:02:35] [INFO ] Computed and/alt/rep : 248/456/248 causal constraints (skipped 0 transitions) in 34 ms.
[2024-06-01 09:02:36] [INFO ] Added : 248 causal constraints over 50 iterations in 1920 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 20 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 320/320 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 180 transition count 298
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 158 transition count 298
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 44 place count 158 transition count 290
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 60 place count 150 transition count 290
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 140 place count 110 transition count 250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 142 place count 110 transition count 248
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 108 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 148 place count 108 transition count 244
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 152 place count 106 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 154 place count 106 transition count 240
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 158 place count 104 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 160 place count 104 transition count 236
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 164 place count 102 transition count 234
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 168 place count 102 transition count 230
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 172 place count 100 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 176 place count 100 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 180 place count 98 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 184 place count 98 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 188 place count 96 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 192 place count 96 transition count 212
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 196 place count 94 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 200 place count 94 transition count 206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 204 place count 92 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 208 place count 92 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 212 place count 90 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 216 place count 90 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 220 place count 88 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 224 place count 88 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 228 place count 86 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 232 place count 86 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 236 place count 84 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 240 place count 84 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 244 place count 82 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 248 place count 82 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 252 place count 80 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 256 place count 80 transition count 164
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 260 place count 78 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 264 place count 78 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 268 place count 76 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 272 place count 76 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 276 place count 74 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 280 place count 74 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 284 place count 72 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 288 place count 72 transition count 140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 292 place count 70 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 296 place count 70 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 4 rules applied. Total rules applied 300 place count 68 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 304 place count 68 transition count 128
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 24 with 4 rules applied. Total rules applied 308 place count 66 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 312 place count 66 transition count 122
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 25 with 4 rules applied. Total rules applied 316 place count 64 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 318 place count 64 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 26 with 4 rules applied. Total rules applied 322 place count 62 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 324 place count 62 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 27 with 4 rules applied. Total rules applied 328 place count 60 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 330 place count 60 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 28 with 4 rules applied. Total rules applied 334 place count 58 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 338 place count 58 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 29 with 4 rules applied. Total rules applied 342 place count 56 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 346 place count 56 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 30 with 4 rules applied. Total rules applied 350 place count 54 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 354 place count 54 transition count 92
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 31 with 4 rules applied. Total rules applied 358 place count 52 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 362 place count 52 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 32 with 4 rules applied. Total rules applied 366 place count 50 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 368 place count 50 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 33 with 4 rules applied. Total rules applied 372 place count 48 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 374 place count 48 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 4 rules applied. Total rules applied 378 place count 46 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 382 place count 46 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 35 with 4 rules applied. Total rules applied 386 place count 44 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 390 place count 44 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 36 with 2 rules applied. Total rules applied 392 place count 44 transition count 64
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 36 with 2 rules applied. Total rules applied 394 place count 44 transition count 64
Discarding 2 places :
Symmetric choice reduction at 36 with 2 rule applications. Total rules 396 place count 42 transition count 62
Iterating global reduction 36 with 2 rules applied. Total rules applied 398 place count 42 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 400 place count 42 transition count 60
Applied a total of 400 rules in 162 ms. Remains 42 /180 variables (removed 138) and now considering 60/320 (removed 260) transitions.
// Phase 1: matrix 60 rows 42 cols
[2024-06-01 09:02:37] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 09:02:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 09:02:37] [INFO ] Invariant cache hit.
[2024-06-01 09:02:37] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-06-01 09:02:37] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-06-01 09:02:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 2/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 60/102 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 0/102 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 44 constraints, problems are : Problem set: 0 solved, 40 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 2/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 60/102 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 40/84 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 84 constraints, problems are : Problem set: 0 solved, 40 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1541ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1543ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/180 places, 60/320 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1824 ms. Remains : 42/180 places, 60/320 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 463 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 58 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 652 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
[2024-06-01 09:02:40] [INFO ] Invariant cache hit.
[2024-06-01 09:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 09:02:40] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 09:02:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:02:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 09:02:41] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-01 09:02:41] [INFO ] Computed and/alt/rep : 40/58/40 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 09:02:41] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p1)
[2024-06-01 09:02:41] [INFO ] Invariant cache hit.
[2024-06-01 09:02:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 09:02:41] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-06-01 09:02:41] [INFO ] Computed and/alt/rep : 40/58/40 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 09:02:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:02:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 09:02:41] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-06-01 09:02:41] [INFO ] Computed and/alt/rep : 40/58/40 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 09:02:41] [INFO ] Added : 40 causal constraints over 9 iterations in 108 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Product exploration explored 100000 steps with 15768 reset in 213 ms.
Stack based approach found an accepted trace after 460 steps with 73 reset with depth 4 and stack size 4 in 1 ms.
FORMULA BART-PT-002-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-07 finished in 36635 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 X((!p1||X((p2 U (p3||G(p2))))))))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 202 transition count 342
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 202 transition count 342
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 175 place count 151 transition count 291
Iterating global reduction 0 with 51 rules applied. Total rules applied 226 place count 151 transition count 291
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 232 place count 145 transition count 285
Iterating global reduction 0 with 6 rules applied. Total rules applied 238 place count 145 transition count 285
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 243 place count 140 transition count 280
Iterating global reduction 0 with 5 rules applied. Total rules applied 248 place count 140 transition count 280
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 253 place count 135 transition count 275
Iterating global reduction 0 with 5 rules applied. Total rules applied 258 place count 135 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 263 place count 130 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 268 place count 130 transition count 270
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 272 place count 126 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 280 place count 122 transition count 262
Iterating global reduction 0 with 4 rules applied. Total rules applied 284 place count 122 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 286 place count 120 transition count 260
Iterating global reduction 0 with 2 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 289 place count 119 transition count 259
Iterating global reduction 0 with 1 rules applied. Total rules applied 290 place count 119 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 291 place count 118 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 292 place count 118 transition count 258
Applied a total of 292 rules in 27 ms. Remains 118 /264 variables (removed 146) and now considering 258/404 (removed 146) transitions.
// Phase 1: matrix 258 rows 118 cols
[2024-06-01 09:02:42] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 09:02:42] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 09:02:42] [INFO ] Invariant cache hit.
[2024-06-01 09:02:42] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-01 09:02:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 2/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 258/376 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/376 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 120 constraints, problems are : Problem set: 0 solved, 186 unsolved in 7332 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 2/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 258/376 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 186/306 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/376 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 306 constraints, problems are : Problem set: 0 solved, 186 unsolved in 6105 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 13480ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 13484ms
Starting structural reductions in LTL mode, iteration 1 : 118/264 places, 258/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13740 ms. Remains : 118/264 places, 258/404 transitions.
Stuttering acceptance computed with spot in 489 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p3) (NOT p2)), (AND p1 (NOT p0) (NOT p3) (NOT p2)), (AND p1 (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), true, (AND (NOT p3) (NOT p2) (NOT p0)), (AND p1 (NOT p3) (NOT p2)), (NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-08
Product exploration explored 100000 steps with 32814 reset in 641 ms.
Product exploration explored 100000 steps with 32821 reset in 412 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) p3 p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2))))]
Knowledge based reduction with 13 factoid took 499 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
RANDOM walk for 1279 steps (0 resets) in 24 ms. (51 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT p2)), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT p3))]
Knowledge based reduction with 13 factoid took 644 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 164 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Support contains 3 out of 118 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-06-01 09:02:59] [INFO ] Invariant cache hit.
[2024-06-01 09:02:59] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 09:02:59] [INFO ] Invariant cache hit.
[2024-06-01 09:02:59] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-01 09:02:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 2/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 258/376 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/376 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 120 constraints, problems are : Problem set: 0 solved, 186 unsolved in 7652 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 2/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 258/376 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 186/306 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/376 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 306 constraints, problems are : Problem set: 0 solved, 186 unsolved in 5852 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 13541ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 13545ms
Finished structural reductions in LTL mode , in 1 iterations and 13792 ms. Remains : 118/118 places, 258/258 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 p2 p3), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3)))))]
Knowledge based reduction with 4 factoid took 295 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) p1)]
RANDOM walk for 1905 steps (0 resets) in 56 ms. (33 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p2 p3), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (F (NOT p1)), (F (NOT (OR p3 (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p3 p2 (NOT p1)))), (F (NOT p3))]
Knowledge based reduction with 4 factoid took 470 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) p1)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) p1)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) p1)]
Product exploration explored 100000 steps with 32789 reset in 605 ms.
Product exploration explored 100000 steps with 32841 reset in 618 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) p1)]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Graph (trivial) has 250 edges and 118 vertex of which 99 / 118 are part of one of the 2 SCC in 8 ms
Free SCC test removed 97 places
Ensure Unique test removed 222 transitions
Reduce isomorphic transitions removed 222 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 21 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 21 transition count 34
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 21 transition count 34
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 21 transition count 34
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 27 place count 21 transition count 24
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 37 place count 11 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 47 place count 11 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 47 rules in 43 ms. Remains 11 /118 variables (removed 107) and now considering 14/258 (removed 244) transitions.
[2024-06-01 09:03:16] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 09:03:16] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2024-06-01 09:03:16] [INFO ] Computed 2 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 09:03:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 7 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-01 09:03:16] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 2/4 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 12/23 variables, 11/15 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 15 constraints, problems are : Problem set: 4 solved, 5 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 2/4 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 12/23 variables, 11/15 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 5/20 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 20 constraints, problems are : Problem set: 4 solved, 5 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 308ms problems are : Problem set: 4 solved, 5 unsolved
Search for dead transitions found 4 dead transitions in 310ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 11/118 places, 10/258 transitions.
Graph (complete) has 10 edges and 11 vertex of which 7 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 7 /11 variables (removed 4) and now considering 10/10 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/118 places, 10/258 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 372 ms. Remains : 7/118 places, 10/258 transitions.
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 116 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 116 transition count 256
Applied a total of 4 rules in 9 ms. Remains 116 /118 variables (removed 2) and now considering 256/258 (removed 2) transitions.
// Phase 1: matrix 256 rows 116 cols
[2024-06-01 09:03:16] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 09:03:16] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 09:03:16] [INFO ] Invariant cache hit.
[2024-06-01 09:03:17] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 09:03:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 256/372 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/372 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 118 constraints, problems are : Problem set: 0 solved, 184 unsolved in 6973 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 256/372 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 184/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/372 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 302 constraints, problems are : Problem set: 0 solved, 184 unsolved in 5876 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 12895ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 12899ms
Starting structural reductions in LTL mode, iteration 1 : 116/118 places, 256/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13157 ms. Remains : 116/118 places, 256/258 transitions.
Treatment of property BART-PT-002-LTLFireability-08 finished in 48030 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)))'
Support contains 1 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 42 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
// Phase 1: matrix 238 rows 98 cols
[2024-06-01 09:03:30] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 09:03:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 09:03:30] [INFO ] Invariant cache hit.
[2024-06-01 09:03:30] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 09:03:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 100 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5970 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 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/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 166/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 266 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4630 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 10636ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 10639ms
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10881 ms. Remains : 98/264 places, 238/404 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-09
Product exploration explored 100000 steps with 4408 reset in 197 ms.
Stack based approach found an accepted trace after 2438 steps with 103 reset with depth 29 and stack size 29 in 5 ms.
FORMULA BART-PT-002-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-09 finished in 11211 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)&&F(G((p1 U X(p2)))))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 179 place count 148 transition count 288
Iterating global reduction 0 with 53 rules applied. Total rules applied 232 place count 148 transition count 288
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 240 place count 140 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 248 place count 140 transition count 280
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 254 place count 134 transition count 274
Iterating global reduction 0 with 6 rules applied. Total rules applied 260 place count 134 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 266 place count 128 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 272 place count 128 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 278 place count 122 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 284 place count 122 transition count 262
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 290 place count 116 transition count 256
Iterating global reduction 0 with 6 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 302 place count 110 transition count 250
Iterating global reduction 0 with 6 rules applied. Total rules applied 308 place count 110 transition count 250
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 312 place count 106 transition count 246
Iterating global reduction 0 with 4 rules applied. Total rules applied 316 place count 106 transition count 246
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 320 place count 102 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 324 place count 102 transition count 242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 326 place count 100 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 328 place count 100 transition count 240
Applied a total of 328 rules in 38 ms. Remains 100 /264 variables (removed 164) and now considering 240/404 (removed 164) transitions.
// Phase 1: matrix 240 rows 100 cols
[2024-06-01 09:03:41] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 09:03:41] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 09:03:41] [INFO ] Invariant cache hit.
[2024-06-01 09:03:41] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-06-01 09:03:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 2/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 240/340 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 0/340 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 102 constraints, problems are : Problem set: 0 solved, 168 unsolved in 5690 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 2/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 240/340 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 168/270 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/340 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 270 constraints, problems are : Problem set: 0 solved, 168 unsolved in 3825 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 9549ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 9552ms
Starting structural reductions in LTL mode, iteration 1 : 100/264 places, 240/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9796 ms. Remains : 100/264 places, 240/404 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BART-PT-002-LTLFireability-10
Product exploration explored 100000 steps with 385 reset in 127 ms.
Stack based approach found an accepted trace after 76 steps with 1 reset with depth 75 and stack size 75 in 0 ms.
FORMULA BART-PT-002-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-10 finished in 10176 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||X(F(p1)))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 396 edges and 264 vertex of which 236 / 264 are part of one of the 2 SCC in 1 ms
Free SCC test removed 234 places
Ensure Unique test removed 363 transitions
Reduce isomorphic transitions removed 363 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 30 transition count 23
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 12 transition count 20
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 11 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 46 place count 10 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 49 place count 9 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 52 place count 8 transition count 12
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 54 place count 7 transition count 11
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 56 place count 5 transition count 9
Iterating global reduction 7 with 2 rules applied. Total rules applied 58 place count 5 transition count 9
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 60 place count 5 transition count 7
Applied a total of 60 rules in 6 ms. Remains 5 /264 variables (removed 259) and now considering 7/404 (removed 397) transitions.
[2024-06-01 09:03:51] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 5 cols
[2024-06-01 09:03:51] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 09:03:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 09:03:51] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-06-01 09:03:51] [INFO ] Invariant cache hit.
[2024-06-01 09:03:51] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 09:03:51] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 09:03:51] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-06-01 09:03:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/264 places, 7/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 5/264 places, 7/404 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-PT-002-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-12 finished in 253 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' '!((F(p0)||X(G((p1||F(p0))))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 179 place count 148 transition count 288
Iterating global reduction 0 with 53 rules applied. Total rules applied 232 place count 148 transition count 288
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 239 place count 141 transition count 281
Iterating global reduction 0 with 7 rules applied. Total rules applied 246 place count 141 transition count 281
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 251 place count 136 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 256 place count 136 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 261 place count 131 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 266 place count 131 transition count 271
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 271 place count 126 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 281 place count 121 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 291 place count 116 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 299 place count 113 transition count 253
Iterating global reduction 0 with 3 rules applied. Total rules applied 302 place count 113 transition count 253
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 305 place count 110 transition count 250
Iterating global reduction 0 with 3 rules applied. Total rules applied 308 place count 110 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 309 place count 109 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 310 place count 109 transition count 249
Applied a total of 310 rules in 15 ms. Remains 109 /264 variables (removed 155) and now considering 249/404 (removed 155) transitions.
// Phase 1: matrix 249 rows 109 cols
[2024-06-01 09:03:51] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 09:03:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 09:03:51] [INFO ] Invariant cache hit.
[2024-06-01 09:03:51] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-06-01 09:03:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 2/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 249/358 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 0/358 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 111 constraints, problems are : Problem set: 0 solved, 177 unsolved in 5241 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 2/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 249/358 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 177/288 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 0/358 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 288 constraints, problems are : Problem set: 0 solved, 177 unsolved in 3521 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 8780ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 8782ms
Starting structural reductions in LTL mode, iteration 1 : 109/264 places, 249/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8944 ms. Remains : 109/264 places, 249/404 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-002-LTLFireability-13
Product exploration explored 100000 steps with 1839 reset in 112 ms.
Stack based approach found an accepted trace after 111 steps with 2 reset with depth 50 and stack size 50 in 0 ms.
FORMULA BART-PT-002-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-13 finished in 9200 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 X(p1))||F(p2)))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 179 place count 148 transition count 288
Iterating global reduction 0 with 53 rules applied. Total rules applied 232 place count 148 transition count 288
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 240 place count 140 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 248 place count 140 transition count 280
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 254 place count 134 transition count 274
Iterating global reduction 0 with 6 rules applied. Total rules applied 260 place count 134 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 266 place count 128 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 272 place count 128 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 278 place count 122 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 284 place count 122 transition count 262
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 290 place count 116 transition count 256
Iterating global reduction 0 with 6 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 302 place count 110 transition count 250
Iterating global reduction 0 with 6 rules applied. Total rules applied 308 place count 110 transition count 250
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 312 place count 106 transition count 246
Iterating global reduction 0 with 4 rules applied. Total rules applied 316 place count 106 transition count 246
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 320 place count 102 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 324 place count 102 transition count 242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 326 place count 100 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 328 place count 100 transition count 240
Applied a total of 328 rules in 13 ms. Remains 100 /264 variables (removed 164) and now considering 240/404 (removed 164) transitions.
// Phase 1: matrix 240 rows 100 cols
[2024-06-01 09:04:00] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 09:04:01] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 09:04:01] [INFO ] Invariant cache hit.
[2024-06-01 09:04:01] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-06-01 09:04:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 2/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 240/340 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 0/340 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 102 constraints, problems are : Problem set: 0 solved, 168 unsolved in 6023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 2/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 240/340 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 168/270 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/340 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 270 constraints, problems are : Problem set: 0 solved, 168 unsolved in 4980 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 11037ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 11040ms
Starting structural reductions in LTL mode, iteration 1 : 100/264 places, 240/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11394 ms. Remains : 100/264 places, 240/404 transitions.
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BART-PT-002-LTLFireability-14
Product exploration explored 100000 steps with 259 reset in 173 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 0 ms.
FORMULA BART-PT-002-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-14 finished in 11872 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 X((!p1||X((p2 U (p3||G(p2))))))))'
[2024-06-01 09:04:13] [INFO ] Flatten gal took : 38 ms
[2024-06-01 09:04:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 09:04:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 264 places, 404 transitions and 808 arcs took 17 ms.
Total runtime 291962 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BART-PT-002-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717232653706

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BART-PT-002-LTLFireability-08
ltl formula formula --ltl=/tmp/1502/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 264 places, 404 transitions and 808 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1502/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1502/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1502/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1502/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): There are 265 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 265, there are 448 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1813
pnml2lts-mc( 0/ 4): unique states count: 1905
pnml2lts-mc( 0/ 4): unique transitions count: 3450
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1762
pnml2lts-mc( 0/ 4): - claim found count: 105
pnml2lts-mc( 0/ 4): - claim success count: 1986
pnml2lts-mc( 0/ 4): - cum. max stack depth: 85
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2006 states 4374 transitions, fanout: 2.180
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 50150, Transitions per second: 109350
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 16.5 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 407 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BART-PT-002, 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 r468-smll-171620167700444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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