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.r550-tall-171734898500060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CO4-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898500060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 138K 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-08-LTLFireability-00
FORMULA_NAME CO4-PT-08-LTLFireability-01
FORMULA_NAME CO4-PT-08-LTLFireability-02
FORMULA_NAME CO4-PT-08-LTLFireability-03
FORMULA_NAME CO4-PT-08-LTLFireability-04
FORMULA_NAME CO4-PT-08-LTLFireability-05
FORMULA_NAME CO4-PT-08-LTLFireability-06
FORMULA_NAME CO4-PT-08-LTLFireability-07
FORMULA_NAME CO4-PT-08-LTLFireability-08
FORMULA_NAME CO4-PT-08-LTLFireability-09
FORMULA_NAME CO4-PT-08-LTLFireability-10
FORMULA_NAME CO4-PT-08-LTLFireability-11
FORMULA_NAME CO4-PT-08-LTLFireability-12
FORMULA_NAME CO4-PT-08-LTLFireability-13
FORMULA_NAME CO4-PT-08-LTLFireability-14
FORMULA_NAME CO4-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717351570170

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 18:06:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:06:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:06:11] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-06-02 18:06:11] [INFO ] Transformed 467 places.
[2024-06-02 18:06:11] [INFO ] Transformed 600 transitions.
[2024-06-02 18:06:11] [INFO ] Found NUPN structural information;
[2024-06-02 18:06:11] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 108 places in 12 ms
Reduce places removed 108 places and 155 transitions.
FORMULA CO4-PT-08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 445/445 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 443
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 95 place count 266 transition count 361
Iterating global reduction 1 with 80 rules applied. Total rules applied 175 place count 266 transition count 361
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 180 place count 266 transition count 356
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 219 place count 227 transition count 305
Iterating global reduction 2 with 39 rules applied. Total rules applied 258 place count 227 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 259 place count 227 transition count 304
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 266 place count 220 transition count 293
Iterating global reduction 3 with 7 rules applied. Total rules applied 273 place count 220 transition count 293
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 277 place count 216 transition count 289
Iterating global reduction 3 with 4 rules applied. Total rules applied 281 place count 216 transition count 289
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 283 place count 214 transition count 287
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 214 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 287 place count 214 transition count 285
Applied a total of 287 rules in 96 ms. Remains 214 /359 variables (removed 145) and now considering 285/445 (removed 160) transitions.
// Phase 1: matrix 285 rows 214 cols
[2024-06-02 18:06:11] [INFO ] Computed 6 invariants in 20 ms
[2024-06-02 18:06:12] [INFO ] Implicit Places using invariants in 330 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 357 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 213/359 places, 285/445 transitions.
Applied a total of 0 rules in 4 ms. Remains 213 /213 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 476 ms. Remains : 213/359 places, 285/445 transitions.
Support contains 20 out of 213 places after structural reductions.
[2024-06-02 18:06:12] [INFO ] Flatten gal took : 42 ms
[2024-06-02 18:06:12] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:06:12] [INFO ] Input system was already deterministic with 285 transitions.
RANDOM walk for 40000 steps (202 resets) in 1234 ms. (32 steps per ms) remains 11/17 properties
BEST_FIRST walk for 40000 steps (140 resets) in 377 ms. (105 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (292 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (158 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (138 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (251 resets) in 267 ms. (149 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40001 steps (153 resets) in 98 ms. (404 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (228 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (91 resets) in 145 ms. (273 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40000 steps (118 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
// Phase 1: matrix 285 rows 213 cols
[2024-06-02 18:06:13] [INFO ] Computed 5 invariants in 4 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) 10/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 16/36 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 81/117 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 189/306 variables, 68/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 155/461 variables, 84/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 32/493 variables, 22/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 5/498 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 18:06:13] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 13 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-06-02 18:06:14] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
Problem AtomicPropp11 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/498 variables, 2/220 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 0/220 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/498 variables, 0/220 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 220 constraints, problems are : Problem set: 2 solved, 5 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 16/36 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 81/117 variables, 36/43 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 189/306 variables, 68/111 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 5/116 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 155/461 variables, 84/200 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 32/493 variables, 22/222 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/493 variables, 0/222 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 5/498 variables, 3/225 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/498 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 225 constraints, problems are : Problem set: 2 solved, 5 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 1363ms problems are : Problem set: 2 solved, 5 unsolved
Parikh walk visited 4 properties in 269 ms.
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 285/285 transitions.
Graph (trivial) has 220 edges and 213 vertex of which 2 / 213 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 406 edges and 212 vertex of which 196 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 196 transition count 185
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 74 rules applied. Total rules applied 160 place count 125 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 124 transition count 182
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 161 place count 124 transition count 161
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 203 place count 103 transition count 161
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 255 edges and 103 vertex of which 102 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 205 place count 102 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 207 place count 102 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 208 place count 101 transition count 158
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 213 place count 96 transition count 147
Iterating global reduction 6 with 5 rules applied. Total rules applied 218 place count 96 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 220 place count 96 transition count 145
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 221 place count 95 transition count 144
Iterating global reduction 7 with 1 rules applied. Total rules applied 222 place count 95 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 223 place count 95 transition count 143
Performed 37 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 8 with 74 rules applied. Total rules applied 297 place count 58 transition count 93
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 302 place count 58 transition count 88
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 307 place count 53 transition count 83
Iterating global reduction 9 with 5 rules applied. Total rules applied 312 place count 53 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 313 place count 53 transition count 82
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 10 with 6 rules applied. Total rules applied 319 place count 50 transition count 79
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 322 place count 50 transition count 76
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 325 place count 47 transition count 73
Iterating global reduction 11 with 3 rules applied. Total rules applied 328 place count 47 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 329 place count 47 transition count 72
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 330 place count 46 transition count 71
Iterating global reduction 12 with 1 rules applied. Total rules applied 331 place count 46 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 332 place count 46 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 334 place count 45 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 335 place count 45 transition count 68
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 336 place count 44 transition count 67
Iterating global reduction 14 with 1 rules applied. Total rules applied 337 place count 44 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 338 place count 44 transition count 66
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 15 with 18 rules applied. Total rules applied 356 place count 35 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 15 with 16 rules applied. Total rules applied 372 place count 35 transition count 51
Discarding 8 places :
Symmetric choice reduction at 16 with 8 rule applications. Total rules 380 place count 27 transition count 43
Iterating global reduction 16 with 8 rules applied. Total rules applied 388 place count 27 transition count 43
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 396 place count 27 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 401 place count 27 transition count 30
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 402 place count 26 transition count 29
Iterating global reduction 17 with 1 rules applied. Total rules applied 403 place count 26 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 404 place count 26 transition count 28
Free-agglomeration rule applied 8 times.
Iterating global reduction 18 with 8 rules applied. Total rules applied 412 place count 26 transition count 20
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 9 rules applied. Total rules applied 421 place count 18 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 422 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 423 place count 17 transition count 17
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 3 rules applied. Total rules applied 426 place count 15 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 428 place count 14 transition count 15
Applied a total of 428 rules in 66 ms. Remains 14 /213 variables (removed 199) and now considering 15/285 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 14/213 places, 15/285 transitions.
RANDOM walk for 110 steps (0 resets) in 4 ms. (22 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 16 stabilizing places and 28 stable transitions
Graph (complete) has 408 edges and 213 vertex of which 210 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
FORMULA CO4-PT-08-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 1 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 285/285 transitions.
Graph (trivial) has 222 edges and 213 vertex of which 2 / 213 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 407 edges and 212 vertex of which 209 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 208 transition count 208
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 136 transition count 206
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 148 place count 136 transition count 184
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 192 place count 114 transition count 184
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 197 place count 109 transition count 172
Iterating global reduction 2 with 5 rules applied. Total rules applied 202 place count 109 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 204 place count 109 transition count 170
Performed 39 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 282 place count 70 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 285 place count 70 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 287 place count 68 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 289 place count 68 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 291 place count 67 transition count 110
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 319 place count 53 transition count 113
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 328 place count 53 transition count 104
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 339 place count 42 transition count 82
Iterating global reduction 5 with 11 rules applied. Total rules applied 350 place count 42 transition count 82
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 358 place count 42 transition count 74
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 361 place count 39 transition count 65
Iterating global reduction 6 with 3 rules applied. Total rules applied 364 place count 39 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 366 place count 39 transition count 63
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 7 with 2 rules applied. Total rules applied 368 place count 38 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 374 place count 38 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 376 place count 36 transition count 61
Applied a total of 376 rules in 44 ms. Remains 36 /213 variables (removed 177) and now considering 61/285 (removed 224) transitions.
[2024-06-02 18:06:15] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
// Phase 1: matrix 57 rows 36 cols
[2024-06-02 18:06:15] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:06:15] [INFO ] Implicit Places using invariants in 71 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/213 places, 61/285 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 121 ms. Remains : 35/213 places, 61/285 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA CO4-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-00 finished in 392 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 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 285/285 transitions.
Graph (trivial) has 220 edges and 213 vertex of which 2 / 213 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 407 edges and 212 vertex of which 209 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 208 transition count 209
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 74 rules applied. Total rules applied 147 place count 137 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 136 transition count 206
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 148 place count 136 transition count 184
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 192 place count 114 transition count 184
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 196 place count 110 transition count 174
Iterating global reduction 3 with 4 rules applied. Total rules applied 200 place count 110 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 201 place count 110 transition count 173
Performed 39 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 279 place count 71 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 281 place count 71 transition count 117
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 283 place count 69 transition count 115
Iterating global reduction 5 with 2 rules applied. Total rules applied 285 place count 69 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 5 with 2 rules applied. Total rules applied 287 place count 68 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 5 with 28 rules applied. Total rules applied 315 place count 54 transition count 117
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 323 place count 54 transition count 109
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 334 place count 43 transition count 87
Iterating global reduction 6 with 11 rules applied. Total rules applied 345 place count 43 transition count 87
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 352 place count 43 transition count 80
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 355 place count 40 transition count 71
Iterating global reduction 7 with 3 rules applied. Total rules applied 358 place count 40 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 360 place count 40 transition count 69
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 368 place count 40 transition count 61
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 369 place count 40 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 371 place count 38 transition count 59
Applied a total of 371 rules in 41 ms. Remains 38 /213 variables (removed 175) and now considering 59/285 (removed 226) transitions.
[2024-06-02 18:06:15] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
// Phase 1: matrix 55 rows 38 cols
[2024-06-02 18:06:15] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:06:15] [INFO ] Implicit Places using invariants in 64 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/213 places, 59/285 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 121 ms. Remains : 37/213 places, 59/285 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-01
Product exploration explored 100000 steps with 4 reset in 166 ms.
Product exploration explored 100000 steps with 62 reset in 82 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 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 40000 steps (4868 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30434 steps (474 resets) in 72 ms. (416 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 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-02 18:06:16] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
// Phase 1: matrix 55 rows 37 cols
[2024-06-02 18:06:16] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:06:16] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 18:06:16] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2024-06-02 18:06:16] [INFO ] Invariant cache hit.
[2024-06-02 18:06:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:06:16] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-02 18:06:16] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-06-02 18:06:16] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2024-06-02 18:06:16] [INFO ] Invariant cache hit.
[2024-06-02 18:06:16] [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, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 54/91 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1/92 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/92 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 42 constraints, problems are : Problem set: 0 solved, 44 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 54/91 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 44/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 1/92 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 86 constraints, problems are : Problem set: 0 solved, 44 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1421ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1427ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1510 ms. Remains : 37/37 places, 59/59 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 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 37562 steps (4575 resets) in 64 ms. (577 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 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20 reset in 135 ms.
Product exploration explored 100000 steps with 29 reset in 63 ms.
Built C files in :
/tmp/ltsmin3437539452627443206
[2024-06-02 18:06:18] [INFO ] Computing symmetric may disable matrix : 59 transitions.
[2024-06-02 18:06:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:06:18] [INFO ] Computing symmetric may enable matrix : 59 transitions.
[2024-06-02 18:06:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:06:18] [INFO ] Computing Do-Not-Accords matrix : 59 transitions.
[2024-06-02 18:06:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:06:18] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3437539452627443206
Running compilation step : cd /tmp/ltsmin3437539452627443206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 387 ms.
Running link step : cd /tmp/ltsmin3437539452627443206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3437539452627443206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14708358007323105941.hoa' '--buchi-type=spotba'
LTSmin run took 486 ms.
FORMULA CO4-PT-08-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLFireability-01 finished in 3821 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 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 285/285 transitions.
Graph (trivial) has 222 edges and 213 vertex of which 2 / 213 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 407 edges and 212 vertex of which 209 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 208 transition count 207
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 135 transition count 205
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 150 place count 135 transition count 183
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 194 place count 113 transition count 183
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 199 place count 108 transition count 171
Iterating global reduction 2 with 5 rules applied. Total rules applied 204 place count 108 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 108 transition count 169
Performed 38 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 282 place count 70 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 284 place count 70 transition count 114
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 286 place count 68 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 288 place count 68 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 4 with 2 rules applied. Total rules applied 290 place count 67 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 4 with 28 rules applied. Total rules applied 318 place count 53 transition count 114
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 326 place count 53 transition count 106
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 337 place count 42 transition count 84
Iterating global reduction 5 with 11 rules applied. Total rules applied 348 place count 42 transition count 84
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 355 place count 42 transition count 77
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 358 place count 39 transition count 68
Iterating global reduction 6 with 3 rules applied. Total rules applied 361 place count 39 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 363 place count 39 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 365 place count 38 transition count 73
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 374 place count 38 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 376 place count 36 transition count 62
Applied a total of 376 rules in 24 ms. Remains 36 /213 variables (removed 177) and now considering 62/285 (removed 223) transitions.
[2024-06-02 18:06:19] [INFO ] Flow matrix only has 58 transitions (discarded 4 similar events)
// Phase 1: matrix 58 rows 36 cols
[2024-06-02 18:06:19] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:06:19] [INFO ] Implicit Places using invariants in 44 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/213 places, 62/285 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 72 ms. Remains : 35/213 places, 62/285 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-02
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA CO4-PT-08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-02 finished in 112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 285/285 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 271
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 205 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 202 transition count 265
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 202 transition count 265
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 200 transition count 263
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 200 transition count 263
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 198 transition count 261
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 198 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 198 transition count 259
Applied a total of 33 rules in 9 ms. Remains 198 /213 variables (removed 15) and now considering 259/285 (removed 26) transitions.
// Phase 1: matrix 259 rows 198 cols
[2024-06-02 18:06:19] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:06:19] [INFO ] Implicit Places using invariants in 69 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/213 places, 259/285 transitions.
Applied a total of 0 rules in 2 ms. Remains 197 /197 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 197/213 places, 259/285 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-05 finished in 159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))||X(F(p2))))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 285/285 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 271
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 205 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 202 transition count 265
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 202 transition count 265
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 200 transition count 263
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 200 transition count 263
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 198 transition count 261
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 198 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 198 transition count 259
Applied a total of 33 rules in 7 ms. Remains 198 /213 variables (removed 15) and now considering 259/285 (removed 26) transitions.
[2024-06-02 18:06:19] [INFO ] Invariant cache hit.
[2024-06-02 18:06:19] [INFO ] Implicit Places using invariants in 56 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/213 places, 259/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 197 /197 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 197/213 places, 259/285 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-08-LTLFireability-06
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-06 finished in 249 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((G(F(p0)) U p1))))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 285/285 transitions.
Graph (complete) has 408 edges and 213 vertex of which 210 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 209 transition count 208
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 149 place count 136 transition count 206
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 149 place count 136 transition count 184
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 193 place count 114 transition count 184
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 198 place count 109 transition count 172
Iterating global reduction 2 with 5 rules applied. Total rules applied 203 place count 109 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 205 place count 109 transition count 170
Performed 38 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 281 place count 71 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 284 place count 71 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 286 place count 69 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 288 place count 69 transition count 113
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 290 place count 68 transition count 112
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 318 place count 54 transition count 115
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 325 place count 54 transition count 108
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 336 place count 43 transition count 86
Iterating global reduction 5 with 11 rules applied. Total rules applied 347 place count 43 transition count 86
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 354 place count 43 transition count 79
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 357 place count 40 transition count 70
Iterating global reduction 6 with 3 rules applied. Total rules applied 360 place count 40 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 362 place count 40 transition count 68
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 7 with 2 rules applied. Total rules applied 364 place count 39 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 377 place count 39 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 379 place count 37 transition count 59
Applied a total of 379 rules in 20 ms. Remains 37 /213 variables (removed 176) and now considering 59/285 (removed 226) transitions.
[2024-06-02 18:06:20] [INFO ] Flow matrix only has 56 transitions (discarded 3 similar events)
// Phase 1: matrix 56 rows 37 cols
[2024-06-02 18:06:20] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:06:20] [INFO ] Implicit Places using invariants in 31 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/213 places, 59/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53 ms. Remains : 36/213 places, 59/285 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CO4-PT-08-LTLFireability-07
Stuttering criterion allowed to conclude after 52 steps with 6 reset in 1 ms.
FORMULA CO4-PT-08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-07 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 285/285 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 207 transition count 275
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 207 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 207 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 204 transition count 269
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 204 transition count 269
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 202 transition count 267
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 202 transition count 267
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 200 transition count 265
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 200 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 200 transition count 263
Applied a total of 29 rules in 14 ms. Remains 200 /213 variables (removed 13) and now considering 263/285 (removed 22) transitions.
// Phase 1: matrix 263 rows 200 cols
[2024-06-02 18:06:20] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:06:20] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 18:06:20] [INFO ] Invariant cache hit.
[2024-06-02 18:06:20] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-02 18:06:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 18:06:22] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:06:22] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-02 18:06:23] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:06:23] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:06:23] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
Problem TDEAD215 is UNSAT
[2024-06-02 18:06:23] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 5 ms to minimize.
[2024-06-02 18:06:23] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
Problem TDEAD218 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 7/12 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 263/463 variables, 200/212 constraints. Problems are: Problem set: 2 solved, 260 unsolved
[2024-06-02 18:06:25] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/213 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 213 constraints, problems are : Problem set: 2 solved, 260 unsolved in 10792 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 2 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 8/13 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 263/463 variables, 200/213 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 260/473 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/473 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/473 constraints. Problems are: Problem set: 2 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 473 constraints, problems are : Problem set: 2 solved, 260 unsolved in 10740 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 260/262 constraints, Known Traps: 8/8 constraints]
After SMT, in 21586ms problems are : Problem set: 2 solved, 260 unsolved
Search for dead transitions found 2 dead transitions in 21589ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 200/213 places, 261/285 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21777 ms. Remains : 200/213 places, 261/285 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-08 finished in 21909 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 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 285/285 transitions.
Graph (trivial) has 221 edges and 213 vertex of which 2 / 213 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 407 edges and 212 vertex of which 209 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 208 transition count 208
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 149 place count 136 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 135 transition count 205
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 150 place count 135 transition count 183
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 194 place count 113 transition count 183
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 199 place count 108 transition count 171
Iterating global reduction 3 with 5 rules applied. Total rules applied 204 place count 108 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 108 transition count 169
Performed 38 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 282 place count 70 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 284 place count 70 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 286 place count 68 transition count 112
Iterating global reduction 5 with 2 rules applied. Total rules applied 288 place count 68 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 290 place count 67 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 318 place count 53 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 327 place count 53 transition count 105
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 338 place count 42 transition count 83
Iterating global reduction 6 with 11 rules applied. Total rules applied 349 place count 42 transition count 83
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 356 place count 42 transition count 76
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 359 place count 39 transition count 67
Iterating global reduction 7 with 3 rules applied. Total rules applied 362 place count 39 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 364 place count 39 transition count 65
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 8 with 2 rules applied. Total rules applied 366 place count 38 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 373 place count 38 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 375 place count 36 transition count 63
Applied a total of 375 rules in 23 ms. Remains 36 /213 variables (removed 177) and now considering 63/285 (removed 222) transitions.
[2024-06-02 18:06:42] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
// Phase 1: matrix 59 rows 36 cols
[2024-06-02 18:06:42] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:06:42] [INFO ] Implicit Places using invariants in 40 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/213 places, 63/285 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81 ms. Remains : 35/213 places, 63/285 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-12
Product exploration explored 100000 steps with 12 reset in 71 ms.
Product exploration explored 100000 steps with 277 reset in 62 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 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 1839 steps (222 resets) in 9 ms. (183 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 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-06-02 18:06:42] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
// Phase 1: matrix 59 rows 35 cols
[2024-06-02 18:06:42] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:06:42] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 18:06:42] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
[2024-06-02 18:06:42] [INFO ] Invariant cache hit.
[2024-06-02 18:06:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:06:42] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-02 18:06:42] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-02 18:06:42] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
[2024-06-02 18:06:42] [INFO ] Invariant cache hit.
[2024-06-02 18:06:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 58/93 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 1/94 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/94 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 40 constraints, problems are : Problem set: 0 solved, 48 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 58/93 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 48/87 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 1/94 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/94 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 88 constraints, problems are : Problem set: 0 solved, 48 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1147ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1147ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1238 ms. Remains : 35/35 places, 63/63 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 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 1637 steps (197 resets) in 5 ms. (272 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 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13 reset in 35 ms.
Product exploration explored 100000 steps with 78 reset in 138 ms.
Built C files in :
/tmp/ltsmin12938113343648579884
[2024-06-02 18:06:44] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-06-02 18:06:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:06:44] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-06-02 18:06:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:06:44] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-06-02 18:06:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:06:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12938113343648579884
Running compilation step : cd /tmp/ltsmin12938113343648579884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin12938113343648579884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin12938113343648579884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11971711043071561756.hoa' '--buchi-type=spotba'
LTSmin run took 183 ms.
FORMULA CO4-PT-08-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLFireability-12 finished in 2712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 285/285 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 206 transition count 272
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 206 transition count 271
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 204 transition count 267
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 204 transition count 267
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 202 transition count 265
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 202 transition count 265
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 200 transition count 263
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 200 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 200 transition count 261
Applied a total of 29 rules in 10 ms. Remains 200 /213 variables (removed 13) and now considering 261/285 (removed 24) transitions.
// Phase 1: matrix 261 rows 200 cols
[2024-06-02 18:06:44] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:06:44] [INFO ] Implicit Places using invariants in 53 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/213 places, 261/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 199 /199 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 199/213 places, 261/285 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-13
Product exploration explored 100000 steps with 85 reset in 58 ms.
Product exploration explored 100000 steps with 19 reset in 59 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 358 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 20729 steps (122 resets) in 34 ms. (592 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 261/261 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 199 cols
[2024-06-02 18:06:45] [INFO ] Computed 4 invariants in 9 ms
[2024-06-02 18:06:45] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:06:45] [INFO ] Invariant cache hit.
[2024-06-02 18:06:45] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-06-02 18:06:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 18:06:47] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:06:47] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/460 variables, 199/205 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 18:06:50] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 206 constraints, problems are : Problem set: 0 solved, 260 unsolved in 10360 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/460 variables, 199/206 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 260/466 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 18:07:00] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/460 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 467 constraints, problems are : Problem set: 0 solved, 260 unsolved in 12719 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 4/4 constraints]
After SMT, in 23117ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 23121ms
Finished structural reductions in LTL mode , in 1 iterations and 23285 ms. Remains : 199/199 places, 261/261 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 358 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 31987 steps (244 resets) in 35 ms. (888 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 47 reset in 61 ms.
Entered a terminal (fully accepting) state of product in 116 steps with 3 reset in 2 ms.
FORMULA CO4-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-13 finished in 24957 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(F((p0||X(X(F(p0))))))))'
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 285/285 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 271
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 205 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 202 transition count 265
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 202 transition count 265
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 200 transition count 263
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 200 transition count 263
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 198 transition count 261
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 198 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 198 transition count 259
Applied a total of 33 rules in 19 ms. Remains 198 /213 variables (removed 15) and now considering 259/285 (removed 26) transitions.
// Phase 1: matrix 259 rows 198 cols
[2024-06-02 18:07:09] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:07:09] [INFO ] Implicit Places using invariants in 58 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/213 places, 259/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 197 /197 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 197/213 places, 259/285 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-15
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-15 finished in 206 ms.
All properties solved by simple procedures.
Total runtime 58722 ms.

BK_STOP 1717351630082

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-08, 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 r550-tall-171734898500060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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