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.r576-smll-171734920200180.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 MedleyA-PT-23, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920200180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 150K 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 MedleyA-PT-23-LTLFireability-00
FORMULA_NAME MedleyA-PT-23-LTLFireability-01
FORMULA_NAME MedleyA-PT-23-LTLFireability-02
FORMULA_NAME MedleyA-PT-23-LTLFireability-03
FORMULA_NAME MedleyA-PT-23-LTLFireability-04
FORMULA_NAME MedleyA-PT-23-LTLFireability-05
FORMULA_NAME MedleyA-PT-23-LTLFireability-06
FORMULA_NAME MedleyA-PT-23-LTLFireability-07
FORMULA_NAME MedleyA-PT-23-LTLFireability-08
FORMULA_NAME MedleyA-PT-23-LTLFireability-09
FORMULA_NAME MedleyA-PT-23-LTLFireability-10
FORMULA_NAME MedleyA-PT-23-LTLFireability-11
FORMULA_NAME MedleyA-PT-23-LTLFireability-12
FORMULA_NAME MedleyA-PT-23-LTLFireability-13
FORMULA_NAME MedleyA-PT-23-LTLFireability-14
FORMULA_NAME MedleyA-PT-23-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717403885788

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-03 08:38:08] [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-03 08:38:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 08:38:09] [INFO ] Load time of PNML (sax parser for PT used): 359 ms
[2024-06-03 08:38:09] [INFO ] Transformed 378 places.
[2024-06-03 08:38:09] [INFO ] Transformed 614 transitions.
[2024-06-03 08:38:09] [INFO ] Found NUPN structural information;
[2024-06-03 08:38:09] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 611 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MedleyA-PT-23-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 614
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 96 place count 282 transition count 521
Iterating global reduction 1 with 93 rules applied. Total rules applied 189 place count 282 transition count 521
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 256 place count 215 transition count 454
Iterating global reduction 1 with 67 rules applied. Total rules applied 323 place count 215 transition count 454
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 346 place count 192 transition count 413
Iterating global reduction 1 with 23 rules applied. Total rules applied 369 place count 192 transition count 413
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 377 place count 184 transition count 390
Iterating global reduction 1 with 8 rules applied. Total rules applied 385 place count 184 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 386 place count 184 transition count 389
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 388 place count 182 transition count 384
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 182 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 392 place count 182 transition count 382
Applied a total of 392 rules in 236 ms. Remains 182 /378 variables (removed 196) and now considering 382/614 (removed 232) transitions.
// Phase 1: matrix 382 rows 182 cols
[2024-06-03 08:38:09] [INFO ] Computed 8 invariants in 36 ms
[2024-06-03 08:38:10] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-06-03 08:38:10] [INFO ] Invariant cache hit.
[2024-06-03 08:38:10] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2024-06-03 08:38:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-03 08:38:17] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (OVERLAPS) 382/564 variables, 182/191 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-03 08:38:24] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-03 08:38:30] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 381 unsolved
(s92 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 193 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (OVERLAPS) 382/564 variables, 182/193 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 381/574 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-03 08:38:50] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 3 ms to minimize.
[2024-06-03 08:38:56] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 576 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 5/5 constraints]
After SMT, in 60631ms problems are : Problem set: 0 solved, 381 unsolved
Search for dead transitions found 0 dead transitions in 60670ms
Starting structural reductions in LTL mode, iteration 1 : 182/378 places, 382/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61885 ms. Remains : 182/378 places, 382/614 transitions.
Support contains 39 out of 182 places after structural reductions.
[2024-06-03 08:39:11] [INFO ] Flatten gal took : 133 ms
[2024-06-03 08:39:11] [INFO ] Flatten gal took : 56 ms
[2024-06-03 08:39:12] [INFO ] Input system was already deterministic with 382 transitions.
Support contains 38 out of 182 places (down from 39) after GAL structural reductions.
RANDOM walk for 40000 steps (31 resets) in 3262 ms. (12 steps per ms) remains 16/26 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 25 ms. (153 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4002 steps (13 resets) in 26 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (12 resets) in 29 ms. (133 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (14 resets) in 30 ms. (129 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (14 resets) in 38 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (15 resets) in 55 ms. (71 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (13 resets) in 30 ms. (129 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4002 steps (14 resets) in 40 ms. (97 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 10/11 properties
[2024-06-03 08:39:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 50/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/72 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 267/339 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 187/526 variables, 87/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 29/555 variables, 17/184 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 9/564 variables, 6/190 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/564 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 190 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 50/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/72 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 267/339 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 187/526 variables, 87/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 29/555 variables, 17/194 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 9/564 variables, 6/200 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/564 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 200 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1701 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 2766ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 880 steps, including 24 resets, run visited all 1 properties in 4 ms. (steps per millisecond=220 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 787 ms.
Computed a total of 18 stabilizing places and 23 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 141 edges and 182 vertex of which 13 / 182 are part of one of the 2 SCC in 5 ms
Free SCC test removed 11 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 170 transition count 349
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 157 transition count 348
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 28 place count 157 transition count 339
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 148 transition count 339
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 68 place count 126 transition count 299
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 126 transition count 299
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 126 transition count 296
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 93 place count 126 transition count 294
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 103 place count 118 transition count 278
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 118 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 112 place count 118 transition count 275
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 116 transition count 270
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 116 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 116 transition count 269
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 167 place count 91 transition count 244
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 172 place count 91 transition count 239
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 179 place count 84 transition count 218
Iterating global reduction 6 with 7 rules applied. Total rules applied 186 place count 84 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 188 place count 84 transition count 216
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 189 place count 83 transition count 214
Iterating global reduction 7 with 1 rules applied. Total rules applied 190 place count 83 transition count 214
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 191 place count 82 transition count 211
Iterating global reduction 7 with 1 rules applied. Total rules applied 192 place count 82 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 193 place count 82 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 195 place count 81 transition count 209
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 213 place count 72 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 215 place count 72 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 221 place count 72 transition count 217
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 223 place count 70 transition count 211
Iterating global reduction 9 with 2 rules applied. Total rules applied 225 place count 70 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 227 place count 70 transition count 209
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 229 place count 68 transition count 207
Applied a total of 229 rules in 234 ms. Remains 68 /182 variables (removed 114) and now considering 207/382 (removed 175) transitions.
[2024-06-03 08:39:17] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
// Phase 1: matrix 198 rows 68 cols
[2024-06-03 08:39:17] [INFO ] Computed 8 invariants in 5 ms
[2024-06-03 08:39:17] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-03 08:39:17] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
[2024-06-03 08:39:17] [INFO ] Invariant cache hit.
[2024-06-03 08:39:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 08:39:17] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-06-03 08:39:17] [INFO ] Redundant transitions in 15 ms returned []
Running 187 sub problems to find dead transitions.
[2024-06-03 08:39:17] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
[2024-06-03 08:39:17] [INFO ] Invariant cache hit.
[2024-06-03 08:39:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 195/260 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 5/265 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/266 variables, and 77 constraints, problems are : Problem set: 0 solved, 187 unsolved in 6736 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 195/260 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 5/265 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 187/264 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/265 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/266 variables, and 264 constraints, problems are : Problem set: 0 solved, 187 unsolved in 8690 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 15616ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 15620ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/182 places, 207/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16212 ms. Remains : 68/182 places, 207/382 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-23-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-00 finished in 16609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 166 transition count 354
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 166 transition count 354
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 157 transition count 336
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 157 transition count 336
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 157 transition count 333
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 152 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 152 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 152 transition count 320
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 150 transition count 315
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 150 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 150 transition count 313
Applied a total of 71 rules in 19 ms. Remains 150 /182 variables (removed 32) and now considering 313/382 (removed 69) transitions.
// Phase 1: matrix 313 rows 150 cols
[2024-06-03 08:39:33] [INFO ] Computed 8 invariants in 5 ms
[2024-06-03 08:39:33] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-03 08:39:33] [INFO ] Invariant cache hit.
[2024-06-03 08:39:34] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2024-06-03 08:39:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-03 08:39:39] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/463 variables, 150/159 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-03 08:39:44] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 160 constraints, problems are : Problem set: 0 solved, 312 unsolved in 22176 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/463 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 312/472 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-03 08:40:03] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 3 ms to minimize.
[2024-06-03 08:40:03] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 0/463 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 474 constraints, problems are : Problem set: 0 solved, 312 unsolved in 29897 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 4/4 constraints]
After SMT, in 52296ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 52302ms
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 313/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52910 ms. Remains : 150/182 places, 313/382 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-01 finished in 53195 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(((p1 U p2)&&p0))))'
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 143 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 164 transition count 340
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 152 transition count 339
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 26 place count 152 transition count 331
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 144 transition count 331
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 63 place count 123 transition count 290
Iterating global reduction 2 with 21 rules applied. Total rules applied 84 place count 123 transition count 290
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 87 place count 123 transition count 287
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 87 place count 123 transition count 286
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 122 transition count 286
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 118 transition count 275
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 118 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 118 transition count 273
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 100 place count 117 transition count 270
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 117 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 117 transition count 269
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 144 place count 96 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 148 place count 96 transition count 244
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 153 place count 91 transition count 229
Iterating global reduction 6 with 5 rules applied. Total rules applied 158 place count 91 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 159 place count 91 transition count 228
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 160 place count 90 transition count 226
Iterating global reduction 7 with 1 rules applied. Total rules applied 161 place count 90 transition count 226
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 162 place count 89 transition count 223
Iterating global reduction 7 with 1 rules applied. Total rules applied 163 place count 89 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 164 place count 89 transition count 222
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 8 with 2 rules applied. Total rules applied 166 place count 88 transition count 221
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 182 place count 80 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 191 place count 80 transition count 224
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 194 place count 77 transition count 215
Iterating global reduction 8 with 3 rules applied. Total rules applied 197 place count 77 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 200 place count 77 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 202 place count 75 transition count 210
Applied a total of 202 rules in 128 ms. Remains 75 /182 variables (removed 107) and now considering 210/382 (removed 172) transitions.
[2024-06-03 08:40:27] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
// Phase 1: matrix 201 rows 75 cols
[2024-06-03 08:40:27] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 08:40:27] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-03 08:40:27] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
[2024-06-03 08:40:27] [INFO ] Invariant cache hit.
[2024-06-03 08:40:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-03 08:40:27] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-03 08:40:27] [INFO ] Redundant transitions in 14 ms returned []
Running 179 sub problems to find dead transitions.
[2024-06-03 08:40:27] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
[2024-06-03 08:40:27] [INFO ] Invariant cache hit.
[2024-06-03 08:40:27] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 2/72 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 197/269 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 6/275 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/275 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/276 variables, and 85 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8963 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 2/72 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 197/269 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 6/275 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 162/264 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/275 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/276 variables, and 264 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8846 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 17937ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 17940ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/182 places, 210/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18412 ms. Remains : 75/182 places, 210/382 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-05 finished in 18555 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(p1))||p0)))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 165 transition count 353
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 165 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 165 transition count 352
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 155 transition count 332
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 155 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 59 place count 155 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 150 transition count 317
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 150 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 150 transition count 315
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 148 transition count 310
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 148 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 148 transition count 308
Applied a total of 77 rules in 11 ms. Remains 148 /182 variables (removed 34) and now considering 308/382 (removed 74) transitions.
// Phase 1: matrix 308 rows 148 cols
[2024-06-03 08:40:45] [INFO ] Computed 8 invariants in 3 ms
[2024-06-03 08:40:45] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-03 08:40:45] [INFO ] Invariant cache hit.
[2024-06-03 08:40:46] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-03 08:40:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-03 08:40:49] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/456 variables, 148/157 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-03 08:40:52] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 158 constraints, problems are : Problem set: 0 solved, 307 unsolved in 15266 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/456 variables, 148/158 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 307/465 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-03 08:41:18] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 2 ms to minimize.
[2024-06-03 08:41:18] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/456 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 467 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 4/4 constraints]
After SMT, in 45467ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 45473ms
Starting structural reductions in LTL mode, iteration 1 : 148/182 places, 308/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46015 ms. Remains : 148/182 places, 308/382 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 295 ms.
Product exploration explored 100000 steps with 50000 reset in 317 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 25 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-23-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-23-LTLFireability-06 finished in 46841 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||(p1&&F((F(p2)&&X(p1))))))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 165 transition count 351
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 165 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 165 transition count 350
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 155 transition count 330
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 155 transition count 330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 59 place count 155 transition count 326
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 150 transition count 315
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 150 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 150 transition count 313
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 148 transition count 308
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 148 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 148 transition count 306
Applied a total of 77 rules in 9 ms. Remains 148 /182 variables (removed 34) and now considering 306/382 (removed 76) transitions.
// Phase 1: matrix 306 rows 148 cols
[2024-06-03 08:41:32] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 08:41:32] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-03 08:41:32] [INFO ] Invariant cache hit.
[2024-06-03 08:41:32] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-06-03 08:41:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 306/454 variables, 148/156 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-03 08:41:38] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 0/454 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 157 constraints, problems are : Problem set: 0 solved, 305 unsolved in 15202 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-03 08:41:50] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 306/454 variables, 148/158 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 305/463 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-03 08:41:55] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-06-03 08:41:56] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-03 08:42:03] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 466 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 5/5 constraints]
After SMT, in 45344ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 45347ms
Starting structural reductions in LTL mode, iteration 1 : 148/182 places, 306/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45794 ms. Remains : 148/182 places, 306/382 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 24 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-23-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-23-LTLFireability-07 finished in 46297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 152 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 164 transition count 339
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 151 transition count 338
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 28 place count 151 transition count 330
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 44 place count 143 transition count 330
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 66 place count 121 transition count 288
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 121 transition count 288
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 121 transition count 285
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 91 place count 121 transition count 283
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 119 transition count 283
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 114 transition count 269
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 114 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 108 place count 114 transition count 266
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 113 transition count 263
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 113 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 113 transition count 262
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 155 place count 91 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 159 place count 91 transition count 236
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 164 place count 86 transition count 221
Iterating global reduction 6 with 5 rules applied. Total rules applied 169 place count 86 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 170 place count 86 transition count 220
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 171 place count 85 transition count 218
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 85 transition count 218
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 173 place count 84 transition count 215
Iterating global reduction 7 with 1 rules applied. Total rules applied 174 place count 84 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 175 place count 84 transition count 214
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 8 with 2 rules applied. Total rules applied 177 place count 83 transition count 213
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 195 place count 74 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 204 place count 74 transition count 219
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 207 place count 71 transition count 210
Iterating global reduction 8 with 3 rules applied. Total rules applied 210 place count 71 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 213 place count 71 transition count 207
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 215 place count 69 transition count 205
Applied a total of 215 rules in 57 ms. Remains 69 /182 variables (removed 113) and now considering 205/382 (removed 177) transitions.
[2024-06-03 08:42:18] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
// Phase 1: matrix 195 rows 69 cols
[2024-06-03 08:42:18] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 08:42:18] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-03 08:42:18] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
[2024-06-03 08:42:18] [INFO ] Invariant cache hit.
[2024-06-03 08:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 08:42:18] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-06-03 08:42:18] [INFO ] Redundant transitions in 2 ms returned []
Running 176 sub problems to find dead transitions.
[2024-06-03 08:42:18] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
[2024-06-03 08:42:18] [INFO ] Invariant cache hit.
[2024-06-03 08:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 191/257 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 6/263 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/264 variables, and 78 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7196 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 191/257 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 6/263 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 175/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 0/263 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/264 variables, and 254 constraints, problems are : Problem set: 0 solved, 176 unsolved in 8538 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 15879ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 15881ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/182 places, 205/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16183 ms. Remains : 69/182 places, 205/382 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-08 finished in 16236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||G(p1)) U (p2||(X(F(p1))&&F(p3)))))'
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 165 transition count 351
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 165 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 165 transition count 350
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 157 transition count 334
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 157 transition count 334
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 157 transition count 330
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 153 transition count 321
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 153 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 153 transition count 319
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 152 transition count 317
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 152 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 152 transition count 316
Applied a total of 68 rules in 8 ms. Remains 152 /182 variables (removed 30) and now considering 316/382 (removed 66) transitions.
// Phase 1: matrix 316 rows 152 cols
[2024-06-03 08:42:34] [INFO ] Computed 8 invariants in 3 ms
[2024-06-03 08:42:35] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-03 08:42:35] [INFO ] Invariant cache hit.
[2024-06-03 08:42:35] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2024-06-03 08:42:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 316/468 variables, 152/160 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-03 08:42:44] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 0/468 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 161 constraints, problems are : Problem set: 0 solved, 315 unsolved in 22146 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/468 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 315/476 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-03 08:43:06] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 3 ms to minimize.
[2024-06-03 08:43:06] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-03 08:43:13] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 479 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 4/4 constraints]
After SMT, in 52372ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 52378ms
Starting structural reductions in LTL mode, iteration 1 : 152/182 places, 316/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52927 ms. Remains : 152/182 places, 316/382 transitions.
Stuttering acceptance computed with spot in 495 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0)), (NOT p1), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-09
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-09 finished in 53464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 6 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 147 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 164 transition count 339
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 151 transition count 338
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 28 place count 151 transition count 332
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 145 transition count 332
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 61 place count 124 transition count 293
Iterating global reduction 2 with 21 rules applied. Total rules applied 82 place count 124 transition count 293
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 124 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 85 place count 124 transition count 289
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 123 transition count 289
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 93 place count 117 transition count 272
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 117 transition count 272
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 117 transition count 268
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 116 transition count 265
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 116 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 116 transition count 264
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 152 place count 93 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 156 place count 93 transition count 237
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 161 place count 88 transition count 222
Iterating global reduction 6 with 5 rules applied. Total rules applied 166 place count 88 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 167 place count 88 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 169 place count 87 transition count 220
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 187 place count 78 transition count 235
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 196 place count 78 transition count 226
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 198 place count 76 transition count 220
Iterating global reduction 7 with 2 rules applied. Total rules applied 200 place count 76 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 202 place count 76 transition count 218
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 204 place count 74 transition count 216
Applied a total of 204 rules in 112 ms. Remains 74 /182 variables (removed 108) and now considering 216/382 (removed 166) transitions.
[2024-06-03 08:43:28] [INFO ] Flow matrix only has 207 transitions (discarded 9 similar events)
// Phase 1: matrix 207 rows 74 cols
[2024-06-03 08:43:28] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 08:43:28] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-03 08:43:28] [INFO ] Flow matrix only has 207 transitions (discarded 9 similar events)
[2024-06-03 08:43:28] [INFO ] Invariant cache hit.
[2024-06-03 08:43:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-03 08:43:28] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2024-06-03 08:43:28] [INFO ] Redundant transitions in 3 ms returned []
Running 186 sub problems to find dead transitions.
[2024-06-03 08:43:28] [INFO ] Flow matrix only has 207 transitions (discarded 9 similar events)
[2024-06-03 08:43:28] [INFO ] Invariant cache hit.
[2024-06-03 08:43:28] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 203/274 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 6/280 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/281 variables, and 84 constraints, problems are : Problem set: 0 solved, 186 unsolved in 8721 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 203/274 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 6/280 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 184/270 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/281 variables, and 270 constraints, problems are : Problem set: 0 solved, 186 unsolved in 8426 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 17316ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 17321ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/182 places, 216/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17895 ms. Remains : 74/182 places, 216/382 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-11 finished in 18099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||(X(p2)&&p1)))))'
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 167 transition count 357
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 167 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 167 transition count 356
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 159 transition count 340
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 159 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 159 transition count 337
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 155 transition count 329
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 155 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 155 transition count 328
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 153 transition count 323
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 153 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 153 transition count 321
Applied a total of 65 rules in 12 ms. Remains 153 /182 variables (removed 29) and now considering 321/382 (removed 61) transitions.
// Phase 1: matrix 321 rows 153 cols
[2024-06-03 08:43:46] [INFO ] Computed 8 invariants in 3 ms
[2024-06-03 08:43:46] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-03 08:43:46] [INFO ] Invariant cache hit.
[2024-06-03 08:43:46] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2024-06-03 08:43:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/474 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-03 08:43:56] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 0/474 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 162 constraints, problems are : Problem set: 0 solved, 320 unsolved in 23105 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/474 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 320/482 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-03 08:44:17] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 2 ms to minimize.
[2024-06-03 08:44:17] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 484 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 3/3 constraints]
After SMT, in 53341ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 53347ms
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 321/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53867 ms. Remains : 153/182 places, 321/382 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-12
Product exploration explored 100000 steps with 15 reset in 253 ms.
Product exploration explored 100000 steps with 32 reset in 361 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Computed a total of 17 stabilizing places and 22 stable transitions
Detected a total of 17/153 stabilizing places and 22/321 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 633 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 40000 steps (16 resets) in 508 ms. (78 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40001 steps (32 resets) in 572 ms. (69 steps per ms) remains 1/2 properties
BEST_FIRST walk for 5315 steps (6 resets) in 28 ms. (183 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 1893 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 321/321 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2024-06-03 08:44:44] [INFO ] Invariant cache hit.
[2024-06-03 08:44:45] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-03 08:44:45] [INFO ] Invariant cache hit.
[2024-06-03 08:44:45] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2024-06-03 08:44:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/474 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-03 08:44:55] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 0/474 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 162 constraints, problems are : Problem set: 0 solved, 320 unsolved in 21577 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/474 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 320/482 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-03 08:45:14] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2024-06-03 08:45:14] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 484 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 3/3 constraints]
After SMT, in 51821ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 51827ms
Finished structural reductions in LTL mode , in 1 iterations and 52376 ms. Remains : 153/153 places, 321/321 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Computed a total of 17 stabilizing places and 22 stable transitions
Detected a total of 17/153 stabilizing places and 22/321 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 406 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 40000 steps (31 resets) in 382 ms. (104 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (48 resets) in 182 ms. (218 steps per ms) remains 1/3 properties
BEST_FIRST walk for 11115 steps (10 resets) in 24 ms. (444 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 1742 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 7 reset in 240 ms.
Product exploration explored 100000 steps with 6 reset in 175 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 321/321 transitions.
Graph (trivial) has 115 edges and 153 vertex of which 16 / 153 are part of one of the 3 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 140 transition count 301
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 140 transition count 304
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 140 transition count 304
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 19 place count 131 transition count 289
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 28 place count 131 transition count 289
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 53 place count 131 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 131 transition count 288
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 67 place count 118 transition count 263
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 80 place count 118 transition count 263
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 118 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 118 transition count 260
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 117 transition count 259
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 117 transition count 259
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 98 place count 117 transition count 301
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 101 place count 117 transition count 298
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 104 place count 114 transition count 292
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 107 place count 114 transition count 292
Deduced a syphon composed of 33 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 119 place count 114 transition count 280
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 125 place count 108 transition count 268
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 131 place count 108 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 108 transition count 265
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 134 rules in 46 ms. Remains 108 /153 variables (removed 45) and now considering 265/321 (removed 56) transitions.
[2024-06-03 08:45:41] [INFO ] Redundant transitions in 2 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-03 08:45:41] [INFO ] Flow matrix only has 256 transitions (discarded 9 similar events)
// Phase 1: matrix 256 rows 108 cols
[2024-06-03 08:45:41] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 08:45:41] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-03 08:45:43] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-06-03 08:45:43] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-03 08:45:43] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-03 08:45:43] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-03 08:45:44] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
[2024-06-03 08:45:44] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 6/14 constraints. Problems are: Problem set: 19 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 19 solved, 245 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD149 is UNSAT
At refinement iteration 4 (OVERLAPS) 255/363 variables, 108/122 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 2/124 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/124 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/125 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/125 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/125 constraints. Problems are: Problem set: 45 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 125 constraints, problems are : Problem set: 45 solved, 219 unsolved in 12575 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 45 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 17/94 variables, 8/8 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 6/14 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 252/346 variables, 94/108 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 2/110 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 219/329 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/329 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 17/363 variables, 14/343 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/343 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 1/364 variables, 1/344 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/344 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 12 (OVERLAPS) 0/364 variables, 0/344 constraints. Problems are: Problem set: 45 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 344 constraints, problems are : Problem set: 45 solved, 219 unsolved in 21285 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 219/264 constraints, Known Traps: 6/6 constraints]
After SMT, in 33985ms problems are : Problem set: 45 solved, 219 unsolved
Search for dead transitions found 45 dead transitions in 33990ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 108/153 places, 220/321 transitions.
Graph (complete) has 438 edges and 108 vertex of which 78 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.3 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 78 /108 variables (removed 30) and now considering 220/220 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/153 places, 220/321 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 34063 ms. Remains : 78/153 places, 220/321 transitions.
Built C files in :
/tmp/ltsmin17450330290428387739
[2024-06-03 08:46:15] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17450330290428387739
Running compilation step : cd /tmp/ltsmin17450330290428387739;'/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 1341 ms.
Running link step : cd /tmp/ltsmin17450330290428387739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin17450330290428387739;'/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/stateBased1627989501595487788.hoa' '--buchi-type=spotba'
LTSmin run took 1681 ms.
FORMULA MedleyA-PT-23-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-23-LTLFireability-12 finished in 152233 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&&F(G(p2)))))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 152 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 164 transition count 340
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 152 transition count 339
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 26 place count 152 transition count 330
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 143 transition count 330
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 65 place count 122 transition count 291
Iterating global reduction 2 with 21 rules applied. Total rules applied 86 place count 122 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 122 transition count 288
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 89 place count 122 transition count 286
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 98 place count 115 transition count 272
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 115 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 106 place count 115 transition count 269
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 114 transition count 266
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 114 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 114 transition count 265
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 153 place count 92 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 157 place count 92 transition count 239
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 162 place count 87 transition count 224
Iterating global reduction 6 with 5 rules applied. Total rules applied 167 place count 87 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 168 place count 87 transition count 223
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 86 transition count 221
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 86 transition count 221
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 171 place count 85 transition count 218
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 85 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 173 place count 85 transition count 217
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 8 with 2 rules applied. Total rules applied 175 place count 84 transition count 216
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 193 place count 75 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 202 place count 75 transition count 222
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 205 place count 72 transition count 213
Iterating global reduction 8 with 3 rules applied. Total rules applied 208 place count 72 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 211 place count 72 transition count 210
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 213 place count 70 transition count 208
Applied a total of 213 rules in 47 ms. Remains 70 /182 variables (removed 112) and now considering 208/382 (removed 174) transitions.
[2024-06-03 08:46:18] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
// Phase 1: matrix 198 rows 70 cols
[2024-06-03 08:46:18] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 08:46:18] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-03 08:46:18] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-03 08:46:18] [INFO ] Invariant cache hit.
[2024-06-03 08:46:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 08:46:18] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-06-03 08:46:18] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-06-03 08:46:18] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-03 08:46:18] [INFO ] Invariant cache hit.
[2024-06-03 08:46:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 194/261 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 6/267 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/268 variables, and 79 constraints, problems are : Problem set: 0 solved, 179 unsolved in 6276 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 194/261 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 6/267 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 178/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/267 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/268 variables, and 258 constraints, problems are : Problem set: 0 solved, 179 unsolved in 7140 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 13505ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 13507ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/182 places, 208/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13794 ms. Remains : 70/182 places, 208/382 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-13
Product exploration explored 100000 steps with 2 reset in 670 ms.
Stuttering criterion allowed to conclude after 28 steps with 3 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-13 finished in 14559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p0||F(G(p1)))))))'
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 166 transition count 354
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 166 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 166 transition count 353
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 158 transition count 338
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 158 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 52 place count 158 transition count 335
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 153 transition count 324
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 153 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 153 transition count 322
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 151 transition count 317
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 151 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 151 transition count 315
Applied a total of 70 rules in 14 ms. Remains 151 /182 variables (removed 31) and now considering 315/382 (removed 67) transitions.
// Phase 1: matrix 315 rows 151 cols
[2024-06-03 08:46:33] [INFO ] Computed 8 invariants in 2 ms
[2024-06-03 08:46:33] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-03 08:46:33] [INFO ] Invariant cache hit.
[2024-06-03 08:46:33] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2024-06-03 08:46:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 315/466 variables, 151/159 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-03 08:46:42] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 160 constraints, problems are : Problem set: 0 solved, 314 unsolved in 21388 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/466 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 314/474 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-03 08:47:01] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2024-06-03 08:47:01] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (OVERLAPS) 0/466 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 476 constraints, problems are : Problem set: 0 solved, 314 unsolved in 29980 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 3/3 constraints]
After SMT, in 51509ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 51513ms
Starting structural reductions in LTL mode, iteration 1 : 151/182 places, 315/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51879 ms. Remains : 151/182 places, 315/382 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-14
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-14 finished in 52075 ms.
All properties solved by simple procedures.
Total runtime 556875 ms.

BK_STOP 1717404445400

--------------------
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="MedleyA-PT-23"
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 MedleyA-PT-23, 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 r576-smll-171734920200180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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