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.r553-tall-171734900900092.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 CO4-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734900900092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 177K Jun 2 16:33 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 CO4-PT-12-LTLFireability-00
FORMULA_NAME CO4-PT-12-LTLFireability-01
FORMULA_NAME CO4-PT-12-LTLFireability-02
FORMULA_NAME CO4-PT-12-LTLFireability-03
FORMULA_NAME CO4-PT-12-LTLFireability-04
FORMULA_NAME CO4-PT-12-LTLFireability-05
FORMULA_NAME CO4-PT-12-LTLFireability-06
FORMULA_NAME CO4-PT-12-LTLFireability-07
FORMULA_NAME CO4-PT-12-LTLFireability-08
FORMULA_NAME CO4-PT-12-LTLFireability-09
FORMULA_NAME CO4-PT-12-LTLFireability-10
FORMULA_NAME CO4-PT-12-LTLFireability-11
FORMULA_NAME CO4-PT-12-LTLFireability-12
FORMULA_NAME CO4-PT-12-LTLFireability-13
FORMULA_NAME CO4-PT-12-LTLFireability-14
FORMULA_NAME CO4-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717351654135

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:07:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:07:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:07:35] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-06-02 18:07:35] [INFO ] Transformed 649 places.
[2024-06-02 18:07:35] [INFO ] Transformed 782 transitions.
[2024-06-02 18:07:35] [INFO ] Found NUPN structural information;
[2024-06-02 18:07:35] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 172 places in 16 ms
Reduce places removed 172 places and 219 transitions.
FORMULA CO4-PT-12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 563/563 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 559
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 101 place count 380 transition count 477
Iterating global reduction 1 with 81 rules applied. Total rules applied 182 place count 380 transition count 477
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 248 place count 314 transition count 393
Iterating global reduction 1 with 66 rules applied. Total rules applied 314 place count 314 transition count 393
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 319 place count 314 transition count 388
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 352 place count 281 transition count 355
Iterating global reduction 2 with 33 rules applied. Total rules applied 385 place count 281 transition count 355
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 406 place count 260 transition count 334
Iterating global reduction 2 with 21 rules applied. Total rules applied 427 place count 260 transition count 334
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 432 place count 260 transition count 329
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 438 place count 254 transition count 323
Iterating global reduction 3 with 6 rules applied. Total rules applied 444 place count 254 transition count 323
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 446 place count 252 transition count 321
Iterating global reduction 3 with 2 rules applied. Total rules applied 448 place count 252 transition count 321
Applied a total of 448 rules in 140 ms. Remains 252 /477 variables (removed 225) and now considering 321/563 (removed 242) transitions.
// Phase 1: matrix 321 rows 252 cols
[2024-06-02 18:07:35] [INFO ] Computed 6 invariants in 20 ms
[2024-06-02 18:07:36] [INFO ] Implicit Places using invariants in 281 ms returned [7, 180]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 310 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 250/477 places, 321/563 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 471 ms. Remains : 250/477 places, 321/563 transitions.
Support contains 19 out of 250 places after structural reductions.
[2024-06-02 18:07:36] [INFO ] Flatten gal took : 45 ms
[2024-06-02 18:07:36] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:07:36] [INFO ] Input system was already deterministic with 321 transitions.
RANDOM walk for 40000 steps (161 resets) in 1461 ms. (27 steps per ms) remains 14/19 properties
BEST_FIRST walk for 40001 steps (184 resets) in 542 ms. (73 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40002 steps (271 resets) in 114 ms. (347 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40001 steps (256 resets) in 188 ms. (211 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (245 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (178 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (86 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (177 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (218 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (206 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (238 resets) in 183 ms. (217 steps per ms) remains 7/8 properties
// Phase 1: matrix 321 rows 250 cols
[2024-06-02 18:07:37] [INFO ] Computed 4 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 14/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 86/128 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 201/329 variables, 77/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 174/503 variables, 87/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 59/562 variables, 38/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 13 (OVERLAPS) 8/570 variables, 5/253 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/570 variables, 0/253 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/571 variables, 1/254 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/571 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/571 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 254 constraints, problems are : Problem set: 1 solved, 6 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/40 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-02 18:07:38] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 81/121 variables, 40/45 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 191/312 variables, 73/119 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 5/124 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 172/484 variables, 84/208 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 63/547 variables, 40/248 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/547 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 14/561 variables, 7/255 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/561 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 9/570 variables, 5/260 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/570 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 1/571 variables, 1/261 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/571 variables, 0/261 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/571 variables, 0/261 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 571/571 variables, and 261 constraints, problems are : Problem set: 1 solved, 6 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 1586ms problems are : Problem set: 1 solved, 6 unsolved
Parikh walk visited 5 properties in 465 ms.
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 261 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 425 edges and 248 vertex of which 231 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 114 rules applied. Total rules applied 116 place count 231 transition count 189
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 212 place count 135 transition count 189
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 212 place count 135 transition count 169
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 252 place count 115 transition count 169
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 256 place count 111 transition count 165
Iterating global reduction 2 with 4 rules applied. Total rules applied 260 place count 111 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 262 place count 111 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 262 place count 111 transition count 161
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 266 place count 109 transition count 161
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 236 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 268 place count 108 transition count 160
Drop transitions (Empty/Sink Transition effects.) 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 2 rules applied. Total rules applied 270 place count 108 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 271 place count 107 transition count 158
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 274 place count 104 transition count 155
Iterating global reduction 6 with 3 rules applied. Total rules applied 277 place count 104 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 279 place count 104 transition count 153
Performed 45 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 369 place count 59 transition count 95
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 374 place count 59 transition count 90
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 380 place count 53 transition count 84
Iterating global reduction 8 with 6 rules applied. Total rules applied 386 place count 53 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 387 place count 53 transition count 83
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 393 place count 50 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 396 place count 50 transition count 77
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 399 place count 47 transition count 74
Iterating global reduction 10 with 3 rules applied. Total rules applied 402 place count 47 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 403 place count 47 transition count 73
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 404 place count 46 transition count 72
Iterating global reduction 11 with 1 rules applied. Total rules applied 405 place count 46 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 406 place count 46 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 408 place count 45 transition count 70
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 409 place count 45 transition count 69
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 410 place count 44 transition count 68
Iterating global reduction 13 with 1 rules applied. Total rules applied 411 place count 44 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 412 place count 44 transition count 67
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 430 place count 35 transition count 68
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 14 with 16 rules applied. Total rules applied 446 place count 35 transition count 52
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 454 place count 27 transition count 44
Iterating global reduction 15 with 8 rules applied. Total rules applied 462 place count 27 transition count 44
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 470 place count 27 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 472 place count 26 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 475 place count 26 transition count 36
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 476 place count 25 transition count 35
Iterating global reduction 16 with 1 rules applied. Total rules applied 477 place count 25 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 479 place count 25 transition count 33
Free-agglomeration rule applied 7 times.
Iterating global reduction 17 with 7 rules applied. Total rules applied 486 place count 25 transition count 26
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 494 place count 18 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 495 place count 17 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 497 place count 15 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 501 place count 13 transition count 22
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 19 with 5 rules applied. Total rules applied 506 place count 13 transition count 17
Applied a total of 506 rules in 97 ms. Remains 13 /250 variables (removed 237) and now considering 17/321 (removed 304) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 13/250 places, 17/321 transitions.
RANDOM walk for 179 steps (0 resets) in 10 ms. (16 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA CO4-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 428 edges and 250 vertex of which 243 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 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||X(p1)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 241 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 241 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 241 transition count 309
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 238 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 238 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 238 transition count 305
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 236 transition count 303
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 236 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 235 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 235 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 235 transition count 301
Applied a total of 34 rules in 23 ms. Remains 235 /250 variables (removed 15) and now considering 301/321 (removed 20) transitions.
// Phase 1: matrix 301 rows 235 cols
[2024-06-02 18:07:40] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:07:40] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 18:07:40] [INFO ] Invariant cache hit.
[2024-06-02 18:07:40] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-02 18:07:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 18:07:43] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:07:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/536 variables, 235/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/536 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 241 constraints, problems are : Problem set: 0 solved, 300 unsolved in 12050 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/536 variables, 235/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 300/541 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 18:07:57] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 18:08:04] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (OVERLAPS) 0/536 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 543 constraints, problems are : Problem set: 0 solved, 300 unsolved in 27262 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints]
After SMT, in 39423ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 39436ms
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 301/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39654 ms. Remains : 235/250 places, 301/321 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-12-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 406 edges and 235 vertex of which 230 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-12-LTLFireability-00 finished in 40359 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 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 263 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 241 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 240 transition count 216
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 190 place count 146 transition count 216
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 190 place count 146 transition count 195
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 232 place count 125 transition count 195
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 235 place count 122 transition count 192
Iterating global reduction 2 with 3 rules applied. Total rules applied 238 place count 122 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 238 place count 122 transition count 190
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 242 place count 120 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 243 place count 119 transition count 189
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 119 transition count 189
Performed 50 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 344 place count 69 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 348 place count 69 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 351 place count 66 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 354 place count 66 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 356 place count 65 transition count 114
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
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 384 place count 51 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 393 place count 51 transition count 108
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 404 place count 40 transition count 86
Iterating global reduction 4 with 11 rules applied. Total rules applied 415 place count 40 transition count 86
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 423 place count 40 transition count 78
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 426 place count 37 transition count 69
Iterating global reduction 5 with 3 rules applied. Total rules applied 429 place count 37 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 431 place count 37 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 433 place count 36 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 443 place count 36 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 445 place count 34 transition count 61
Applied a total of 445 rules in 40 ms. Remains 34 /250 variables (removed 216) and now considering 61/321 (removed 260) transitions.
[2024-06-02 18:08:20] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
// Phase 1: matrix 57 rows 34 cols
[2024-06-02 18:08:20] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:08:20] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 18:08:20] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
[2024-06-02 18:08:20] [INFO ] Invariant cache hit.
[2024-06-02 18:08:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:08:20] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-02 18:08:20] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 18:08:20] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
[2024-06-02 18:08:20] [INFO ] Invariant cache hit.
[2024-06-02 18:08:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 56/90 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 39 constraints, problems are : Problem set: 0 solved, 46 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 56/90 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 46/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/91 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 85 constraints, problems are : Problem set: 0 solved, 46 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 1102ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1103ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/250 places, 61/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1228 ms. Remains : 34/250 places, 61/321 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-01
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-01 finished in 1279 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||G(F(p1)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 242 transition count 312
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 242 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 242 transition count 310
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 239 transition count 307
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 239 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 239 transition count 306
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 237 transition count 304
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 237 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 236 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 236 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 236 transition count 302
Applied a total of 32 rules in 17 ms. Remains 236 /250 variables (removed 14) and now considering 302/321 (removed 19) transitions.
// Phase 1: matrix 302 rows 236 cols
[2024-06-02 18:08:21] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:08:22] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:08:22] [INFO ] Invariant cache hit.
[2024-06-02 18:08:22] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-06-02 18:08:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 18:08:24] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:08:24] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/538 variables, 236/242 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 0/538 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 242 constraints, problems are : Problem set: 0 solved, 301 unsolved in 11926 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/538 variables, 236/242 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 301/543 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 18:08:38] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:08:40] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/545 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 0/538 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 545 constraints, problems are : Problem set: 0 solved, 301 unsolved in 25459 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 4/4 constraints]
After SMT, in 37449ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 37454ms
Starting structural reductions in LTL mode, iteration 1 : 236/250 places, 302/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37656 ms. Remains : 236/250 places, 302/321 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-12-LTLFireability-03
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-03 finished in 37824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 261 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 241 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 240 transition count 219
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 184 place count 149 transition count 219
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 184 place count 149 transition count 198
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 226 place count 128 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 230 place count 124 transition count 193
Iterating global reduction 2 with 4 rules applied. Total rules applied 234 place count 124 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 236 place count 124 transition count 191
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 236 place count 124 transition count 189
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 240 place count 122 transition count 189
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 241 place count 121 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 121 transition count 188
Performed 49 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 340 place count 72 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 343 place count 72 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 346 place count 69 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 349 place count 69 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 351 place count 68 transition count 117
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 379 place count 54 transition count 120
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 387 place count 54 transition count 112
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 398 place count 43 transition count 90
Iterating global reduction 5 with 11 rules applied. Total rules applied 409 place count 43 transition count 90
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 416 place count 43 transition count 83
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 419 place count 40 transition count 74
Iterating global reduction 6 with 3 rules applied. Total rules applied 422 place count 40 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 424 place count 40 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 426 place count 39 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 435 place count 39 transition count 70
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 437 place count 39 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 439 place count 37 transition count 68
Applied a total of 439 rules in 28 ms. Remains 37 /250 variables (removed 213) and now considering 68/321 (removed 253) transitions.
[2024-06-02 18:08:59] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
// Phase 1: matrix 64 rows 37 cols
[2024-06-02 18:08:59] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:08:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 18:08:59] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 18:08:59] [INFO ] Invariant cache hit.
[2024-06-02 18:08:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:08:59] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-02 18:08:59] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-02 18:08:59] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 18:08:59] [INFO ] Invariant cache hit.
[2024-06-02 18:08:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 63/100 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 42 constraints, problems are : Problem set: 0 solved, 53 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 63/100 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 53/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 95 constraints, problems are : Problem set: 0 solved, 53 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1580ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1581ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/250 places, 68/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1694 ms. Remains : 37/250 places, 68/321 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-06
Product exploration explored 100000 steps with 74 reset in 215 ms.
Product exploration explored 100000 steps with 13 reset in 85 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23059 steps (2755 resets) in 123 ms. (185 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-06-02 18:09:02] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 18:09:02] [INFO ] Invariant cache hit.
[2024-06-02 18:09:02] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 18:09:02] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 18:09:02] [INFO ] Invariant cache hit.
[2024-06-02 18:09:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:09:02] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-06-02 18:09:02] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-02 18:09:02] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 18:09:02] [INFO ] Invariant cache hit.
[2024-06-02 18:09:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 63/100 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 42 constraints, problems are : Problem set: 0 solved, 53 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 63/100 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 53/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 95 constraints, problems are : Problem set: 0 solved, 53 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1405ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1406ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1506 ms. Remains : 37/37 places, 68/68 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30230 steps (3617 resets) in 41 ms. (719 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 76 reset in 30 ms.
Product exploration explored 100000 steps with 40 reset in 148 ms.
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 68/68 transitions.
Applied a total of 0 rules in 14 ms. Remains 37 /37 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-06-02 18:09:04] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 18:09:04] [INFO ] Invariant cache hit.
[2024-06-02 18:09:04] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 18:09:04] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 18:09:04] [INFO ] Invariant cache hit.
[2024-06-02 18:09:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:09:04] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-06-02 18:09:04] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-02 18:09:05] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 18:09:05] [INFO ] Invariant cache hit.
[2024-06-02 18:09:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 63/100 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 42 constraints, problems are : Problem set: 0 solved, 53 unsolved in 729 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 63/100 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 53/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 95 constraints, problems are : Problem set: 0 solved, 53 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1550ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1551ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1771 ms. Remains : 37/37 places, 68/68 transitions.
Treatment of property CO4-PT-12-LTLFireability-06 finished in 6880 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)||F(p1)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 261 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 243 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 95 place count 242 transition count 219
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 189 place count 149 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 148 transition count 218
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 190 place count 148 transition count 197
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 232 place count 127 transition count 197
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 123 transition count 192
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 123 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 242 place count 123 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 242 place count 123 transition count 188
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 246 place count 121 transition count 188
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 120 transition count 187
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 120 transition count 187
Performed 49 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 346 place count 71 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 352 place count 71 transition count 117
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 355 place count 68 transition count 114
Iterating global reduction 5 with 3 rules applied. Total rules applied 358 place count 68 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 360 place count 67 transition count 113
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 388 place count 53 transition count 116
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 397 place count 53 transition count 107
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 408 place count 42 transition count 85
Iterating global reduction 6 with 11 rules applied. Total rules applied 419 place count 42 transition count 85
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 427 place count 42 transition count 77
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 430 place count 39 transition count 68
Iterating global reduction 7 with 3 rules applied. Total rules applied 433 place count 39 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 435 place count 39 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 437 place count 38 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 445 place count 38 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 447 place count 36 transition count 62
Applied a total of 447 rules in 38 ms. Remains 36 /250 variables (removed 214) and now considering 62/321 (removed 259) transitions.
[2024-06-02 18:09:06] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
// Phase 1: matrix 59 rows 36 cols
[2024-06-02 18:09:06] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:09:06] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:09:06] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
[2024-06-02 18:09:06] [INFO ] Invariant cache hit.
[2024-06-02 18:09:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:09:06] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-06-02 18:09:06] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-06-02 18:09:06] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
[2024-06-02 18:09:06] [INFO ] Invariant cache hit.
[2024-06-02 18:09:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 58/94 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/95 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 0/95 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 41 constraints, problems are : Problem set: 0 solved, 47 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 58/94 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 47/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/95 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 88 constraints, problems are : Problem set: 0 solved, 47 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 1237ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1237ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/250 places, 62/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1416 ms. Remains : 36/250 places, 62/321 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-12-LTLFireability-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA CO4-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-08 finished in 1524 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)||G((F(p1)&&F(p2))))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 257 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 241 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 91 place count 240 transition count 221
Reduce places removed 89 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 91 rules applied. Total rules applied 182 place count 151 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 184 place count 149 transition count 219
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 184 place count 149 transition count 198
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 226 place count 128 transition count 198
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 229 place count 125 transition count 194
Iterating global reduction 3 with 3 rules applied. Total rules applied 232 place count 125 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 234 place count 125 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 234 place count 125 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 124 transition count 191
Performed 50 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 336 place count 74 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 339 place count 74 transition count 121
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 342 place count 71 transition count 118
Iterating global reduction 5 with 3 rules applied. Total rules applied 345 place count 71 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 347 place count 70 transition count 117
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 373 place count 57 transition count 120
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 381 place count 57 transition count 112
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 391 place count 47 transition count 92
Iterating global reduction 6 with 10 rules applied. Total rules applied 401 place count 47 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 407 place count 47 transition count 86
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 410 place count 44 transition count 77
Iterating global reduction 7 with 3 rules applied. Total rules applied 413 place count 44 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 415 place count 44 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 417 place count 43 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 426 place count 43 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 428 place count 41 transition count 72
Applied a total of 428 rules in 24 ms. Remains 41 /250 variables (removed 209) and now considering 72/321 (removed 249) transitions.
[2024-06-02 18:09:08] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
// Phase 1: matrix 68 rows 41 cols
[2024-06-02 18:09:08] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:09:08] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 18:09:08] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 18:09:08] [INFO ] Invariant cache hit.
[2024-06-02 18:09:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:09:08] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-06-02 18:09:08] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-06-02 18:09:08] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 18:09:08] [INFO ] Invariant cache hit.
[2024-06-02 18:09:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 67/108 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 46 constraints, problems are : Problem set: 0 solved, 57 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 67/108 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 57/102 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 103 constraints, problems are : Problem set: 0 solved, 57 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1602ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1603ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/250 places, 72/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1791 ms. Remains : 41/250 places, 72/321 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-12-LTLFireability-10
Product exploration explored 100000 steps with 1 reset in 165 ms.
Product exploration explored 100000 steps with 15 reset in 140 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 187 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (4824 resets) in 83 ms. (476 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (620 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-06-02 18:09:10] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 18:09:10] [INFO ] Invariant cache hit.
[2024-06-02 18:09:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/35 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/78 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/79 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/88 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/108 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/109 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 46 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/35 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 43/78 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/79 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/88 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 108/109 variables, and 46 constraints, problems are : Problem set: 1 solved, 0 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 342ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F p2)]
Knowledge based reduction with 16 factoid took 281 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 41 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-06-02 18:09:11] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 18:09:11] [INFO ] Invariant cache hit.
[2024-06-02 18:09:11] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 18:09:11] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 18:09:11] [INFO ] Invariant cache hit.
[2024-06-02 18:09:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:09:11] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-02 18:09:11] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-06-02 18:09:11] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 18:09:11] [INFO ] Invariant cache hit.
[2024-06-02 18:09:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 67/108 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 46 constraints, problems are : Problem set: 0 solved, 57 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 67/108 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 57/102 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 103 constraints, problems are : Problem set: 0 solved, 57 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1663ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1663ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1746 ms. Remains : 41/41 places, 72/72 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 24439 steps (2930 resets) in 55 ms. (436 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 9 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 37 reset in 27 ms.
Product exploration explored 100000 steps with 135 reset in 30 ms.
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 72/72 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 41 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 40 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 39 transition count 71
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 67
Applied a total of 8 rules in 2 ms. Remains 39 /41 variables (removed 2) and now considering 67/72 (removed 5) transitions.
[2024-06-02 18:09:14] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
// Phase 1: matrix 63 rows 39 cols
[2024-06-02 18:09:14] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:09:14] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:09:14] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2024-06-02 18:09:14] [INFO ] Invariant cache hit.
[2024-06-02 18:09:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:09:14] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-06-02 18:09:14] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-02 18:09:14] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2024-06-02 18:09:14] [INFO ] Invariant cache hit.
[2024-06-02 18:09:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 62/101 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 44 constraints, problems are : Problem set: 0 solved, 52 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 62/101 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 52/95 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 96 constraints, problems are : Problem set: 0 solved, 52 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1361ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1361ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/41 places, 67/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1498 ms. Remains : 39/41 places, 67/72 transitions.
Treatment of property CO4-PT-12-LTLFireability-10 finished in 7369 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))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 261 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 241 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 240 transition count 218
Reduce places removed 92 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 148 transition count 216
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 190 place count 146 transition count 216
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 190 place count 146 transition count 195
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 232 place count 125 transition count 195
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 121 transition count 190
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 121 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 242 place count 121 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 242 place count 121 transition count 186
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 246 place count 119 transition count 186
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 118 transition count 185
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 118 transition count 185
Performed 49 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 346 place count 69 transition count 122
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 353 place count 69 transition count 115
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 356 place count 66 transition count 112
Iterating global reduction 5 with 3 rules applied. Total rules applied 359 place count 66 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 361 place count 65 transition count 111
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 389 place count 51 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 398 place count 51 transition count 105
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 409 place count 40 transition count 83
Iterating global reduction 6 with 11 rules applied. Total rules applied 420 place count 40 transition count 83
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 428 place count 40 transition count 75
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 431 place count 37 transition count 66
Iterating global reduction 7 with 3 rules applied. Total rules applied 434 place count 37 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 436 place count 37 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 438 place count 36 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 446 place count 36 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 448 place count 34 transition count 60
Applied a total of 448 rules in 36 ms. Remains 34 /250 variables (removed 216) and now considering 60/321 (removed 261) transitions.
[2024-06-02 18:09:15] [INFO ] Flow matrix only has 57 transitions (discarded 3 similar events)
// Phase 1: matrix 57 rows 34 cols
[2024-06-02 18:09:15] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:09:15] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:09:15] [INFO ] Flow matrix only has 57 transitions (discarded 3 similar events)
[2024-06-02 18:09:15] [INFO ] Invariant cache hit.
[2024-06-02 18:09:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:09:15] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-06-02 18:09:15] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-06-02 18:09:15] [INFO ] Flow matrix only has 57 transitions (discarded 3 similar events)
[2024-06-02 18:09:15] [INFO ] Invariant cache hit.
[2024-06-02 18:09:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 56/90 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 39 constraints, problems are : Problem set: 0 solved, 45 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 56/90 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 45/83 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 1/91 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 84 constraints, problems are : Problem set: 0 solved, 45 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1285ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1285ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/250 places, 60/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1456 ms. Remains : 34/250 places, 60/321 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-11
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-11 finished in 1539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p1||X(p2)||F(p3)))))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 244 transition count 315
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 244 transition count 315
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 241 transition count 312
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 241 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 241 transition count 311
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 239 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 239 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 238 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 238 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 238 transition count 307
Applied a total of 26 rules in 13 ms. Remains 238 /250 variables (removed 12) and now considering 307/321 (removed 14) transitions.
// Phase 1: matrix 307 rows 238 cols
[2024-06-02 18:09:17] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 18:09:17] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 18:09:17] [INFO ] Invariant cache hit.
[2024-06-02 18:09:17] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-06-02 18:09:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 18:09:19] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:09:19] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/545 variables, 238/244 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 0/545 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 244 constraints, problems are : Problem set: 0 solved, 306 unsolved in 12148 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/545 variables, 238/244 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 306/550 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 18:09:40] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/545 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 18:09:49] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 552 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints]
After SMT, in 42214ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 42217ms
Starting structural reductions in LTL mode, iteration 1 : 238/250 places, 307/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42455 ms. Remains : 238/250 places, 307/321 transitions.
Stuttering acceptance computed with spot in 321 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p3)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : CO4-PT-12-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CO4-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-13 finished in 42805 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 U p1)||X(F(p2)))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 244 transition count 314
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 244 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 244 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 242 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 242 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 241 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 241 transition count 309
Applied a total of 20 rules in 7 ms. Remains 241 /250 variables (removed 9) and now considering 309/321 (removed 12) transitions.
// Phase 1: matrix 309 rows 241 cols
[2024-06-02 18:09:59] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:09:59] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 18:10:00] [INFO ] Invariant cache hit.
[2024-06-02 18:10:00] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2024-06-02 18:10:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/550 variables, 241/247 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 247 constraints, problems are : Problem set: 0 solved, 308 unsolved in 12185 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/550 variables, 241/247 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 308/555 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 18:10:16] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 9 ms to minimize.
[2024-06-02 18:10:19] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 18:10:30] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/550 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 558 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 5/5 constraints]
After SMT, in 42247ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 42250ms
Starting structural reductions in LTL mode, iteration 1 : 241/250 places, 309/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42485 ms. Remains : 241/250 places, 309/321 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-12-LTLFireability-15
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-15 finished in 42580 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)))'
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)||G((F(p1)&&F(p2))))))'
[2024-06-02 18:10:42] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:10:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-02 18:10:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 321 transitions and 749 arcs took 5 ms.
Total runtime 187481 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CO4-PT-12-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CO4-PT-12-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717351859758

