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.r135-tall-171631130300084.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 greatspnxred
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 r135-tall-171631130300084
=====================================================================

--------------------
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 1716333876121

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 23:24:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 23:24:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:24:37] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-21 23:24:37] [INFO ] Transformed 50 places.
[2024-05-21 23:24:37] [INFO ] Transformed 120 transitions.
[2024-05-21 23:24:37] [INFO ] Found NUPN structural information;
[2024-05-21 23:24:37] [INFO ] Parsed PT model containing 50 places and 120 transitions and 820 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
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 11 ms. Remains 50 /50 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:24:37] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
// Phase 1: matrix 40 rows 50 cols
[2024-05-21 23:24:37] [INFO ] Computed 30 invariants in 10 ms
[2024-05-21 23:24:37] [INFO ] Implicit Places using invariants in 193 ms returned [20, 23, 26, 29, 32, 35, 38, 41, 44, 47]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 227 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 3 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 258 ms. Remains : 40/50 places, 120/120 transitions.
Support contains 36 out of 40 places after structural reductions.
[2024-05-21 23:24:38] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:24:38] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:24:38] [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 1568 ms. (25 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 1/1 properties
[2024-05-21 23:24:38] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
// Phase 1: matrix 40 rows 40 cols
[2024-05-21 23:24:38] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 23:24:38] [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 56 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 82ms 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 11 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:24:39] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:39] [INFO ] Invariant cache hit.
[2024-05-21 23:24:39] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 23:24:39] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:39] [INFO ] Invariant cache hit.
[2024-05-21 23:24:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:24:39] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-21 23:24:39] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:24:39] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:39] [INFO ] Invariant cache hit.
[2024-05-21 23:24:39] [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:24:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 5 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 17 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:24:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 4 places in 16 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 1955 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 1297 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 3301ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3303ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3462 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 230 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 393 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA Dekker-PT-010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-01 finished in 4145 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 1 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:24:43] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:43] [INFO ] Invariant cache hit.
[2024-05-21 23:24:43] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 23:24:43] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:43] [INFO ] Invariant cache hit.
[2024-05-21 23:24:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:24:43] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:24:43] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:43] [INFO ] Invariant cache hit.
[2024-05-21 23:24:43] [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:24:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 3 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:44] [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:24:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 4 places in 21 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 1845 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 1236 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 3122ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3123ms
Finished structural reductions in LTL mode , in 1 iterations and 3236 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 124 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 4704 reset in 254 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-02 finished in 3631 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 13 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:24:47] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:47] [INFO ] Invariant cache hit.
[2024-05-21 23:24:47] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 23:24:47] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:47] [INFO ] Invariant cache hit.
[2024-05-21 23:24:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:24:47] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-21 23:24:47] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:24:47] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:47] [INFO ] Invariant cache hit.
[2024-05-21 23:24:47] [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:24:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 3 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 4 places in 22 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:24:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:48] [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 1762 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 1311 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 3107ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3109ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3237 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 84 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 3861 reset in 224 ms.
Product exploration explored 100000 steps with 3803 reset in 252 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 115 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 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 3598 steps (0 resets) in 37 ms. (94 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 135 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)]
Stuttering acceptance computed with spot in 82 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 6 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:24:51] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:51] [INFO ] Invariant cache hit.
[2024-05-21 23:24:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 23:24:51] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:51] [INFO ] Invariant cache hit.
[2024-05-21 23:24:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:24:51] [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.
[2024-05-21 23:24:51] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:24:51] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:51] [INFO ] Invariant cache hit.
[2024-05-21 23:24: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:24:51] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 18 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:24:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:24:52] [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 1834 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 1215 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 3085ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3086ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3197 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 138 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 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 4470 steps (0 resets) in 49 ms. (89 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 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 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3806 reset in 225 ms.
Product exploration explored 100000 steps with 3846 reset in 233 ms.
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 5 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:24:55] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:55] [INFO ] Invariant cache hit.
[2024-05-21 23:24:55] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 23:24:55] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:55] [INFO ] Invariant cache hit.
[2024-05-21 23:24:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:24:55] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-21 23:24:55] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:24:55] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:55] [INFO ] Invariant cache hit.
[2024-05-21 23:24:55] [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:24:56] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [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:24:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 4 places in 14 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 1730 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 1243 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 3000ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3001ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3115 ms. Remains : 40/40 places, 120/120 transitions.
Treatment of property Dekker-PT-010-LTLFireability-03 finished in 11831 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 2 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:24:59] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:59] [INFO ] Invariant cache hit.
[2024-05-21 23:24:59] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 23:24:59] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:59] [INFO ] Invariant cache hit.
[2024-05-21 23:24:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:24:59] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:24:59] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:24:59] [INFO ] Invariant cache hit.
[2024-05-21 23:24:59] [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:24:59] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:59] [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:24:59] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 4 places in 14 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 1785 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 1246 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 3060ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3063ms
Finished structural reductions in LTL mode , in 1 iterations and 3167 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-010-LTLFireability-05
Product exploration explored 100000 steps with 4760 reset in 223 ms.
Stack based approach found an accepted trace after 18 steps with 1 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-05 finished in 3475 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 13 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:25:02] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:02] [INFO ] Invariant cache hit.
[2024-05-21 23:25:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 23:25:02] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:02] [INFO ] Invariant cache hit.
[2024-05-21 23:25:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:25:02] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-21 23:25:02] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:25:02] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:02] [INFO ] Invariant cache hit.
[2024-05-21 23:25: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:25:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [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:25:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25: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 1822 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 1187 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 3048ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3049ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3164 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 106 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 25 reset in 233 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-08 finished in 3524 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:25:06] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:06] [INFO ] Invariant cache hit.
[2024-05-21 23:25:06] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 23:25:06] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:06] [INFO ] Invariant cache hit.
[2024-05-21 23:25:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:25:06] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:25:06] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:06] [INFO ] Invariant cache hit.
[2024-05-21 23:25: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:25:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [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:25:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 4 places in 16 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 1766 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 1226 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 3021ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3023ms
Finished structural reductions in LTL mode , in 1 iterations and 3136 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 80 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 506 steps with 0 reset in 3 ms.
FORMULA Dekker-PT-010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-010-LTLFireability-09 finished in 3233 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:25:09] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:09] [INFO ] Invariant cache hit.
[2024-05-21 23:25:09] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 23:25:09] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:09] [INFO ] Invariant cache hit.
[2024-05-21 23:25:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:25:09] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:25:09] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:09] [INFO ] Invariant cache hit.
[2024-05-21 23:25: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:25:09] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:10] [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:25:10] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 4 places in 16 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 1707 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 1206 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 2943ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 2944ms
Finished structural reductions in LTL mode , in 1 iterations and 3036 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 196 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 4836 reset in 221 ms.
Stack based approach found an accepted trace after 78 steps with 6 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-10 finished in 3471 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 2 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:25:12] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:12] [INFO ] Invariant cache hit.
[2024-05-21 23:25:12] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 23:25:12] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:12] [INFO ] Invariant cache hit.
[2024-05-21 23:25:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:25:12] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:25:12] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:12] [INFO ] Invariant cache hit.
[2024-05-21 23:25:12] [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:25:13] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 2 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [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:25:13] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [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 1679 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 1214 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 2921ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 2923ms
Finished structural reductions in LTL mode , in 1 iterations and 3019 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 225 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 4449 reset in 242 ms.
Stack based approach found an accepted trace after 26 steps with 1 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-11 finished in 3512 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 1 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:25:16] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:16] [INFO ] Invariant cache hit.
[2024-05-21 23:25:16] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 23:25:16] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:16] [INFO ] Invariant cache hit.
[2024-05-21 23:25:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:25:16] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:25:16] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:16] [INFO ] Invariant cache hit.
[2024-05-21 23:25:16] [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:25:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 4 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 2 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 4 places in 18 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:25:17] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [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 1776 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 1280 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 3092ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3093ms
Finished structural reductions in LTL mode , in 1 iterations and 3188 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 182 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 1 ms.
FORMULA Dekker-PT-010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-010-LTLFireability-12 finished in 3392 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 9 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:25:19] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:19] [INFO ] Invariant cache hit.
[2024-05-21 23:25:19] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 23:25:19] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:19] [INFO ] Invariant cache hit.
[2024-05-21 23:25:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:25:19] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-21 23:25:19] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:25:19] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:19] [INFO ] Invariant cache hit.
[2024-05-21 23:25:19] [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:25:19] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 26 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:25:20] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 4 places in 16 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 1821 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 1236 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 3086ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3097ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3214 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 170 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 282 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-13 finished in 3684 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 5 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:25:23] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:23] [INFO ] Invariant cache hit.
[2024-05-21 23:25:23] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 23:25:23] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:23] [INFO ] Invariant cache hit.
[2024-05-21 23:25:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:25:23] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-21 23:25:23] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 23:25:23] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:23] [INFO ] Invariant cache hit.
[2024-05-21 23:25: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:25:23] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [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:25:24] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [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 1764 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 3008ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3010ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3126 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 95 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 248 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Dekker-PT-010-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-010-LTLFireability-14 finished in 3487 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 1 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 23:25:26] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:26] [INFO ] Invariant cache hit.
[2024-05-21 23:25:26] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 23:25:26] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:26] [INFO ] Invariant cache hit.
[2024-05-21 23:25:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 23:25:26] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 23:25:26] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-21 23:25:26] [INFO ] Invariant cache hit.
[2024-05-21 23:25:26] [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:25:27] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:25:27] [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:25:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 4 places in 16 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 1753 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 1168 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 2948ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 2949ms
Finished structural reductions in LTL mode , in 1 iterations and 3049 ms. Remains : 40/40 places, 120/120 transitions.
Stuttering acceptance computed with spot in 147 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 3224 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)))))'
[2024-05-21 23:25:30] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:25:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-21 23:25:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 120 transitions and 710 arcs took 4 ms.
Total runtime 52950 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Dekker-PT-010

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 40
TRANSITIONS: 120
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2094
MODEL NAME: /home/mcc/execution/411/model
40 places, 120 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Dekker-PT-010-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716333934495

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="greatspnxred"
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 greatspnxred"
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 r135-tall-171631130300084"
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 ;