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-171734898600100.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-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898600100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 191K 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-13-LTLFireability-00
FORMULA_NAME CO4-PT-13-LTLFireability-01
FORMULA_NAME CO4-PT-13-LTLFireability-02
FORMULA_NAME CO4-PT-13-LTLFireability-03
FORMULA_NAME CO4-PT-13-LTLFireability-04
FORMULA_NAME CO4-PT-13-LTLFireability-05
FORMULA_NAME CO4-PT-13-LTLFireability-06
FORMULA_NAME CO4-PT-13-LTLFireability-07
FORMULA_NAME CO4-PT-13-LTLFireability-08
FORMULA_NAME CO4-PT-13-LTLFireability-09
FORMULA_NAME CO4-PT-13-LTLFireability-10
FORMULA_NAME CO4-PT-13-LTLFireability-11
FORMULA_NAME CO4-PT-13-LTLFireability-12
FORMULA_NAME CO4-PT-13-LTLFireability-13
FORMULA_NAME CO4-PT-13-LTLFireability-14
FORMULA_NAME CO4-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717352117178

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 18:15:18] [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:15:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:15:18] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-02 18:15:18] [INFO ] Transformed 649 places.
[2024-06-02 18:15:18] [INFO ] Transformed 816 transitions.
[2024-06-02 18:15:18] [INFO ] Found NUPN structural information;
[2024-06-02 18:15:18] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 172 places in 10 ms
Reduce places removed 172 places and 227 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-13-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 589/589 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 585
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 103 place count 378 transition count 500
Iterating global reduction 1 with 83 rules applied. Total rules applied 186 place count 378 transition count 500
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 252 place count 312 transition count 424
Iterating global reduction 1 with 66 rules applied. Total rules applied 318 place count 312 transition count 424
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 324 place count 312 transition count 418
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 356 place count 280 transition count 381
Iterating global reduction 2 with 32 rules applied. Total rules applied 388 place count 280 transition count 381
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 390 place count 280 transition count 379
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 411 place count 259 transition count 357
Iterating global reduction 3 with 21 rules applied. Total rules applied 432 place count 259 transition count 357
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 438 place count 259 transition count 351
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 444 place count 253 transition count 345
Iterating global reduction 4 with 6 rules applied. Total rules applied 450 place count 253 transition count 345
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 452 place count 251 transition count 343
Iterating global reduction 4 with 2 rules applied. Total rules applied 454 place count 251 transition count 343
Applied a total of 454 rules in 112 ms. Remains 251 /477 variables (removed 226) and now considering 343/589 (removed 246) transitions.
// Phase 1: matrix 343 rows 251 cols
[2024-06-02 18:15:18] [INFO ] Computed 6 invariants in 19 ms
[2024-06-02 18:15:19] [INFO ] Implicit Places using invariants in 215 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 244 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 250/477 places, 343/589 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 377 ms. Remains : 250/477 places, 343/589 transitions.
Support contains 19 out of 250 places after structural reductions.
[2024-06-02 18:15:19] [INFO ] Flatten gal took : 53 ms
[2024-06-02 18:15:19] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:15:19] [INFO ] Input system was already deterministic with 343 transitions.
Support contains 18 out of 250 places (down from 19) after GAL structural reductions.
RANDOM walk for 40000 steps (237 resets) in 1439 ms. (27 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40000 steps (157 resets) in 153 ms. (259 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (231 resets) in 73 ms. (540 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (147 resets) in 249 ms. (160 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (218 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (165 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
// Phase 1: matrix 343 rows 250 cols
[2024-06-02 18:15:20] [INFO ] Computed 5 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:15:20] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 7 ms to minimize.
Problem AtomicPropp10 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/37 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 18:15:20] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 100/137 variables, 37/44 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 181/318 variables, 70/114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 169/487 variables, 81/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 78/565 variables, 46/241 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/241 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 18/583 variables, 10/251 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/592 variables, 5/256 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/592 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 19 (OVERLAPS) 1/593 variables, 1/257 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/593 variables, 0/257 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/593 variables, 0/257 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 257 constraints, problems are : Problem set: 2 solved, 1 unsolved in 588 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/105 variables, 8/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/119 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 8/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 1/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 18/137 variables, 3/24 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 1/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 188/325 variables, 96/121 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/325 variables, 0/121 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 158/483 variables, 73/194 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/483 variables, 0/194 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 82/565 variables, 46/240 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/565 variables, 0/240 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 21/586 variables, 14/254 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/586 variables, 0/254 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 7/593 variables, 4/258 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/593 variables, 0/258 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/593 variables, 0/258 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 593/593 variables, and 258 constraints, problems are : Problem set: 2 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 953ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
FORMULA CO4-PT-13-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 31 stable transitions
Graph (complete) has 548 edges and 250 vertex of which 245 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Graph (trivial) has 256 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 546 edges and 248 vertex of which 243 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 242 transition count 242
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 186 place count 150 transition count 242
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 186 place count 150 transition count 221
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 228 place count 129 transition count 221
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 123 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 123 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 240 place count 123 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 122 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 244 place count 120 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 120 transition count 205
Performed 42 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 330 place count 78 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 334 place count 78 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 338 place count 74 transition count 139
Iterating global reduction 3 with 4 rules applied. Total rules applied 342 place count 74 transition count 139
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 378 place count 56 transition count 159
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 387 place count 56 transition count 150
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 398 place count 45 transition count 106
Iterating global reduction 4 with 11 rules applied. Total rules applied 409 place count 45 transition count 106
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 417 place count 45 transition count 98
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 420 place count 42 transition count 80
Iterating global reduction 5 with 3 rules applied. Total rules applied 423 place count 42 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 425 place count 42 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 429 place count 40 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 455 place count 40 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 457 place count 38 transition count 66
Applied a total of 457 rules in 73 ms. Remains 38 /250 variables (removed 212) and now considering 66/343 (removed 277) transitions.
[2024-06-02 18:15:21] [INFO ] Flow matrix only has 54 transitions (discarded 12 similar events)
// Phase 1: matrix 54 rows 38 cols
[2024-06-02 18:15:21] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:15:21] [INFO ] Implicit Places using invariants in 98 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/250 places, 66/343 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 37/250 places, 66/343 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CO4-PT-13-LTLFireability-02
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA CO4-PT-13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-02 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)||X(X(p1))))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 243 transition count 331
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 243 transition count 331
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 238 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 238 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 237 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 237 transition count 324
Applied a total of 26 rules in 29 ms. Remains 237 /250 variables (removed 13) and now considering 324/343 (removed 19) transitions.
// Phase 1: matrix 324 rows 237 cols
[2024-06-02 18:15:21] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:15:21] [INFO ] Implicit Places using invariants in 95 ms returned [173]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/250 places, 324/343 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 236/250 places, 324/343 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLFireability-03
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 2 ms.
FORMULA CO4-PT-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-03 finished in 347 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((G(p0)||X(X(F(p1))))))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 242 transition count 329
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 242 transition count 329
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 237 transition count 324
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 237 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 236 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 236 transition count 322
Applied a total of 28 rules in 16 ms. Remains 236 /250 variables (removed 14) and now considering 322/343 (removed 21) transitions.
// Phase 1: matrix 322 rows 236 cols
[2024-06-02 18:15:22] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:15:22] [INFO ] Implicit Places using invariants in 162 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 322/343 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 182 ms. Remains : 235/250 places, 322/343 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-13-LTLFireability-06
Product exploration explored 100000 steps with 33299 reset in 274 ms.
Product exploration explored 100000 steps with 33334 reset in 145 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 490 edges and 235 vertex of which 230 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 29492 steps (172 resets) in 146 ms. (200 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 322/322 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 235 cols
[2024-06-02 18:15:23] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:15:23] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:15:23] [INFO ] Invariant cache hit.
[2024-06-02 18:15:23] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-02 18:15:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-02 18:15:26] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
[2024-06-02 18:15:26] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:15:27] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:15:27] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/243 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 243 constraints, problems are : Problem set: 0 solved, 321 unsolved in 13880 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/243 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 321/564 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/557 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 564 constraints, problems are : Problem set: 0 solved, 321 unsolved in 18934 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 4/4 constraints]
After SMT, in 32954ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 32964ms
Finished structural reductions in LTL mode , in 1 iterations and 33302 ms. Remains : 235/235 places, 322/322 transitions.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 490 edges and 235 vertex of which 230 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 33417 steps (362 resets) in 56 ms. (586 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33266 reset in 97 ms.
Product exploration explored 100000 steps with 33286 reset in 156 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 322/322 transitions.
Graph (trivial) has 244 edges and 235 vertex of which 3 / 235 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 488 edges and 233 vertex of which 228 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 228 transition count 314
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 88 place count 228 transition count 316
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 228 transition count 316
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 115 place count 204 transition count 292
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 139 place count 204 transition count 292
Performed 51 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 190 place count 204 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 200 place count 204 transition count 307
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 246 place count 158 transition count 259
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 292 place count 158 transition count 259
Performed 28 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 320 place count 158 transition count 403
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 346 place count 158 transition count 377
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 391 place count 113 transition count 251
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 3 with 45 rules applied. Total rules applied 436 place count 113 transition count 251
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 453 place count 113 transition count 234
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 480 place count 86 transition count 177
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 4 with 27 rules applied. Total rules applied 507 place count 86 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 510 place count 86 transition count 174
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 516 place count 80 transition count 162
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 522 place count 80 transition count 162
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 525 place count 80 transition count 198
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 529 place count 76 transition count 182
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 533 place count 76 transition count 182
Deduced a syphon composed of 37 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 5 with 33 rules applied. Total rules applied 566 place count 76 transition count 149
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 566 rules in 75 ms. Remains 76 /235 variables (removed 159) and now considering 149/322 (removed 173) transitions.
[2024-06-02 18:15:58] [INFO ] Redundant transitions in 3 ms returned []
Running 148 sub problems to find dead transitions.
[2024-06-02 18:15:58] [INFO ] Flow matrix only has 134 transitions (discarded 15 similar events)
// Phase 1: matrix 134 rows 76 cols
[2024-06-02 18:15:58] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:15:58] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-06-02 18:15:59] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:15:59] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-02 18:15:59] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 3/7 constraints. Problems are: Problem set: 7 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 141 unsolved
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
At refinement iteration 4 (OVERLAPS) 133/209 variables, 76/83 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 18/101 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/101 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 1/210 variables, 1/102 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/102 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/102 constraints. Problems are: Problem set: 79 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 102 constraints, problems are : Problem set: 79 solved, 69 unsolved in 2316 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 76/76 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 79 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 8/46 variables, 4/4 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 123/169 variables, 46/53 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 18/71 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 69/140 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/140 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 40/209 variables, 30/170 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/170 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 1/210 variables, 1/171 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/171 constraints. Problems are: Problem set: 79 solved, 69 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/171 constraints. Problems are: Problem set: 79 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 171 constraints, problems are : Problem set: 79 solved, 69 unsolved in 2166 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 76/76 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 69/148 constraints, Known Traps: 3/3 constraints]
After SMT, in 4530ms problems are : Problem set: 79 solved, 69 unsolved
Search for dead transitions found 79 dead transitions in 4532ms
Found 79 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 79 transitions
Dead transitions reduction (with SMT) removed 79 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 76/235 places, 70/322 transitions.
Graph (complete) has 147 edges and 76 vertex of which 39 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 39 /76 variables (removed 37) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/235 places, 70/322 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4627 ms. Remains : 39/235 places, 70/322 transitions.
Built C files in :
/tmp/ltsmin1096208748243651706
[2024-06-02 18:16:03] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1096208748243651706
Running compilation step : cd /tmp/ltsmin1096208748243651706;'/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 626 ms.
Running link step : cd /tmp/ltsmin1096208748243651706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1096208748243651706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9703414390090175392.hoa' '--buchi-type=spotba'
LTSmin run took 3485 ms.
FORMULA CO4-PT-13-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-13-LTLFireability-06 finished in 45197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))&&G(p1)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 242 transition count 329
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 242 transition count 329
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 237 transition count 324
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 237 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 236 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 236 transition count 322
Applied a total of 28 rules in 15 ms. Remains 236 /250 variables (removed 14) and now considering 322/343 (removed 21) transitions.
// Phase 1: matrix 322 rows 236 cols
[2024-06-02 18:16:07] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:16:07] [INFO ] Implicit Places using invariants in 78 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 322/343 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 235/250 places, 322/343 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-13-LTLFireability-09
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-09 finished in 365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 243 transition count 330
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 243 transition count 330
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 239 transition count 326
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 239 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 238 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 238 transition count 324
Applied a total of 24 rules in 12 ms. Remains 238 /250 variables (removed 12) and now considering 324/343 (removed 19) transitions.
// Phase 1: matrix 324 rows 238 cols
[2024-06-02 18:16:07] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 18:16:07] [INFO ] Implicit Places using invariants in 64 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/250 places, 324/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 237 /237 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 237/250 places, 324/343 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLFireability-10
Product exploration explored 100000 steps with 7025 reset in 93 ms.
Product exploration explored 100000 steps with 7011 reset in 112 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 492 edges and 237 vertex of which 232 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Detected a total of 17/237 stabilizing places and 23/324 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 51 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 324 rows 237 cols
[2024-06-02 18:16:08] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:16:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 18:16:08] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-02 18:16:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:16:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 18:16:08] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 18:16:08] [INFO ] Computed and/alt/rep : 316/611/316 causal constraints (skipped 7 transitions) in 19 ms.
[2024-06-02 18:16:09] [INFO ] Added : 177 causal constraints over 36 iterations in 742 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 324/324 transitions.
Graph (trivial) has 249 edges and 237 vertex of which 3 / 237 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 490 edges and 235 vertex of which 230 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 90 place count 229 transition count 227
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 178 place count 141 transition count 227
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 178 place count 141 transition count 204
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 224 place count 118 transition count 204
Performed 43 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 310 place count 75 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 314 place count 75 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 318 place count 71 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 322 place count 71 transition count 136
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 358 place count 53 transition count 156
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 367 place count 53 transition count 147
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 378 place count 42 transition count 103
Iterating global reduction 4 with 11 rules applied. Total rules applied 389 place count 42 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 397 place count 42 transition count 95
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 400 place count 39 transition count 77
Iterating global reduction 5 with 3 rules applied. Total rules applied 403 place count 39 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 405 place count 39 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 409 place count 37 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 435 place count 37 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 437 place count 35 transition count 63
Applied a total of 437 rules in 23 ms. Remains 35 /237 variables (removed 202) and now considering 63/324 (removed 261) transitions.
[2024-06-02 18:16:09] [INFO ] Flow matrix only has 51 transitions (discarded 12 similar events)
// Phase 1: matrix 51 rows 35 cols
[2024-06-02 18:16:09] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:16:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 18:16:09] [INFO ] Flow matrix only has 51 transitions (discarded 12 similar events)
[2024-06-02 18:16:09] [INFO ] Invariant cache hit.
[2024-06-02 18:16:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:16:09] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-06-02 18:16:09] [INFO ] Redundant transitions in 0 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-02 18:16:09] [INFO ] Flow matrix only has 51 transitions (discarded 12 similar events)
[2024-06-02 18:16:09] [INFO ] Invariant cache hit.
[2024-06-02 18:16:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 50/84 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 1/86 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 40 constraints, problems are : Problem set: 0 solved, 52 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 50/84 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/85 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 92 constraints, problems are : Problem set: 0 solved, 52 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1626ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1626ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/237 places, 63/324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1731 ms. Remains : 35/237 places, 63/324 transitions.
Computed a total of 9 stabilizing places and 13 stable transitions
Computed a total of 9 stabilizing places and 13 stable transitions
Detected a total of 9/35 stabilizing places and 13/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-06-02 18:16:11] [INFO ] Flow matrix only has 51 transitions (discarded 12 similar events)
[2024-06-02 18:16:11] [INFO ] Invariant cache hit.
[2024-06-02 18:16:11] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-02 18:16:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-02 18:16:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:16:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 18:16:11] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-02 18:16:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:16:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-02 18:16:11] [INFO ] Computed and/alt/rep : 44/89/38 causal constraints (skipped 2 transitions) in 3 ms.
[2024-06-02 18:16:11] [INFO ] Added : 23 causal constraints over 6 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 256 steps with 44 reset in 3 ms.
FORMULA CO4-PT-13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-10 finished in 4340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 343/343 transitions.
Graph (trivial) has 256 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 546 edges and 248 vertex of which 243 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 242 transition count 242
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 186 place count 150 transition count 242
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 186 place count 150 transition count 221
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 228 place count 129 transition count 221
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 123 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 123 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 240 place count 123 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 122 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 244 place count 120 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 120 transition count 205
Performed 44 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 334 place count 76 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 338 place count 76 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 342 place count 72 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 346 place count 72 transition count 136
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 382 place count 54 transition count 156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 390 place count 54 transition count 148
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 401 place count 43 transition count 104
Iterating global reduction 4 with 11 rules applied. Total rules applied 412 place count 43 transition count 104
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 419 place count 43 transition count 97
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 422 place count 40 transition count 79
Iterating global reduction 5 with 3 rules applied. Total rules applied 425 place count 40 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 427 place count 40 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 431 place count 38 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 457 place count 38 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 459 place count 36 transition count 65
Applied a total of 459 rules in 26 ms. Remains 36 /250 variables (removed 214) and now considering 65/343 (removed 278) transitions.
[2024-06-02 18:16:12] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
// Phase 1: matrix 53 rows 36 cols
[2024-06-02 18:16:12] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:16:12] [INFO ] Implicit Places using invariants in 29 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/250 places, 65/343 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 35/250 places, 65/343 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLFireability-12
Product exploration explored 100000 steps with 44 reset in 73 ms.
Product exploration explored 100000 steps with 29 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 231 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1117 steps (134 resets) in 12 ms. (85 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 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-02 18:16:12] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
// Phase 1: matrix 53 rows 35 cols
[2024-06-02 18:16:12] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:16:12] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 18:16:12] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
[2024-06-02 18:16:12] [INFO ] Invariant cache hit.
[2024-06-02 18:16:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:16:12] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-02 18:16:12] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2024-06-02 18:16:12] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
[2024-06-02 18:16:12] [INFO ] Invariant cache hit.
[2024-06-02 18:16:12] [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, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 52/87 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 40 constraints, problems are : Problem set: 0 solved, 50 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 52/87 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 50/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 1/88 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 90 constraints, problems are : Problem set: 0 solved, 50 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 1197ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1197ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1271 ms. Remains : 35/35 places, 65/65 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 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1769 steps (208 resets) in 6 ms. (252 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 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23 reset in 39 ms.
Product exploration explored 100000 steps with 1 reset in 141 ms.
Built C files in :
/tmp/ltsmin13247436616891473626
[2024-06-02 18:16:14] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2024-06-02 18:16:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:16:14] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2024-06-02 18:16:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:16:14] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2024-06-02 18:16:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:16:14] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13247436616891473626
Running compilation step : cd /tmp/ltsmin13247436616891473626;'/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 170 ms.
Running link step : cd /tmp/ltsmin13247436616891473626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13247436616891473626;'/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/stateBased7577022012497032871.hoa' '--buchi-type=spotba'
LTSmin run took 170 ms.
FORMULA CO4-PT-13-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-13-LTLFireability-12 finished in 3180 ms.
All properties solved by simple procedures.
Total runtime 56910 ms.

BK_STOP 1717352175235

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-13"
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-13, 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-171734898600100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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