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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K 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 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 26K 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-03-LTLFireability-00
FORMULA_NAME MedleyA-PT-03-LTLFireability-01
FORMULA_NAME MedleyA-PT-03-LTLFireability-02
FORMULA_NAME MedleyA-PT-03-LTLFireability-03
FORMULA_NAME MedleyA-PT-03-LTLFireability-04
FORMULA_NAME MedleyA-PT-03-LTLFireability-05
FORMULA_NAME MedleyA-PT-03-LTLFireability-06
FORMULA_NAME MedleyA-PT-03-LTLFireability-07
FORMULA_NAME MedleyA-PT-03-LTLFireability-08
FORMULA_NAME MedleyA-PT-03-LTLFireability-09
FORMULA_NAME MedleyA-PT-03-LTLFireability-10
FORMULA_NAME MedleyA-PT-03-LTLFireability-11
FORMULA_NAME MedleyA-PT-03-LTLFireability-12
FORMULA_NAME MedleyA-PT-03-LTLFireability-13
FORMULA_NAME MedleyA-PT-03-LTLFireability-14
FORMULA_NAME MedleyA-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717352407002

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 18:20:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:20:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:20:09] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-06-02 18:20:09] [INFO ] Transformed 108 places.
[2024-06-02 18:20:09] [INFO ] Transformed 100 transitions.
[2024-06-02 18:20:09] [INFO ] Found NUPN structural information;
[2024-06-02 18:20:09] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 98 transition count 91
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 98 transition count 91
Applied a total of 19 rules in 49 ms. Remains 98 /108 variables (removed 10) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:20:10] [INFO ] Computed 8 invariants in 9 ms
[2024-06-02 18:20:10] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-06-02 18:20:10] [INFO ] Invariant cache hit.
[2024-06-02 18:20:10] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:20:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:12] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 20 ms to minimize.
[2024-06-02 18:20:12] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:20:12] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:20:12] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:20:12] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:20:12] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:20:12] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:13] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:20:13] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:20:13] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:20:13] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
[2024-06-02 18:20:13] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:14] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/189 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:14] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 5 ms to minimize.
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 126 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6752 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/126 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/216 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:19] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 3 ms to minimize.
[2024-06-02 18:20:19] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:21] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 219 constraints, problems are : Problem set: 0 solved, 90 unsolved in 10494 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 23/23 constraints]
After SMT, in 17370ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 17404ms
Starting structural reductions in LTL mode, iteration 1 : 98/108 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18052 ms. Remains : 98/108 places, 91/100 transitions.
Support contains 30 out of 98 places after structural reductions.
[2024-06-02 18:20:28] [INFO ] Flatten gal took : 43 ms
[2024-06-02 18:20:28] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:20:28] [INFO ] Input system was already deterministic with 91 transitions.
Support contains 28 out of 98 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (640 resets) in 1208 ms. (33 steps per ms) remains 2/27 properties
BEST_FIRST walk for 40001 steps (175 resets) in 436 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (184 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
[2024-06-02 18:20:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 55/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 91/172 variables, 81/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 17/189 variables, 17/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 106 constraints, problems are : Problem set: 0 solved, 2 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 21/26 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/81 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/172 variables, 81/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/189 variables, 17/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 107 constraints, problems are : Problem set: 1 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 27956 steps, including 715 resets, run visited all 1 properties in 82 ms. (steps per millisecond=340 )
Parikh walk visited 1 properties in 94 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-03-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 98 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 97 transition count 76
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 83 transition count 76
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 28 place count 83 transition count 66
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 73 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 72 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 72 transition count 65
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 2 with 44 rules applied. Total rules applied 94 place count 50 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 49 transition count 42
Applied a total of 95 rules in 60 ms. Remains 49 /98 variables (removed 49) and now considering 42/91 (removed 49) transitions.
// Phase 1: matrix 42 rows 49 cols
[2024-06-02 18:20:30] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:20:30] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 18:20:30] [INFO ] Invariant cache hit.
[2024-06-02 18:20:30] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-06-02 18:20:30] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-06-02 18:20:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 42/90 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 57 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 42/90 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 41/97 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 1/91 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 98 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1781 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 2935ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2937ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/98 places, 42/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3232 ms. Remains : 49/98 places, 42/91 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-00
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-00 finished in 3612 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(X(p0))&&(X(p0) U p1)))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 93 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 92 transition count 85
Applied a total of 12 rules in 28 ms. Remains 92 /98 variables (removed 6) and now considering 85/91 (removed 6) transitions.
// Phase 1: matrix 85 rows 92 cols
[2024-06-02 18:20:33] [INFO ] Computed 8 invariants in 6 ms
[2024-06-02 18:20:33] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 18:20:33] [INFO ] Invariant cache hit.
[2024-06-02 18:20:34] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-02 18:20:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:20:34] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:20:35] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 103 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4115 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 84/187 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:20:39] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 188 constraints, problems are : Problem set: 0 solved, 84 unsolved in 6142 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
After SMT, in 10297ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 10301ms
Starting structural reductions in LTL mode, iteration 1 : 92/98 places, 85/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10598 ms. Remains : 92/98 places, 85/91 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-01 finished in 10768 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((G(p0)||(G(p2)&&p1)))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 97 transition count 79
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 86 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 85 transition count 78
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 24 place count 85 transition count 67
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 46 place count 74 transition count 67
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 72 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 72 transition count 65
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 88 place count 53 transition count 46
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 53 transition count 46
Applied a total of 89 rules in 22 ms. Remains 53 /98 variables (removed 45) and now considering 46/91 (removed 45) transitions.
// Phase 1: matrix 46 rows 53 cols
[2024-06-02 18:20:44] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:20:44] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 18:20:44] [INFO ] Invariant cache hit.
[2024-06-02 18:20:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:20:44] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-06-02 18:20:44] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-06-02 18:20:44] [INFO ] Invariant cache hit.
[2024-06-02 18:20:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 18:20:45] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 46/99 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 18:20:45] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 64 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1770 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 46/99 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 45/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 109 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 2/2 constraints]
After SMT, in 3173ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 3175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/98 places, 46/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3358 ms. Remains : 53/98 places, 46/91 transitions.
Stuttering acceptance computed with spot in 137 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))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-02
Product exploration explored 100000 steps with 5331 reset in 466 ms.
Product exploration explored 100000 steps with 5329 reset in 259 ms.
Computed a total of 53 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 46
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p1 p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G p1)), (F (G p2)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 35 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-03-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLFireability-02 finished in 4348 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||(p1 U G(p2)))))'
Support contains 2 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 97 transition count 76
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 83 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 81 transition count 74
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 81 transition count 64
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 52 place count 71 transition count 64
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 69 transition count 62
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 69 transition count 62
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 94 place count 50 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 49 transition count 42
Applied a total of 95 rules in 32 ms. Remains 49 /98 variables (removed 49) and now considering 42/91 (removed 49) transitions.
// Phase 1: matrix 42 rows 49 cols
[2024-06-02 18:20:48] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:20:49] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:20:49] [INFO ] Invariant cache hit.
[2024-06-02 18:20:49] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-06-02 18:20:49] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-06-02 18:20:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 42/90 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-02 18:20:49] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 1/91 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 58 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1231 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 42/90 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 41/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 1/91 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 99 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1790 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 1/1 constraints]
After SMT, in 3051ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 3053ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/98 places, 42/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3320 ms. Remains : 49/98 places, 42/91 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-03
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-03 finished in 3402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 97 transition count 75
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 82 transition count 75
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 82 transition count 65
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 72 transition count 65
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 70 transition count 63
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 70 transition count 63
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 94 place count 50 transition count 43
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 50 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 49 transition count 42
Applied a total of 96 rules in 29 ms. Remains 49 /98 variables (removed 49) and now considering 42/91 (removed 49) transitions.
// Phase 1: matrix 42 rows 49 cols
[2024-06-02 18:20:52] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:20:52] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:20:52] [INFO ] Invariant cache hit.
[2024-06-02 18:20:52] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-06-02 18:20:52] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-06-02 18:20:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 42/90 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 57 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 42/90 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 41/97 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 1/91 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 98 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 2486ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2487ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/98 places, 42/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2755 ms. Remains : 49/98 places, 42/91 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-04
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-04 finished in 2929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 97 transition count 75
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 82 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 81 transition count 74
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 32 place count 81 transition count 65
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 50 place count 72 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 70 transition count 63
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 70 transition count 63
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 94 place count 50 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 49 transition count 42
Applied a total of 95 rules in 22 ms. Remains 49 /98 variables (removed 49) and now considering 42/91 (removed 49) transitions.
// Phase 1: matrix 42 rows 49 cols
[2024-06-02 18:20:55] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:20:55] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 18:20:55] [INFO ] Invariant cache hit.
[2024-06-02 18:20:55] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-06-02 18:20:55] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-06-02 18:20:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/91 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 57 constraints, problems are : Problem set: 0 solved, 41 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/91 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 41/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 98 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1663 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 2506ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2507ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/98 places, 42/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2763 ms. Remains : 49/98 places, 42/91 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-05
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-05 finished in 2959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 93 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 92 transition count 85
Applied a total of 12 rules in 9 ms. Remains 92 /98 variables (removed 6) and now considering 85/91 (removed 6) transitions.
// Phase 1: matrix 85 rows 92 cols
[2024-06-02 18:20:58] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:20:58] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 18:20:58] [INFO ] Invariant cache hit.
[2024-06-02 18:20:58] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-02 18:20:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:20:59] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:20:59] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:21:00] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 103 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3422 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 84/187 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:21:03] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 188 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5722 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
After SMT, in 9172ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 9174ms
Starting structural reductions in LTL mode, iteration 1 : 92/98 places, 85/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9481 ms. Remains : 92/98 places, 85/91 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-07 finished in 9583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 97 transition count 74
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 81 transition count 74
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 32 place count 81 transition count 65
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 50 place count 72 transition count 65
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 70 transition count 63
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 70 transition count 63
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 92 place count 51 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 50 transition count 43
Applied a total of 93 rules in 17 ms. Remains 50 /98 variables (removed 48) and now considering 43/91 (removed 48) transitions.
// Phase 1: matrix 43 rows 50 cols
[2024-06-02 18:21:07] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:21:07] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:21:07] [INFO ] Invariant cache hit.
[2024-06-02 18:21:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:21:07] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-06-02 18:21:07] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-06-02 18:21:07] [INFO ] Invariant cache hit.
[2024-06-02 18:21:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/50 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-02 18:21:08] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 43/93 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 60 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-02 18:21:09] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 43/93 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 41/102 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/93 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 102 constraints, problems are : Problem set: 0 solved, 41 unsolved in 2183 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 2/2 constraints]
After SMT, in 3337ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 3340ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/98 places, 43/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3559 ms. Remains : 50/98 places, 43/91 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-09
Product exploration explored 100000 steps with 5077 reset in 266 ms.
Product exploration explored 100000 steps with 5028 reset in 269 ms.
Computed a total of 50 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 43
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-03-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLFireability-09 finished in 4239 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((X(G(p0))&&(p1 U p2))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 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 13 place count 97 transition count 77
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 84 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 83 transition count 76
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 28 place count 83 transition count 67
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 46 place count 74 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 73 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 73 transition count 66
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 88 place count 53 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 52 transition count 45
Applied a total of 89 rules in 14 ms. Remains 52 /98 variables (removed 46) and now considering 45/91 (removed 46) transitions.
// Phase 1: matrix 45 rows 52 cols
[2024-06-02 18:21:11] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:21:12] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:21:12] [INFO ] Invariant cache hit.
[2024-06-02 18:21:12] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-02 18:21:12] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-06-02 18:21:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-02 18:21:12] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 45/96 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 1/97 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/97 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 61 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 45/96 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 44/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-02 18:21:13] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 1/97 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 106 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2095 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 2/2 constraints]
After SMT, in 3362ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3363ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/98 places, 45/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3545 ms. Remains : 52/98 places, 45/91 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-10
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-10 finished in 3720 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(X(G(p0)))))'
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 93 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 92 transition count 85
Applied a total of 12 rules in 3 ms. Remains 92 /98 variables (removed 6) and now considering 85/91 (removed 6) transitions.
// Phase 1: matrix 85 rows 92 cols
[2024-06-02 18:21:15] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:21:15] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:21:15] [INFO ] Invariant cache hit.
[2024-06-02 18:21:15] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-02 18:21:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:21:16] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:21:17] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:21:18] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 103 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4086 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 84/187 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:21:21] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 188 constraints, problems are : Problem set: 0 solved, 84 unsolved in 6860 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
After SMT, in 10971ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 10973ms
Starting structural reductions in LTL mode, iteration 1 : 92/98 places, 85/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11272 ms. Remains : 92/98 places, 85/91 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-11 finished in 11465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 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 13 place count 97 transition count 77
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 84 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 83 transition count 76
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 28 place count 83 transition count 66
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 48 place count 73 transition count 66
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 71 transition count 64
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 71 transition count 64
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 92 place count 51 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 50 transition count 43
Applied a total of 93 rules in 22 ms. Remains 50 /98 variables (removed 48) and now considering 43/91 (removed 48) transitions.
// Phase 1: matrix 43 rows 50 cols
[2024-06-02 18:21:27] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:21:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:21:27] [INFO ] Invariant cache hit.
[2024-06-02 18:21:27] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-02 18:21:27] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-02 18:21:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 43/92 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 1/93 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 58 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1000 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 43/92 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 42/99 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/93 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 100 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1499 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 2512ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2513ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/98 places, 43/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2757 ms. Remains : 50/98 places, 43/91 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-12
Product exploration explored 100000 steps with 22227 reset in 180 ms.
Product exploration explored 100000 steps with 22189 reset in 331 ms.
Computed a total of 50 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 43
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 303 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 16 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 330 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
[2024-06-02 18:21:31] [INFO ] Invariant cache hit.
[2024-06-02 18:21:31] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:21:31] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 18:21:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:21:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 18:21:31] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 18:21:31] [INFO ] Computed and/alt/rep : 40/57/40 causal constraints (skipped 2 transitions) in 8 ms.
[2024-06-02 18:21:31] [INFO ] Added : 20 causal constraints over 4 iterations in 71 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 43/43 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-06-02 18:21:31] [INFO ] Invariant cache hit.
[2024-06-02 18:21:32] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 18:21:32] [INFO ] Invariant cache hit.
[2024-06-02 18:21:32] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-06-02 18:21:32] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-02 18:21:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 43/92 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 1/93 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 58 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 43/92 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 42/99 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/93 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 100 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1692 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 2905ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2906ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3187 ms. Remains : 50/50 places, 43/43 transitions.
Computed a total of 50 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 43
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
[2024-06-02 18:21:35] [INFO ] Invariant cache hit.
[2024-06-02 18:21:35] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:21:35] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 18:21:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:21:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:21:35] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 18:21:35] [INFO ] Computed and/alt/rep : 40/57/40 causal constraints (skipped 2 transitions) in 6 ms.
[2024-06-02 18:21:36] [INFO ] Added : 20 causal constraints over 4 iterations in 48 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22214 reset in 158 ms.
Product exploration explored 100000 steps with 22245 reset in 179 ms.
Built C files in :
/tmp/ltsmin2029508594682870183
[2024-06-02 18:21:36] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2024-06-02 18:21:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:21:36] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2024-06-02 18:21:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:21:36] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2024-06-02 18:21:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:21:36] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2029508594682870183
Running compilation step : cd /tmp/ltsmin2029508594682870183;'/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 638 ms.
Running link step : cd /tmp/ltsmin2029508594682870183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin2029508594682870183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12577290324482034644.hoa' '--buchi-type=spotba'
LTSmin run took 117 ms.
FORMULA MedleyA-PT-03-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-03-LTLFireability-12 finished in 10236 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((X((p1&&X(X(F(p2)))))&&p0)))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 94 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 93 transition count 86
Applied a total of 10 rules in 4 ms. Remains 93 /98 variables (removed 5) and now considering 86/91 (removed 5) transitions.
// Phase 1: matrix 86 rows 93 cols
[2024-06-02 18:21:37] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:21:37] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:21:37] [INFO ] Invariant cache hit.
[2024-06-02 18:21:37] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:21:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:21:38] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 3 ms to minimize.
[2024-06-02 18:21:38] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:21:38] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:21:38] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:21:38] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:21:38] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:21:39] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:21:39] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:21:39] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 2 ms to minimize.
[2024-06-02 18:21:39] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:21:39] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
[2024-06-02 18:21:39] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 10 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:21:41] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:21:44] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:21:44] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/179 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 124 constraints, problems are : Problem set: 0 solved, 85 unsolved in 8423 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:21:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:21:47] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/179 variables, 93/126 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 85/211 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:21:48] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:21:48] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 213 constraints, problems are : Problem set: 0 solved, 85 unsolved in 8750 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 27/27 constraints]
After SMT, in 17208ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 17210ms
Starting structural reductions in LTL mode, iteration 1 : 93/98 places, 86/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17480 ms. Remains : 93/98 places, 86/91 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-13
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-13 finished in 17775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(F(p2))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 94 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 93 transition count 86
Applied a total of 10 rules in 3 ms. Remains 93 /98 variables (removed 5) and now considering 86/91 (removed 5) transitions.
[2024-06-02 18:21:55] [INFO ] Invariant cache hit.
[2024-06-02 18:21:55] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 18:21:55] [INFO ] Invariant cache hit.
[2024-06-02 18:21:55] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:21:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:21:56] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:21:56] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:21:56] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:21:56] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:21:56] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:21:56] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:22:00] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:22:00] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:22:00] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:22:02] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:22:02] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/179 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 124 constraints, problems are : Problem set: 0 solved, 85 unsolved in 8723 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:22:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:22:05] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/179 variables, 93/126 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 85/211 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:22:06] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:22:06] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 213 constraints, problems are : Problem set: 0 solved, 85 unsolved in 11561 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 27/27 constraints]
After SMT, in 20316ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 20318ms
Starting structural reductions in LTL mode, iteration 1 : 93/98 places, 86/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20577 ms. Remains : 93/98 places, 86/91 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-15
Stuttering criterion allowed to conclude after 242 steps with 6 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-15 finished in 20816 ms.
All properties solved by simple procedures.
Total runtime 126549 ms.

BK_STOP 1717352536374

--------------------
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-03"
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-03, 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-171734919800020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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