fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r180-tall-171640603700548
Last Updated
July 7, 2024

About the Execution of ITS-Tools for GPUForwardProgress-PT-24a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1632.928 232529.00 352364.00 761.40 FFTFFFFTTFFFTFFF normal

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.r180-tall-171640603700548.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is GPUForwardProgress-PT-24a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603700548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 23:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 11 23:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 23:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 23:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 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 38K 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 GPUForwardProgress-PT-24a-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716510308187

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-24a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 00:25:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 00:25:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 00:25:09] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-24 00:25:09] [INFO ] Transformed 104 places.
[2024-05-24 00:25:09] [INFO ] Transformed 129 transitions.
[2024-05-24 00:25:09] [INFO ] Found NUPN structural information;
[2024-05-24 00:25:09] [INFO ] Parsed PT model containing 104 places and 129 transitions and 501 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 20 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2024-05-24 00:25:09] [INFO ] Computed 25 invariants in 16 ms
[2024-05-24 00:25:09] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-24 00:25:09] [INFO ] Invariant cache hit.
[2024-05-24 00:25:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:25:10] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 00:25:10] [INFO ] Invariant cache hit.
[2024-05-24 00:25:10] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7193 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6086 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 13411ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 13423ms
Starting structural reductions in LTL mode, iteration 1 : 103/104 places, 103/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13863 ms. Remains : 103/104 places, 103/103 transitions.
Support contains 27 out of 103 places after structural reductions.
[2024-05-24 00:25:23] [INFO ] Flatten gal took : 31 ms
[2024-05-24 00:25:23] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:25:23] [INFO ] Input system was already deterministic with 103 transitions.
Support contains 26 out of 103 places (down from 27) after GAL structural reductions.
RANDOM walk for 2579 steps (7 resets) in 137 ms. (18 steps per ms) remains 0/23 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.4 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)))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 23 Pre rules applied. Total rules applied 1 place count 77 transition count 78
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 47 place count 54 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 49 place count 53 transition count 77
Applied a total of 49 rules in 22 ms. Remains 53 /103 variables (removed 50) and now considering 77/103 (removed 26) transitions.
// Phase 1: matrix 77 rows 53 cols
[2024-05-24 00:25:24] [INFO ] Computed 1 invariants in 2 ms
[2024-05-24 00:25:24] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 00:25:24] [INFO ] Invariant cache hit.
[2024-05-24 00:25:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:25:24] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-24 00:25:24] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-24 00:25:24] [INFO ] Invariant cache hit.
[2024-05-24 00:25:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 76/105 variables, 29/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 24/129 variables, 24/83 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 24/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 108 constraints, problems are : Problem set: 0 solved, 53 unsolved in 795 ms.
Refiners :[Domain max(s): 53/53 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 76/105 variables, 29/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 24/129 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 24/112 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 48/160 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/130 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/130 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 161 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1202 ms.
Refiners :[Domain max(s): 53/53 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 2030ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2031ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/103 places, 77/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2167 ms. Remains : 53/103 places, 77/103 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-00 finished in 2365 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)) U p1))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2024-05-24 00:25:26] [INFO ] Computed 25 invariants in 1 ms
[2024-05-24 00:25:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 00:25:26] [INFO ] Invariant cache hit.
[2024-05-24 00:25:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:25:26] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 00:25:26] [INFO ] Invariant cache hit.
[2024-05-24 00:25:26] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6910 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6007 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 12975ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 12978ms
Finished structural reductions in LTL mode , in 1 iterations and 13145 ms. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-01 finished in 13314 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)||G(F(p1)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 23 Pre rules applied. Total rules applied 1 place count 78 transition count 79
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 47 place count 55 transition count 79
Applied a total of 47 rules in 11 ms. Remains 55 /103 variables (removed 48) and now considering 79/103 (removed 24) transitions.
// Phase 1: matrix 79 rows 55 cols
[2024-05-24 00:25:39] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 00:25:39] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 00:25:39] [INFO ] Invariant cache hit.
[2024-05-24 00:25:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:25:39] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-24 00:25:39] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-24 00:25:39] [INFO ] Invariant cache hit.
[2024-05-24 00:25:39] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 78/132 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 136 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3772 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 78/132 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 78/211 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 214 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3169 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 7002ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7003ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/103 places, 79/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7111 ms. Remains : 55/103 places, 79/103 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-02
Product exploration explored 100000 steps with 12338 reset in 538 ms.
Product exploration explored 100000 steps with 12519 reset in 339 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 138 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1632 steps (4 resets) in 19 ms. (81 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 331 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 79/79 transitions.
Applied a total of 0 rules in 6 ms. Remains 55 /55 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-05-24 00:25:48] [INFO ] Invariant cache hit.
[2024-05-24 00:25:48] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-24 00:25:48] [INFO ] Invariant cache hit.
[2024-05-24 00:25:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:25:48] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-24 00:25:48] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-24 00:25:48] [INFO ] Invariant cache hit.
[2024-05-24 00:25:48] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 78/132 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 136 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3790 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 78/132 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 78/211 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 214 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3068 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 6904ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 6906ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7012 ms. Remains : 55/55 places, 79/79 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 120 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 908 steps (1 resets) in 19 ms. (45 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 12512 reset in 258 ms.
Product exploration explored 100000 steps with 12597 reset in 300 ms.
Built C files in :
/tmp/ltsmin11661549797586428405
[2024-05-24 00:25:56] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2024-05-24 00:25:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:25:56] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2024-05-24 00:25:56] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:25:56] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2024-05-24 00:25:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:25:56] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11661549797586428405
Running compilation step : cd /tmp/ltsmin11661549797586428405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 316 ms.
Running link step : cd /tmp/ltsmin11661549797586428405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11661549797586428405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5292943129024594379.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 79/79 transitions.
Applied a total of 0 rules in 10 ms. Remains 55 /55 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-05-24 00:26:11] [INFO ] Invariant cache hit.
[2024-05-24 00:26:11] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 00:26:11] [INFO ] Invariant cache hit.
[2024-05-24 00:26:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:26:12] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-24 00:26:12] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-24 00:26:12] [INFO ] Invariant cache hit.
[2024-05-24 00:26:12] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 78/132 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 136 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3727 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 78/132 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 78/211 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 214 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3125 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 6911ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 6912ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7017 ms. Remains : 55/55 places, 79/79 transitions.
Built C files in :
/tmp/ltsmin3423433399380348131
[2024-05-24 00:26:18] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2024-05-24 00:26:18] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:26:18] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2024-05-24 00:26:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:26:18] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2024-05-24 00:26:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:26:18] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3423433399380348131
Running compilation step : cd /tmp/ltsmin3423433399380348131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 208 ms.
Running link step : cd /tmp/ltsmin3423433399380348131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3423433399380348131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7789652458903030052.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 00:26:34] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:26:34] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:26:34] [INFO ] Time to serialize gal into /tmp/LTL10798037439316278039.gal : 8 ms
[2024-05-24 00:26:34] [INFO ] Time to serialize properties into /tmp/LTL4070566212495366170.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10798037439316278039.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4977877824953966815.hoa' '-atoms' '/tmp/LTL4070566212495366170.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4070566212495366170.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4977877824953966815.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t54, t71, t52.t66, t50.t67, t48.t65, t46.t68, t44.t64, t42.t69, t40.t63, t38.t70,...387
Computing Next relation with stutter on 1.67772e+07 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
84 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.869353,33300,1,0,243,142327,197,112,2494,66162,376
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-02 finished in 55383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 1 place count 78 transition count 78
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 49 place count 54 transition count 78
Applied a total of 49 rules in 12 ms. Remains 54 /103 variables (removed 49) and now considering 78/103 (removed 25) transitions.
// Phase 1: matrix 78 rows 54 cols
[2024-05-24 00:26:35] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 00:26:35] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 00:26:35] [INFO ] Invariant cache hit.
[2024-05-24 00:26:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:26:35] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-24 00:26:35] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-24 00:26:35] [INFO ] Invariant cache hit.
[2024-05-24 00:26:35] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 77/130 variables, 53/107 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 24/131 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/132 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 134 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2647 ms.
Refiners :[Domain max(s): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 77/130 variables, 53/107 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 24/131 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 77/208 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/131 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 1/132 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 211 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2967 ms.
Refiners :[Domain max(s): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 5664ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 5665ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/103 places, 78/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5782 ms. Remains : 54/103 places, 78/103 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-03
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-03 finished in 5863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 23 Pre rules applied. Total rules applied 1 place count 78 transition count 79
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 47 place count 55 transition count 79
Applied a total of 47 rules in 14 ms. Remains 55 /103 variables (removed 48) and now considering 79/103 (removed 24) transitions.
// Phase 1: matrix 79 rows 55 cols
[2024-05-24 00:26:41] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 00:26:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 00:26:41] [INFO ] Invariant cache hit.
[2024-05-24 00:26:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:26:41] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-24 00:26:41] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-24 00:26:41] [INFO ] Invariant cache hit.
[2024-05-24 00:26:41] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 78/132 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 136 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4557 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 78/132 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 78/211 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 214 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2934 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 7540ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7541ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/103 places, 79/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7647 ms. Remains : 55/103 places, 79/103 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-04 finished in 7721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X((p2||X(p3))))))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2024-05-24 00:26:48] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 00:26:48] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 00:26:48] [INFO ] Invariant cache hit.
[2024-05-24 00:26:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:26:48] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 00:26:48] [INFO ] Invariant cache hit.
[2024-05-24 00:26:48] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6816 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5994 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 12859ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 12860ms
Finished structural reductions in LTL mode , in 1 iterations and 13026 ms. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 286 ms :[true, (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-07
Product exploration explored 100000 steps with 25267 reset in 232 ms.
Product exploration explored 100000 steps with 25261 reset in 239 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 7 factoid took 160 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
RANDOM walk for 996 steps (2 resets) in 15 ms. (62 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (F p2), (F (NOT p3))]
Knowledge based reduction with 7 factoid took 204 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
Support contains 4 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-24 00:27:03] [INFO ] Invariant cache hit.
[2024-05-24 00:27:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-24 00:27:03] [INFO ] Invariant cache hit.
[2024-05-24 00:27:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:27:03] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 00:27:03] [INFO ] Invariant cache hit.
[2024-05-24 00:27:03] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6944 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6108 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 13101ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 13103ms
Finished structural reductions in LTL mode , in 1 iterations and 13278 ms. Remains : 103/103 places, 103/103 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p3)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
RANDOM walk for 2701 steps (4 resets) in 22 ms. (117 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) p3)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2), (F (NOT p3))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
Product exploration explored 100000 steps with 25251 reset in 284 ms.
Product exploration explored 100000 steps with 25257 reset in 236 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 1 place count 78 transition count 124
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 78 transition count 124
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 23 rules in 8 ms. Remains 78 /103 variables (removed 25) and now considering 124/103 (removed -21) transitions.
[2024-05-24 00:27:18] [INFO ] Redundant transitions in 2 ms returned []
Running 123 sub problems to find dead transitions.
// Phase 1: matrix 124 rows 78 cols
[2024-05-24 00:27:18] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 00:27:18] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 3 (OVERLAPS) 123/200 variables, 77/155 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 46/201 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/201 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/201 variables, 1/202 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/203 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/203 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/202 variables, 1/204 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/204 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/204 constraints. Problems are: Problem set: 44 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 204 constraints, problems are : Problem set: 44 solved, 79 unsolved in 3029 ms.
Refiners :[Domain max(s): 78/78 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 44 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 1/56 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/56 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 123/178 variables, 55/111 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 46/157 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 79/236 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/236 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 23/201 variables, 23/259 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 23/282 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/282 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 1/202 variables, 1/283 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/283 constraints. Problems are: Problem set: 44 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/283 constraints. Problems are: Problem set: 44 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 283 constraints, problems are : Problem set: 44 solved, 79 unsolved in 3459 ms.
Refiners :[Domain max(s): 78/78 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 79/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 6586ms problems are : Problem set: 44 solved, 79 unsolved
Search for dead transitions found 44 dead transitions in 6588ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/103 places, 80/103 transitions.
Graph (complete) has 232 edges and 78 vertex of which 56 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 56 /78 variables (removed 22) and now considering 80/80 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/103 places, 80/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6611 ms. Remains : 56/103 places, 80/103 transitions.
Built C files in :
/tmp/ltsmin5501150129733639382
[2024-05-24 00:27:25] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5501150129733639382
Running compilation step : cd /tmp/ltsmin5501150129733639382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 235 ms.
Running link step : cd /tmp/ltsmin5501150129733639382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5501150129733639382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1700404707300764469.hoa' '--buchi-type=spotba'
LTSmin run took 629 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-07 finished in 37426 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 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2024-05-24 00:27:26] [INFO ] Computed 25 invariants in 1 ms
[2024-05-24 00:27:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 00:27:26] [INFO ] Invariant cache hit.
[2024-05-24 00:27:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:27:26] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 00:27:26] [INFO ] Invariant cache hit.
[2024-05-24 00:27:26] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6976 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6032 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 13061ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 13063ms
Finished structural reductions in LTL mode , in 1 iterations and 13239 ms. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-24a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-08 finished in 13733 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((F(p0)&&(p1||X(G((F(p3)||p2))))))))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-24 00:27:39] [INFO ] Invariant cache hit.
[2024-05-24 00:27:39] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 00:27:39] [INFO ] Invariant cache hit.
[2024-05-24 00:27:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:27:40] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 00:27:40] [INFO ] Invariant cache hit.
[2024-05-24 00:27:40] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6938 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6102 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 13089ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 13090ms
Finished structural reductions in LTL mode , in 1 iterations and 13249 ms. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-09 finished in 13682 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((G(p0)&&X(p1)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-24 00:27:53] [INFO ] Invariant cache hit.
[2024-05-24 00:27:53] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 00:27:53] [INFO ] Invariant cache hit.
[2024-05-24 00:27:53] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:27:53] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 00:27:53] [INFO ] Invariant cache hit.
[2024-05-24 00:27:53] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6880 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5871 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 12809ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 12810ms
Finished structural reductions in LTL mode , in 1 iterations and 12984 ms. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-10
Product exploration explored 100000 steps with 774 reset in 219 ms.
Stack based approach found an accepted trace after 253 steps with 4 reset with depth 242 and stack size 174 in 0 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-10 finished in 13369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((p0||X(p1))))||F(p1))))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-24 00:28:06] [INFO ] Invariant cache hit.
[2024-05-24 00:28:07] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-24 00:28:07] [INFO ] Invariant cache hit.
[2024-05-24 00:28:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:28:07] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 00:28:07] [INFO ] Invariant cache hit.
[2024-05-24 00:28:07] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6820 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6039 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 12911ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 12912ms
Finished structural reductions in LTL mode , in 1 iterations and 13093 ms. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 243 ms.
Product exploration explored 100000 steps with 33333 reset in 254 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-24a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-12 finished in 13784 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 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-24 00:28:20] [INFO ] Invariant cache hit.
[2024-05-24 00:28:20] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-24 00:28:20] [INFO ] Invariant cache hit.
[2024-05-24 00:28:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:28:20] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 00:28:20] [INFO ] Invariant cache hit.
[2024-05-24 00:28:20] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6817 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6064 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 12927ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 12930ms
Finished structural reductions in LTL mode , in 1 iterations and 13116 ms. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-13 finished in 13197 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(G(p0))&&F(p1))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-24 00:28:33] [INFO ] Invariant cache hit.
[2024-05-24 00:28:34] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-24 00:28:34] [INFO ] Invariant cache hit.
[2024-05-24 00:28:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:28:34] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 00:28:34] [INFO ] Invariant cache hit.
[2024-05-24 00:28:34] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6911 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5969 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 12925ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 12927ms
Finished structural reductions in LTL mode , in 1 iterations and 13099 ms. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-14
Product exploration explored 100000 steps with 201 reset in 230 ms.
Stack based approach found an accepted trace after 137 steps with 0 reset with depth 138 and stack size 93 in 0 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-14 finished in 13496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-24 00:28:47] [INFO ] Invariant cache hit.
[2024-05-24 00:28:47] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-24 00:28:47] [INFO ] Invariant cache hit.
[2024-05-24 00:28:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 00:28:47] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 00:28:47] [INFO ] Invariant cache hit.
[2024-05-24 00:28:47] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 256 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6843 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/204 variables, 102/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 102/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 358 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5991 ms.
Refiners :[Domain max(s): 103/103 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 12882ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 12884ms
Finished structural reductions in LTL mode , in 1 iterations and 13065 ms. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-15 finished in 13220 ms.
All properties solved by simple procedures.
Total runtime 231350 ms.

BK_STOP 1716510540716

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-24a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-24a, 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 r180-tall-171640603700548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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