--------------------
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 CO4-PT-12-LTLFireability-06
ltl formula formula --ltl=/tmp/1108/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 250 places, 321 transitions and 749 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.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1108/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1108/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1108/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1108/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 252 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 251, there are 324 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( 1/ 4): ~44 levels ~10000 states ~31696 transitions
pnml2lts-mc( 3/ 4): ~41 levels ~20000 states ~78460 transitions
pnml2lts-mc( 2/ 4): ~172 levels ~40000 states ~144896 transitions
pnml2lts-mc( 2/ 4): ~335 levels ~80000 states ~284584 transitions
pnml2lts-mc( 2/ 4): ~335 levels ~160000 states ~575072 transitions
pnml2lts-mc( 2/ 4): ~335 levels ~320000 states ~1255276 transitions
pnml2lts-mc( 2/ 4): ~587 levels ~640000 states ~2770980 transitions
pnml2lts-mc( 2/ 4): ~587 levels ~1280000 states ~6194016 transitions
pnml2lts-mc( 2/ 4): ~1842 levels ~2560000 states ~12351880 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~350!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1024565
pnml2lts-mc( 0/ 4): unique states count: 2854955
pnml2lts-mc( 0/ 4): unique transitions count: 14174512
pnml2lts-mc( 0/ 4): - self-loop count: 1527
pnml2lts-mc( 0/ 4): - claim dead count: 6868003
pnml2lts-mc( 0/ 4): - claim found count: 4454804
pnml2lts-mc( 0/ 4): - claim success count: 2856991
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6808
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2858656 states 14197545 transitions, fanout: 4.967
pnml2lts-mc( 0/ 4): Total exploration time 14.720 sec (14.720 sec minimum, 14.720 sec on average)
pnml2lts-mc( 0/ 4): States per second: 194202, Transitions per second: 964507
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 27.9MB, 10.3 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 8.0%/9.0%
pnml2lts-mc( 0/ 4): Stored 324 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 27.9MB (~256.0MB paged-in)
ltl formula name CO4-PT-12-LTLFireability-10
ltl formula formula --ltl=/tmp/1108/ltl_1_
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 250 places, 321 transitions and 749 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.030 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1108/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1108/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1108/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1108/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 251 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 251, there are 354 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): ~123 levels ~10000 states ~29168 transitions
pnml2lts-mc( 0/ 4): ~126 levels ~20000 states ~59076 transitions
pnml2lts-mc( 0/ 4): ~126 levels ~40000 states ~130148 transitions
pnml2lts-mc( 0/ 4): ~132 levels ~80000 states ~294760 transitions
pnml2lts-mc( 0/ 4): ~145 levels ~160000 states ~569668 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~93!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 81576
pnml2lts-mc( 0/ 4): unique states count: 151519
pnml2lts-mc( 0/ 4): unique transitions count: 651951
pnml2lts-mc( 0/ 4): - self-loop count: 502
pnml2lts-mc( 0/ 4): - claim dead count: 358152
pnml2lts-mc( 0/ 4): - claim found count: 140117
pnml2lts-mc( 0/ 4): - claim success count: 151547
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1171
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 151559 states 652148 transitions, fanout: 4.303
pnml2lts-mc( 0/ 4): Total exploration time 1.120 sec (1.120 sec minimum, 1.120 sec on average)
pnml2lts-mc( 0/ 4): States per second: 135321, Transitions per second: 582275
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.9MB, 12.8 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 324 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.9MB (~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="CO4-PT-12"
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 CO4-PT-12, 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 r553-tall-171734900900092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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