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.r136-tall-171631131900084.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 Dekker-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631131900084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 11 20:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 65K May 18 16:42 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 Dekker-PT-010-LTLFireability-00
FORMULA_NAME Dekker-PT-010-LTLFireability-01
FORMULA_NAME Dekker-PT-010-LTLFireability-02
FORMULA_NAME Dekker-PT-010-LTLFireability-03
FORMULA_NAME Dekker-PT-010-LTLFireability-04
FORMULA_NAME Dekker-PT-010-LTLFireability-05
FORMULA_NAME Dekker-PT-010-LTLFireability-06
FORMULA_NAME Dekker-PT-010-LTLFireability-07
FORMULA_NAME Dekker-PT-010-LTLFireability-08
FORMULA_NAME Dekker-PT-010-LTLFireability-09
FORMULA_NAME Dekker-PT-010-LTLFireability-10
FORMULA_NAME Dekker-PT-010-LTLFireability-11
FORMULA_NAME Dekker-PT-010-LTLFireability-12
FORMULA_NAME Dekker-PT-010-LTLFireability-13
FORMULA_NAME Dekker-PT-010-LTLFireability-14
FORMULA_NAME Dekker-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716335819024

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 23:57:00] [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-05-21 23:57:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:57:00] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-21 23:57:00] [INFO ] Transformed 50 places.
[2024-05-21 23:57:00] [INFO ] Transformed 120 transitions.
[2024-05-21 23:57:00] [INFO ] Found NUPN structural information;
[2024-05-21 23:57:00] [INFO ] Parsed PT model containing 50 places and 120 transitions and 820 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Dekker-PT-010-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-010-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-010-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 120/120 transitions.
Applied a total of 0 rules in 10 ms. Remains 50 /50 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:00] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
// Phase 1: matrix 40 rows 50 cols
[2024-05-21 23:57:00] [INFO ] Computed 30 invariants in 5 ms
[2024-05-21 23:57:00] [INFO ] Implicit Places using invariants in 157 ms returned [20, 23, 26, 29, 32, 35, 38, 41, 44, 47]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 190 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/50 places, 120/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 217 ms. Remains : 40/50 places, 120/120 transitions.
Support contains 36 out of 40 places after structural reductions.
[2024-05-21 23:57:00] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:57:00] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:57:00] [INFO ] Input system was already deterministic with 120 transitions.
Reduction of identical properties reduced properties to check from 29 to 25
RANDOM walk for 40000 steps (8 resets) in 1529 ms. (26 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
[2024-05-21 23:57:01] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
// Phase 1: matrix 40 rows 40 cols
[2024-05-21 23:57:01] [INFO ] Computed 20 invariants in 6 ms
[2024-05-21 23:57:01] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 13/80 variables, and 15 constraints, problems are : Problem set: 1 solved, 0 unsolved in 35 ms.
Refiners :[Domain max(s): 13/40 constraints, Positive P Invariants (semi-flows): 2/20 constraints, State Equation: 0/40 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Dekker-PT-010-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 12 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:02] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:02] [INFO ] Invariant cache hit.
[2024-05-21 23:57:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 23:57:02] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:02] [INFO ] Invariant cache hit.
[2024-05-21 23:57:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:02] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-21 23:57:02] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:02] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:02] [INFO ] Invariant cache hit.
[2024-05-21 23:57:02] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 6 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 2 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 12 ms to minimize.
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
[2024-05-21 23:57:03] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1969 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1298 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 3316ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3320ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3489 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Dekker-PT-010-LTLFireability-01
Product exploration explored 100000 steps with 1 reset in 392 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Dekker-PT-010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-01 finished in 4189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:06] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:06] [INFO ] Invariant cache hit.
[2024-05-21 23:57:06] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 23:57:06] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:06] [INFO ] Invariant cache hit.
[2024-05-21 23:57:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:06] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:06] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:06] [INFO ] Invariant cache hit.
[2024-05-21 23:57:06] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 4 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1801 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1191 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 3033ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3035ms
Finished structural reductions in LTL mode , in 1 iterations and 3153 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-010-LTLFireability-02
Product exploration explored 100000 steps with 4722 reset in 245 ms.
Stack based approach found an accepted trace after 22 steps with 2 reset with depth 12 and stack size 12 in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-02 finished in 3537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(F(p1)))))'
Support contains 12 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 12 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:09] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:09] [INFO ] Invariant cache hit.
[2024-05-21 23:57:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 23:57:09] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:09] [INFO ] Invariant cache hit.
[2024-05-21 23:57:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:09] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-21 23:57:09] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:09] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:09] [INFO ] Invariant cache hit.
[2024-05-21 23:57:09] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1779 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1211 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 3024ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3026ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3153 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Dekker-PT-010-LTLFireability-03
Product exploration explored 100000 steps with 3815 reset in 220 ms.
Product exploration explored 100000 steps with 3748 reset in 237 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 3971 steps (1 resets) in 24 ms. (158 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 12 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 9 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:13] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:13] [INFO ] Invariant cache hit.
[2024-05-21 23:57:14] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 23:57:14] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:14] [INFO ] Invariant cache hit.
[2024-05-21 23:57:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:14] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-21 23:57:14] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:14] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:14] [INFO ] Invariant cache hit.
[2024-05-21 23:57:14] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1843 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1194 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 3088ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3090ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3211 ms. Remains : 40/40 places, 120/120 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 6486 steps (1 resets) in 52 ms. (122 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3837 reset in 219 ms.
Product exploration explored 100000 steps with 3861 reset in 227 ms.
Built C files in :
/tmp/ltsmin801270073929950210
[2024-05-21 23:57:18] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2024-05-21 23:57:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:57:18] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2024-05-21 23:57:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:57:18] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2024-05-21 23:57:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:57:18] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin801270073929950210
Running compilation step : cd /tmp/ltsmin801270073929950210;'/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 418 ms.
Running link step : cd /tmp/ltsmin801270073929950210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin801270073929950210;'/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/stateBased5455273411998612655.hoa' '--buchi-type=spotba'
LTSmin run took 4523 ms.
FORMULA Dekker-PT-010-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Dekker-PT-010-LTLFireability-03 finished in 13727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:23] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:23] [INFO ] Invariant cache hit.
[2024-05-21 23:57:23] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 23:57:23] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:23] [INFO ] Invariant cache hit.
[2024-05-21 23:57:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:23] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:23] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:23] [INFO ] Invariant cache hit.
[2024-05-21 23:57:23] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:24] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2115 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1228 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 3370ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3372ms
Finished structural reductions in LTL mode , in 1 iterations and 3527 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-010-LTLFireability-05
Product exploration explored 100000 steps with 4732 reset in 232 ms.
Stack based approach found an accepted trace after 47 steps with 2 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-05 finished in 3872 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 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 9 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:27] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:27] [INFO ] Invariant cache hit.
[2024-05-21 23:57:27] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 23:57:27] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:27] [INFO ] Invariant cache hit.
[2024-05-21 23:57:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:27] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-21 23:57:27] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:27] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:27] [INFO ] Invariant cache hit.
[2024-05-21 23:57:27] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:57:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1818 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1224 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 3068ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3069ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3187 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Dekker-PT-010-LTLFireability-08
Product exploration explored 100000 steps with 288 reset in 228 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 42 in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-08 finished in 3542 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 10 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:30] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:30] [INFO ] Invariant cache hit.
[2024-05-21 23:57:30] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 23:57:30] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:30] [INFO ] Invariant cache hit.
[2024-05-21 23:57:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:30] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:30] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:30] [INFO ] Invariant cache hit.
[2024-05-21 23:57:30] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1750 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1212 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 2998ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 2999ms
Finished structural reductions in LTL mode , in 1 iterations and 3103 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0]
Running random walk in product with property : Dekker-PT-010-LTLFireability-09
Entered a terminal (fully accepting) state of product in 240 steps with 0 reset in 2 ms.
FORMULA Dekker-PT-010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-010-LTLFireability-09 finished in 3205 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(X(G(p0)))||F(p1)))))'
Support contains 10 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:34] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:34] [INFO ] Invariant cache hit.
[2024-05-21 23:57:34] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 23:57:34] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:34] [INFO ] Invariant cache hit.
[2024-05-21 23:57:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:34] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:34] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:34] [INFO ] Invariant cache hit.
[2024-05-21 23:57:34] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:34] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:57:35] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:57:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1784 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1195 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 3019ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3020ms
Finished structural reductions in LTL mode , in 1 iterations and 3108 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-010-LTLFireability-10
Product exploration explored 100000 steps with 4686 reset in 218 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Dekker-PT-010-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-10 finished in 3577 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||G(p1)))||X(X(G((p1||F(p2)))))))'
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:37] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:37] [INFO ] Invariant cache hit.
[2024-05-21 23:57:37] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 23:57:37] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:37] [INFO ] Invariant cache hit.
[2024-05-21 23:57:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:37] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:37] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:37] [INFO ] Invariant cache hit.
[2024-05-21 23:57:37] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:37] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:57:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1759 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1227 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 3013ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3014ms
Finished structural reductions in LTL mode , in 1 iterations and 3117 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Dekker-PT-010-LTLFireability-11
Product exploration explored 100000 steps with 4383 reset in 226 ms.
Stack based approach found an accepted trace after 29 steps with 1 reset with depth 7 and stack size 7 in 1 ms.
FORMULA Dekker-PT-010-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-11 finished in 3602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((G((p2||X(p3)))||p1))&&p0))))'
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:41] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:41] [INFO ] Invariant cache hit.
[2024-05-21 23:57:41] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 23:57:41] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:41] [INFO ] Invariant cache hit.
[2024-05-21 23:57:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:41] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:41] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:41] [INFO ] Invariant cache hit.
[2024-05-21 23:57:41] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:57:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1777 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1184 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 2988ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 2989ms
Finished structural reductions in LTL mode , in 1 iterations and 3079 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : Dekker-PT-010-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-010-LTLFireability-12 finished in 3303 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(((p1 U G(p2))&&p0))))'
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 11 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:44] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:44] [INFO ] Invariant cache hit.
[2024-05-21 23:57:44] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 23:57:44] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:44] [INFO ] Invariant cache hit.
[2024-05-21 23:57:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:44] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-21 23:57:44] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:44] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:44] [INFO ] Invariant cache hit.
[2024-05-21 23:57:44] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 2 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:57:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1723 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1213 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 2966ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 2967ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3089 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : Dekker-PT-010-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 271 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA Dekker-PT-010-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-13 finished in 3532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 10 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:48] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:48] [INFO ] Invariant cache hit.
[2024-05-21 23:57:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 23:57:48] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:48] [INFO ] Invariant cache hit.
[2024-05-21 23:57:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:48] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-21 23:57:48] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:48] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:48] [INFO ] Invariant cache hit.
[2024-05-21 23:57:48] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1779 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1218 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 3028ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3031ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3145 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Dekker-PT-010-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 239 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-14 finished in 3540 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 X(p1))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 120/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:57:51] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:51] [INFO ] Invariant cache hit.
[2024-05-21 23:57:51] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 23:57:51] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:51] [INFO ] Invariant cache hit.
[2024-05-21 23:57:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:57:51] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:57:51] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:57:51] [INFO ] Invariant cache hit.
[2024-05-21 23:57:51] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:51] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:51] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2024-05-21 23:57:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:57:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:52] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1698 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1201 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 2928ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 2930ms
Finished structural reductions in LTL mode , in 1 iterations and 3031 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Dekker-PT-010-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-010-LTLFireability-15 finished in 3220 ms.
All properties solved by simple procedures.
Total runtime 54690 ms.

BK_STOP 1716335874902

--------------------
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="Dekker-PT-010"
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 Dekker-PT-010, 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 r136-tall-171631131900084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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