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-171640603800620.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-40b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603800620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 11 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 11 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 22:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 199K 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-40b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716515595171

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-40b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 01:53:16] [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 01:53:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 01:53:16] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-24 01:53:16] [INFO ] Transformed 796 places.
[2024-05-24 01:53:16] [INFO ] Transformed 837 transitions.
[2024-05-24 01:53:16] [INFO ] Found NUPN structural information;
[2024-05-24 01:53:16] [INFO ] Parsed PT model containing 796 places and 837 transitions and 2077 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 837/837 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 837
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 83 place count 713 transition count 755
Iterating global reduction 1 with 82 rules applied. Total rules applied 165 place count 713 transition count 755
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 203 place count 675 transition count 717
Iterating global reduction 1 with 38 rules applied. Total rules applied 241 place count 675 transition count 717
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 276 place count 675 transition count 682
Applied a total of 276 rules in 157 ms. Remains 675 /796 variables (removed 121) and now considering 682/837 (removed 155) transitions.
// Phase 1: matrix 682 rows 675 cols
[2024-05-24 01:53:16] [INFO ] Computed 41 invariants in 24 ms
[2024-05-24 01:53:17] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-24 01:53:17] [INFO ] Invariant cache hit.
[2024-05-24 01:53:17] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2024-05-24 01:53:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/674 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/674 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 682/1356 variables, 674/715 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1356 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 681 unsolved
SMT process timed out in 30340ms, After SMT, problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 30364ms
Starting structural reductions in LTL mode, iteration 1 : 675/796 places, 682/837 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31325 ms. Remains : 675/796 places, 682/837 transitions.
Support contains 35 out of 675 places after structural reductions.
[2024-05-24 01:53:48] [INFO ] Flatten gal took : 74 ms
[2024-05-24 01:53:48] [INFO ] Flatten gal took : 33 ms
[2024-05-24 01:53:48] [INFO ] Input system was already deterministic with 682 transitions.
Support contains 34 out of 675 places (down from 35) after GAL structural reductions.
RANDOM walk for 40000 steps (116 resets) in 2273 ms. (17 steps per ms) remains 10/35 properties
BEST_FIRST walk for 40004 steps (12 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 93 ms. (425 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (12 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (11 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 189 ms. (210 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 78 ms. (506 steps per ms) remains 7/9 properties
[2024-05-24 01:53:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 143/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 525/674 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 682/1356 variables, 674/715 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1356 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/1357 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1357 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1357 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1357/1357 variables, and 716 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1173 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 143/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 525/674 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 682/1356 variables, 674/715 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1356 variables, 7/722 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1356 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/1357 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1357 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1357 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1357/1357 variables, and 723 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1111 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 2309ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Finished Parikh walk after 243 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=81 )
Parikh walk visited 7 properties in 8 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPUForwardProgress-PT-40b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPUForwardProgress-PT-40b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 127 stabilizing places and 127 stable transitions
Graph (complete) has 1051 edges and 675 vertex of which 631 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.25 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||G(p1)))))'
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Graph (trivial) has 555 edges and 675 vertex of which 6 / 675 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 670 vertex of which 626 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 328 place count 625 transition count 346
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 334 rules applied. Total rules applied 662 place count 299 transition count 338
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 665 place count 296 transition count 338
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 665 place count 296 transition count 253
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 835 place count 211 transition count 253
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 875 place count 171 transition count 213
Iterating global reduction 3 with 40 rules applied. Total rules applied 915 place count 171 transition count 213
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1155 place count 51 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1156 place count 51 transition count 92
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 1196 place count 11 transition count 13
Iterating global reduction 4 with 40 rules applied. Total rules applied 1236 place count 11 transition count 13
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 4 with 2 rules applied. Total rules applied 1238 place count 10 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1239 place count 9 transition count 11
Applied a total of 1239 rules in 63 ms. Remains 9 /675 variables (removed 666) and now considering 11/682 (removed 671) transitions.
// Phase 1: matrix 11 rows 9 cols
[2024-05-24 01:53:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:53:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 01:53:52] [INFO ] Invariant cache hit.
[2024-05-24 01:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:53:52] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-24 01:53:52] [INFO ] Redundant transitions in 14 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 01:53:52] [INFO ] Invariant cache hit.
[2024-05-24 01:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 10 constraints, problems are : Problem set: 0 solved, 6 unsolved in 103 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/675 places, 11/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 9/675 places, 11/682 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-00
Stuttering criterion allowed to conclude after 46 steps with 6 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-00 finished in 556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 667 transition count 674
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 667 transition count 674
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 667 transition count 671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 666 transition count 670
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 666 transition count 670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 666 transition count 669
Applied a total of 22 rules in 131 ms. Remains 666 /675 variables (removed 9) and now considering 669/682 (removed 13) transitions.
// Phase 1: matrix 669 rows 666 cols
[2024-05-24 01:53:52] [INFO ] Computed 41 invariants in 3 ms
[2024-05-24 01:53:53] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-24 01:53:53] [INFO ] Invariant cache hit.
[2024-05-24 01:53:53] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Running 668 sub problems to find dead transitions.
[2024-05-24 01:53:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
SMT process timed out in 30212ms, After SMT, problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 30218ms
Starting structural reductions in LTL mode, iteration 1 : 666/675 places, 669/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31016 ms. Remains : 666/675 places, 669/682 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-03
Stuttering criterion allowed to conclude after 329 steps with 0 reset in 7 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-03 finished in 31138 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) U (p1&&F(p2))))'
Support contains 6 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 666 transition count 673
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 666 transition count 673
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 666 transition count 670
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 664 transition count 668
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 664 transition count 668
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 664 transition count 666
Applied a total of 27 rules in 40 ms. Remains 664 /675 variables (removed 11) and now considering 666/682 (removed 16) transitions.
// Phase 1: matrix 666 rows 664 cols
[2024-05-24 01:54:24] [INFO ] Computed 41 invariants in 3 ms
[2024-05-24 01:54:24] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-24 01:54:24] [INFO ] Invariant cache hit.
[2024-05-24 01:54:24] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 665 sub problems to find dead transitions.
[2024-05-24 01:54:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 666/1329 variables, 663/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1329 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
SMT process timed out in 30181ms, After SMT, problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 30186ms
Starting structural reductions in LTL mode, iteration 1 : 664/675 places, 666/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30907 ms. Remains : 664/675 places, 666/682 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) p0), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-06
Stuttering criterion allowed to conclude after 329 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-06 finished in 31065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(F(G(p1)) U p2)))))'
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Graph (trivial) has 555 edges and 675 vertex of which 6 / 675 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 670 vertex of which 626 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.5 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 325 place count 625 transition count 349
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 331 rules applied. Total rules applied 656 place count 302 transition count 341
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 660 place count 299 transition count 340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 661 place count 298 transition count 340
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 85 Pre rules applied. Total rules applied 661 place count 298 transition count 255
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 831 place count 213 transition count 255
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 871 place count 173 transition count 215
Iterating global reduction 4 with 40 rules applied. Total rules applied 911 place count 173 transition count 215
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 1155 place count 51 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1156 place count 51 transition count 92
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1194 place count 13 transition count 17
Iterating global reduction 5 with 38 rules applied. Total rules applied 1232 place count 13 transition count 17
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 5 with 2 rules applied. Total rules applied 1234 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1235 place count 11 transition count 15
Applied a total of 1235 rules in 58 ms. Remains 11 /675 variables (removed 664) and now considering 15/682 (removed 667) transitions.
// Phase 1: matrix 15 rows 11 cols
[2024-05-24 01:54:55] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:54:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 01:54:55] [INFO ] Invariant cache hit.
[2024-05-24 01:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:54:55] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 01:54:55] [INFO ] Redundant transitions in 9 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-24 01:54:55] [INFO ] Invariant cache hit.
[2024-05-24 01:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/25 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/26 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 85 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/25 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/26 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 82 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 192ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 192ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/675 places, 15/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 11/675 places, 15/682 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-07
Stuttering criterion allowed to conclude after 25 steps with 2 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-07 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&G(F(p2)))))'
Support contains 2 out of 675 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Graph (trivial) has 555 edges and 675 vertex of which 6 / 675 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 670 vertex of which 626 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.5 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 325 place count 625 transition count 349
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 331 rules applied. Total rules applied 656 place count 302 transition count 341
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 662 place count 299 transition count 338
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 665 place count 296 transition count 338
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 665 place count 296 transition count 255
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 831 place count 213 transition count 255
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 871 place count 173 transition count 215
Iterating global reduction 4 with 40 rules applied. Total rules applied 911 place count 173 transition count 215
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 1155 place count 51 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1156 place count 51 transition count 92
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1193 place count 14 transition count 19
Iterating global reduction 5 with 37 rules applied. Total rules applied 1230 place count 14 transition count 19
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 5 with 2 rules applied. Total rules applied 1232 place count 13 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1233 place count 12 transition count 17
Applied a total of 1233 rules in 34 ms. Remains 12 /675 variables (removed 663) and now considering 17/682 (removed 665) transitions.
// Phase 1: matrix 17 rows 12 cols
[2024-05-24 01:54:55] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 01:54:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 01:54:55] [INFO ] Invariant cache hit.
[2024-05-24 01:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:54:55] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-24 01:54:55] [INFO ] Redundant transitions in 9 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-24 01:54:55] [INFO ] Invariant cache hit.
[2024-05-24 01:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/28 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 13 constraints, problems are : Problem set: 0 solved, 11 unsolved in 106 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 4/28 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/29 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 24 constraints, problems are : Problem set: 0 solved, 11 unsolved in 87 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 200ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/675 places, 17/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 303 ms. Remains : 12/675 places, 17/682 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-08 finished in 460 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||G(p1)))))'
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Graph (trivial) has 556 edges and 675 vertex of which 6 / 675 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 670 vertex of which 626 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 328 place count 625 transition count 346
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 334 rules applied. Total rules applied 662 place count 299 transition count 338
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 666 place count 296 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 667 place count 295 transition count 337
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 667 place count 295 transition count 253
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 835 place count 211 transition count 253
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 875 place count 171 transition count 213
Iterating global reduction 4 with 40 rules applied. Total rules applied 915 place count 171 transition count 213
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 1157 place count 50 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1158 place count 50 transition count 91
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1196 place count 12 transition count 16
Iterating global reduction 5 with 38 rules applied. Total rules applied 1234 place count 12 transition count 16
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 5 with 2 rules applied. Total rules applied 1236 place count 11 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1237 place count 11 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1238 place count 10 transition count 14
Applied a total of 1238 rules in 31 ms. Remains 10 /675 variables (removed 665) and now considering 14/682 (removed 668) transitions.
// Phase 1: matrix 14 rows 10 cols
[2024-05-24 01:54:55] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:54:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 01:54:55] [INFO ] Invariant cache hit.
[2024-05-24 01:54:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:54:56] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-24 01:54:56] [INFO ] Redundant transitions in 10 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-24 01:54:56] [INFO ] Invariant cache hit.
[2024-05-24 01:54:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/23 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 11 constraints, problems are : Problem set: 0 solved, 8 unsolved in 66 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 61 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/675 places, 14/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 10/675 places, 14/682 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-09
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-09 finished in 360 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 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Graph (trivial) has 558 edges and 675 vertex of which 6 / 675 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 670 vertex of which 626 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 329 place count 625 transition count 345
Reduce places removed 327 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 335 rules applied. Total rules applied 664 place count 298 transition count 337
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 668 place count 295 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 669 place count 294 transition count 336
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 85 Pre rules applied. Total rules applied 669 place count 294 transition count 251
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 839 place count 209 transition count 251
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 879 place count 169 transition count 211
Iterating global reduction 4 with 40 rules applied. Total rules applied 919 place count 169 transition count 211
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 1159 place count 49 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1160 place count 49 transition count 90
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 1200 place count 9 transition count 11
Iterating global reduction 5 with 40 rules applied. Total rules applied 1240 place count 9 transition count 11
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 5 with 2 rules applied. Total rules applied 1242 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1243 place count 7 transition count 9
Applied a total of 1243 rules in 28 ms. Remains 7 /675 variables (removed 668) and now considering 9/682 (removed 673) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-24 01:54:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:54:56] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 01:54:56] [INFO ] Invariant cache hit.
[2024-05-24 01:54:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:54:56] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-24 01:54:56] [INFO ] Redundant transitions in 9 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-24 01:54:56] [INFO ] Invariant cache hit.
[2024-05-24 01:54:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 38 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 43 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/675 places, 9/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 7/675 places, 9/682 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-10 finished in 223 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 X(G(p1)))))'
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 667 transition count 674
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 667 transition count 674
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 667 transition count 671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 666 transition count 670
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 666 transition count 670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 666 transition count 669
Applied a total of 22 rules in 36 ms. Remains 666 /675 variables (removed 9) and now considering 669/682 (removed 13) transitions.
// Phase 1: matrix 669 rows 666 cols
[2024-05-24 01:54:56] [INFO ] Computed 41 invariants in 12 ms
[2024-05-24 01:54:56] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-24 01:54:56] [INFO ] Invariant cache hit.
[2024-05-24 01:54:57] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 668 sub problems to find dead transitions.
[2024-05-24 01:54:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 30183ms
Starting structural reductions in LTL mode, iteration 1 : 666/675 places, 669/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30735 ms. Remains : 666/675 places, 669/682 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-11
Product exploration explored 100000 steps with 293 reset in 222 ms.
Entered a terminal (fully accepting) state of product in 38674 steps with 113 reset in 83 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-11 finished in 31248 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))&&F((p1||X((p2||X(F(p3))))))))'
Support contains 3 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 668 transition count 675
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 668 transition count 675
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 668 transition count 673
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 666 transition count 671
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 666 transition count 671
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 666 transition count 669
Applied a total of 22 rules in 40 ms. Remains 666 /675 variables (removed 9) and now considering 669/682 (removed 13) transitions.
// Phase 1: matrix 669 rows 666 cols
[2024-05-24 01:55:27] [INFO ] Computed 41 invariants in 9 ms
[2024-05-24 01:55:27] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-24 01:55:27] [INFO ] Invariant cache hit.
[2024-05-24 01:55:28] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 668 sub problems to find dead transitions.
[2024-05-24 01:55:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 30171ms
Starting structural reductions in LTL mode, iteration 1 : 666/675 places, 669/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30747 ms. Remains : 666/675 places, 669/682 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-12
Product exploration explored 100000 steps with 28812 reset in 750 ms.
Product exploration explored 100000 steps with 28780 reset in 175 ms.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1038 edges and 666 vertex of which 622 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.7 ms
Computed a total of 124 stabilizing places and 124 stable transitions
Detected a total of 124/666 stabilizing places and 124/669 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) p3), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
Knowledge based reduction with 9 factoid took 202 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (117 resets) in 237 ms. (168 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
[2024-05-24 01:56:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 611/665 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1335 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1335 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1335 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1335/1335 variables, and 707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 666/666 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 611/665 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1335 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1335 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1335 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 708 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 666/666 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 635ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 135 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) p3), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (F p1), (F p2), (F (NOT (OR p3 p1 p2))), (F (NOT p3))]
Knowledge based reduction with 9 factoid took 288 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Support contains 3 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 669/669 transitions.
Applied a total of 0 rules in 12 ms. Remains 666 /666 variables (removed 0) and now considering 669/669 (removed 0) transitions.
[2024-05-24 01:56:01] [INFO ] Invariant cache hit.
[2024-05-24 01:56:01] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-24 01:56:01] [INFO ] Invariant cache hit.
[2024-05-24 01:56:01] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 668 sub problems to find dead transitions.
[2024-05-24 01:56:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 30181ms
Finished structural reductions in LTL mode , in 1 iterations and 30751 ms. Remains : 666/666 places, 669/669 transitions.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1038 edges and 666 vertex of which 622 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.6 ms
Computed a total of 124 stabilizing places and 124 stable transitions
Detected a total of 124/666 stabilizing places and 124/669 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (115 resets) in 90 ms. (439 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-05-24 01:56:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 611/665 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1335 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1335 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1335 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1335/1335 variables, and 707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 666/666 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 611/665 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1335 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1335 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1335 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 708 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 666/666 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 615ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 185 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=92 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (F p1), (F p2), (F (NOT (OR p3 p2 p1))), (F (NOT p3))]
Knowledge based reduction with 4 factoid took 448 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 20273 reset in 138 ms.
Product exploration explored 100000 steps with 20184 reset in 157 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Support contains 3 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 669/669 transitions.
Graph (trivial) has 541 edges and 666 vertex of which 6 / 666 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1032 edges and 661 vertex of which 617 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 318 rules applied. Total rules applied 320 place count 617 transition count 660
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 43 Pre rules applied. Total rules applied 320 place count 617 transition count 663
Deduced a syphon composed of 361 places in 1 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 363 place count 617 transition count 663
Discarding 235 places :
Symmetric choice reduction at 1 with 235 rule applications. Total rules 598 place count 382 transition count 428
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 1 with 235 rules applied. Total rules applied 833 place count 382 transition count 428
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 872 place count 343 transition count 389
Deduced a syphon composed of 126 places in 1 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 911 place count 343 transition count 389
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 251 places in 0 ms
Iterating global reduction 1 with 125 rules applied. Total rules applied 1036 place count 343 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1038 place count 343 transition count 388
Discarding 86 places :
Symmetric choice reduction at 2 with 86 rule applications. Total rules 1124 place count 257 transition count 301
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 2 with 86 rules applied. Total rules applied 1210 place count 257 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1211 place count 257 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1212 place count 256 transition count 300
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1213 place count 256 transition count 300
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -119
Deduced a syphon composed of 205 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 1253 place count 256 transition count 419
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1331 place count 178 transition count 263
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1409 place count 178 transition count 263
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 1520 place count 67 transition count 78
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 111 rules applied. Total rules applied 1631 place count 67 transition count 78
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 1631 rules in 111 ms. Remains 67 /666 variables (removed 599) and now considering 78/669 (removed 591) transitions.
[2024-05-24 01:56:34] [INFO ] Redundant transitions in 12 ms returned []
Running 77 sub problems to find dead transitions.
// Phase 1: matrix 78 rows 67 cols
[2024-05-24 01:56:34] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:56:34] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 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 TDEAD20 is UNSAT
Problem TDEAD21 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 TDEAD31 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 TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
At refinement iteration 1 (OVERLAPS) 77/143 variables, 66/66 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 10/76 constraints. Problems are: Problem set: 58 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/76 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 1/144 variables, 1/77 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/77 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/145 variables, 1/78 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/78 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/78 constraints. Problems are: Problem set: 58 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 78 constraints, problems are : Problem set: 58 solved, 19 unsolved in 475 ms.
Refiners :[State Equation: 67/67 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 58 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 76/89 variables, 13/13 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 10/23 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 19/42 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/42 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 55/144 variables, 54/96 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/96 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/97 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/97 constraints. Problems are: Problem set: 58 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/97 constraints. Problems are: Problem set: 58 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 97 constraints, problems are : Problem set: 58 solved, 19 unsolved in 398 ms.
Refiners :[State Equation: 67/67 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 19/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 889ms problems are : Problem set: 58 solved, 19 unsolved
Search for dead transitions found 58 dead transitions in 891ms
Found 58 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 58 transitions
Dead transitions reduction (with SMT) removed 58 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 67/666 places, 20/669 transitions.
Graph (complete) has 43 edges and 67 vertex of which 14 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.0 ms
Discarding 53 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 14 /67 variables (removed 53) and now considering 20/20 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/666 places, 20/669 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1027 ms. Remains : 14/666 places, 20/669 transitions.
Built C files in :
/tmp/ltsmin11780500446285952986
[2024-05-24 01:56:35] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11780500446285952986
Running compilation step : cd /tmp/ltsmin11780500446285952986;'/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 1267 ms.
Running link step : cd /tmp/ltsmin11780500446285952986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11780500446285952986;'/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/stateBased8360532062566158608.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 669/669 transitions.
Applied a total of 0 rules in 18 ms. Remains 666 /666 variables (removed 0) and now considering 669/669 (removed 0) transitions.
// Phase 1: matrix 669 rows 666 cols
[2024-05-24 01:56:50] [INFO ] Computed 41 invariants in 5 ms
[2024-05-24 01:56:50] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-24 01:56:50] [INFO ] Invariant cache hit.
[2024-05-24 01:56:51] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Running 668 sub problems to find dead transitions.
[2024-05-24 01:56:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
SMT process timed out in 30168ms, After SMT, problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 30179ms
Finished structural reductions in LTL mode , in 1 iterations and 30772 ms. Remains : 666/666 places, 669/669 transitions.
Built C files in :
/tmp/ltsmin9150357617199645493
[2024-05-24 01:57:21] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9150357617199645493
Running compilation step : cd /tmp/ltsmin9150357617199645493;'/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 1129 ms.
Running link step : cd /tmp/ltsmin9150357617199645493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9150357617199645493;'/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/stateBased857360516179128422.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 01:57:36] [INFO ] Flatten gal took : 28 ms
[2024-05-24 01:57:36] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:57:36] [INFO ] Time to serialize gal into /tmp/LTL313494067022583160.gal : 7 ms
[2024-05-24 01:57:36] [INFO ] Time to serialize properties into /tmp/LTL8143668570392672139.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/LTL313494067022583160.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6789213421227395793.hoa' '-atoms' '/tmp/LTL8143668570392672139.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...316
Loading property file /tmp/LTL8143668570392672139.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6789213421227395793.hoa
Detected timeout of ITS tools.
[2024-05-24 01:57:51] [INFO ] Flatten gal took : 22 ms
[2024-05-24 01:57:51] [INFO ] Flatten gal took : 23 ms
[2024-05-24 01:57:51] [INFO ] Time to serialize gal into /tmp/LTL6921136333739264371.gal : 6 ms
[2024-05-24 01:57:51] [INFO ] Time to serialize properties into /tmp/LTL16823120067200354684.ltl : 12 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/LTL6921136333739264371.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16823120067200354684.ltl' '-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...276
Read 1 LTL properties
Checking formula 0 : !(((X(F("(p313==0)")))&&(F(("(p313==1)")||(X(("(p109==1)")||(X(F("(p761==0)")))))))))
Formula 0 simplified : XG!"(p313==0)" | G(!"(p313==1)" & X(!"(p109==1)" & XG!"(p761==0)"))
Detected timeout of ITS tools.
[2024-05-24 01:58:06] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:58:06] [INFO ] Applying decomposition
[2024-05-24 01:58:06] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17219869258287133364.txt' '-o' '/tmp/graph17219869258287133364.bin' '-w' '/tmp/graph17219869258287133364.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17219869258287133364.bin' '-l' '-1' '-v' '-w' '/tmp/graph17219869258287133364.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:58:06] [INFO ] Decomposing Gal with order
[2024-05-24 01:58:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:58:06] [INFO ] Removed a total of 84 redundant transitions.
[2024-05-24 01:58:07] [INFO ] Flatten gal took : 119 ms
[2024-05-24 01:58:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-24 01:58:07] [INFO ] Time to serialize gal into /tmp/LTL4565388591845298938.gal : 10 ms
[2024-05-24 01:58:07] [INFO ] Time to serialize properties into /tmp/LTL4218751580260368560.ltl : 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/LTL4565388591845298938.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4218751580260368560.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !(((X(F("(i17.u115.p313==0)")))&&(F(("(i17.u115.p313==1)")||(X(("(i6.u43.p109==1)")||(X(F("(i40.u271.p761==0)")))))))))
Formula 0 simplified : XG!"(i17.u115.p313==0)" | G(!"(i17.u115.p313==1)" & X(!"(i6.u43.p109==1)" & XG!"(i40.u271.p761==0)"))
Detected timeout of ITS tools.
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-12 finished in 174390 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||G(p1)))))'
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 667 transition count 674
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 667 transition count 674
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 667 transition count 672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 665 transition count 670
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 665 transition count 670
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 665 transition count 668
Applied a total of 24 rules in 48 ms. Remains 665 /675 variables (removed 10) and now considering 668/682 (removed 14) transitions.
// Phase 1: matrix 668 rows 665 cols
[2024-05-24 01:58:22] [INFO ] Computed 41 invariants in 10 ms
[2024-05-24 01:58:22] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-24 01:58:22] [INFO ] Invariant cache hit.
[2024-05-24 01:58:22] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 667 sub problems to find dead transitions.
[2024-05-24 01:58:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/664 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/664 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (OVERLAPS) 668/1332 variables, 664/705 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1332 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 667 unsolved
SMT process timed out in 30179ms, After SMT, problems are : Problem set: 0 solved, 667 unsolved
Search for dead transitions found 0 dead transitions in 30187ms
Starting structural reductions in LTL mode, iteration 1 : 665/675 places, 668/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30833 ms. Remains : 665/675 places, 668/682 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-13
Product exploration explored 100000 steps with 4130 reset in 133 ms.
Product exploration explored 100000 steps with 4092 reset in 211 ms.
Computed a total of 123 stabilizing places and 123 stable transitions
Graph (complete) has 1037 edges and 665 vertex of which 621 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Detected a total of 123/665 stabilizing places and 123/668 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (115 resets) in 179 ms. (222 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
[2024-05-24 01:58:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 591/593 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/664 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/664 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 668/1332 variables, 664/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1332 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1333 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1333 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1333 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1333/1333 variables, and 706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 665/665 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 591/593 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/664 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/664 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 668/1332 variables, 664/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1332 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1332 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1333 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1333 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1333 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1333/1333 variables, and 707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 665/665 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 659ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 429 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-24 01:58:55] [INFO ] Invariant cache hit.
[2024-05-24 01:58:55] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 13 ms returned sat
[2024-05-24 01:58:55] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2024-05-24 01:58:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:58:55] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 13 ms returned sat
[2024-05-24 01:58:56] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2024-05-24 01:58:56] [INFO ] Computed and/alt/rep : 662/869/662 causal constraints (skipped 5 transitions) in 40 ms.
[2024-05-24 01:58:56] [INFO ] Added : 79 causal constraints over 16 iterations in 705 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 665/665 places, 668/668 transitions.
Graph (trivial) has 543 edges and 665 vertex of which 6 / 665 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1031 edges and 660 vertex of which 616 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 323 place count 615 transition count 337
Reduce places removed 321 places and 0 transitions.
Iterating post reduction 1 with 321 rules applied. Total rules applied 644 place count 294 transition count 337
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 644 place count 294 transition count 253
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 812 place count 210 transition count 253
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 851 place count 171 transition count 214
Iterating global reduction 2 with 39 rules applied. Total rules applied 890 place count 171 transition count 214
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 1128 place count 52 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1129 place count 52 transition count 94
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1168 place count 13 transition count 17
Iterating global reduction 3 with 39 rules applied. Total rules applied 1207 place count 13 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1211 place count 11 transition count 16
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 1213 place count 11 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1214 place count 10 transition count 15
Applied a total of 1214 rules in 26 ms. Remains 10 /665 variables (removed 655) and now considering 15/668 (removed 653) transitions.
[2024-05-24 01:58:56] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2024-05-24 01:58:57] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:58:57] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-24 01:58:57] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 01:58:57] [INFO ] Invariant cache hit.
[2024-05-24 01:58:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:58:57] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-24 01:58:57] [INFO ] Redundant transitions in 11 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-24 01:58:57] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 01:58:57] [INFO ] Invariant cache hit.
[2024-05-24 01:58:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/23 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 11 constraints, problems are : Problem set: 0 solved, 8 unsolved in 64 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 75 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/665 places, 15/668 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 10/665 places, 15/668 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/10 stabilizing places and 4/15 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 618 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 312 steps (27 resets) in 8 ms. (34 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 806 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-24 01:58:59] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 01:58:59] [INFO ] Invariant cache hit.
[2024-05-24 01:58:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 01:58:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:58:59] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 01:58:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:58:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 01:58:59] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 01:58:59] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-13 finished in 37221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((p0||G(p1)))||X(p2)) U p3))'
Support contains 3 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 667 transition count 674
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 667 transition count 674
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 667 transition count 672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 665 transition count 670
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 665 transition count 670
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 665 transition count 668
Applied a total of 24 rules in 52 ms. Remains 665 /675 variables (removed 10) and now considering 668/682 (removed 14) transitions.
// Phase 1: matrix 668 rows 665 cols
[2024-05-24 01:58:59] [INFO ] Computed 41 invariants in 7 ms
[2024-05-24 01:58:59] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-24 01:58:59] [INFO ] Invariant cache hit.
[2024-05-24 01:58:59] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 667 sub problems to find dead transitions.
[2024-05-24 01:59:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/664 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/664 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (OVERLAPS) 668/1332 variables, 664/705 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1332 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 667 unsolved
SMT process timed out in 30175ms, After SMT, problems are : Problem set: 0 solved, 667 unsolved
Search for dead transitions found 0 dead transitions in 30185ms
Starting structural reductions in LTL mode, iteration 1 : 665/675 places, 668/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30823 ms. Remains : 665/675 places, 668/682 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p3), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-14
Product exploration explored 100000 steps with 295 reset in 258 ms.
Product exploration explored 100000 steps with 294 reset in 219 ms.
Computed a total of 123 stabilizing places and 123 stable transitions
Graph (complete) has 1037 edges and 665 vertex of which 621 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p3) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p3))), (X (X (AND (NOT p3) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 27 factoid took 129 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p3), (OR (AND (NOT p2) p3) (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (116 resets) in 789 ms. (50 steps per ms) remains 14/18 properties
BEST_FIRST walk for 40004 steps (12 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (12 resets) in 121 ms. (327 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (12 resets) in 97 ms. (408 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (11 resets) in 87 ms. (454 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (12 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (11 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 219 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 241 ms. (165 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (12 resets) in 53 ms. (740 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 67 ms. (588 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (12 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (11 resets) in 55 ms. (714 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (11 resets) in 51 ms. (769 steps per ms) remains 14/14 properties
[2024-05-24 01:59:32] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 567/664 variables, 38/41 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/664 variables, 0/41 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 668/1332 variables, 664/705 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1332 variables, 0/705 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/1333 variables, 1/706 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1333 variables, 0/706 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/1333 variables, 0/706 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1333/1333 variables, and 706 constraints, problems are : Problem set: 4 solved, 10 unsolved in 1313 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 665/665 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 567/664 variables, 38/41 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/664 variables, 0/41 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 668/1332 variables, 664/705 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1332 variables, 10/715 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1332 variables, 0/715 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/1333 variables, 1/716 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1333 variables, 0/716 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/1333 variables, 0/716 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1333/1333 variables, and 716 constraints, problems are : Problem set: 4 solved, 10 unsolved in 1128 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 665/665 constraints, PredecessorRefiner: 10/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 2450ms problems are : Problem set: 4 solved, 10 unsolved
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2781 ms.
Support contains 3 out of 665 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 665/665 places, 668/668 transitions.
Graph (trivial) has 539 edges and 665 vertex of which 6 / 665 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1030 edges and 660 vertex of which 616 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Discarding 44 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 318 transitions
Trivial Post-agglo rules discarded 318 transitions
Performed 318 trivial Post agglomeration. Transition count delta: 318
Iterating post reduction 0 with 320 rules applied. Total rules applied 322 place count 616 transition count 338
Reduce places removed 318 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 319 rules applied. Total rules applied 641 place count 298 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 642 place count 297 transition count 337
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 642 place count 297 transition count 254
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 808 place count 214 transition count 254
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 849 place count 173 transition count 213
Iterating global reduction 3 with 41 rules applied. Total rules applied 890 place count 173 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 890 place count 173 transition count 212
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 892 place count 172 transition count 212
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1132 place count 52 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 144 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 1134 place count 51 transition count 91
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1136 place count 51 transition count 89
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 1172 place count 15 transition count 17
Iterating global reduction 5 with 36 rules applied. Total rules applied 1208 place count 15 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 1213 place count 12 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 18 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 1215 place count 11 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1216 place count 11 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1217 place count 11 transition count 12
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1218 place count 11 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1219 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1220 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 1223 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1224 place count 8 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 1224 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1228 place count 6 transition count 6
Applied a total of 1228 rules in 32 ms. Remains 6 /665 variables (removed 659) and now considering 6/668 (removed 662) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 6/665 places, 6/668 transitions.
RANDOM walk for 20022 steps (6 resets) in 14 ms. (1334 steps per ms) remains 0/10 properties
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p3) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p3))), (X (X (AND (NOT p3) p0))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p1 p3 p2)), (G (OR p0 p1 p3 (NOT p2))), (G (OR p0 p1)), (G (OR p0 p1 (NOT p3) p2))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p3 p2))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1) p3 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p3) p2))), (F (NOT (OR p0 (NOT p1) (NOT p3) p2))), (F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND (NOT p3) p2)))), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND p3 (NOT p2))))), (F (NOT (OR p0 (NOT p1)))), (F p2), (F p1), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F p3), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT (AND (OR (NOT p0) (NOT p1) p2) (OR (NOT p1) (NOT p3) p2)))), (F (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))]
Knowledge based reduction with 31 factoid took 652 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter insensitive) to 6 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p3), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 213 ms :[(NOT p3), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p0))]
[2024-05-24 01:59:38] [INFO ] Invariant cache hit.
[2024-05-24 01:59:38] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 13 ms returned sat
[2024-05-24 01:59:39] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2024-05-24 01:59:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:59:39] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 13 ms returned sat
[2024-05-24 01:59:39] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2024-05-24 01:59:39] [INFO ] Computed and/alt/rep : 662/869/662 causal constraints (skipped 5 transitions) in 36 ms.
[2024-05-24 01:59:45] [INFO ] Added : 648 causal constraints over 130 iterations in 6119 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 3 out of 665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 665/665 places, 668/668 transitions.
Graph (trivial) has 539 edges and 665 vertex of which 6 / 665 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1031 edges and 660 vertex of which 616 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 317 transitions
Trivial Post-agglo rules discarded 317 transitions
Performed 317 trivial Post agglomeration. Transition count delta: 317
Iterating post reduction 0 with 317 rules applied. Total rules applied 319 place count 615 transition count 341
Reduce places removed 317 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 318 rules applied. Total rules applied 637 place count 298 transition count 340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 638 place count 297 transition count 340
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 638 place count 297 transition count 256
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 806 place count 213 transition count 256
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 845 place count 174 transition count 217
Iterating global reduction 3 with 39 rules applied. Total rules applied 884 place count 174 transition count 217
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1124 place count 54 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1125 place count 54 transition count 96
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 1162 place count 17 transition count 23
Iterating global reduction 4 with 37 rules applied. Total rules applied 1199 place count 17 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1203 place count 15 transition count 22
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1206 place count 15 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1207 place count 14 transition count 21
Applied a total of 1207 rules in 22 ms. Remains 14 /665 variables (removed 651) and now considering 21/668 (removed 647) transitions.
[2024-05-24 01:59:45] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 14 cols
[2024-05-24 01:59:45] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:59:45] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 01:59:45] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2024-05-24 01:59:45] [INFO ] Invariant cache hit.
[2024-05-24 01:59:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:59:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-24 01:59:45] [INFO ] Redundant transitions in 10 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-24 01:59:45] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2024-05-24 01:59:45] [INFO ] Invariant cache hit.
[2024-05-24 01:59:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/32 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/33 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 15 constraints, problems are : Problem set: 0 solved, 12 unsolved in 97 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 4/32 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 27 constraints, problems are : Problem set: 0 solved, 12 unsolved in 106 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 207ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/665 places, 21/668 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 14/665 places, 21/668 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/14 stabilizing places and 7/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (OR (AND p0 p1 (NOT p2)) (AND p1 (NOT p2) p3)))), (X (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND p0 p1 (NOT p2)) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (X (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (AND p0 (NOT p2) p3)), (X (NOT (AND p0 (NOT p2) p3))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3))))), (X (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (AND p0 (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))))]
Knowledge based reduction with 21 factoid took 1548 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter insensitive) to 6 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p3), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (3195 resets) in 157 ms. (253 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40004 steps (780 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (691 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (677 resets) in 23 ms. (1666 steps per ms) remains 3/3 properties
[2024-05-24 01:59:47] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2024-05-24 01:59:47] [INFO ] Invariant cache hit.
[2024-05-24 01:59:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf13 is UNSAT
After SMT solving in domain Real declared 3/33 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 12 ms.
Refiners :[State Equation: 0/14 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 15ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (OR (AND p0 p1 (NOT p2)) (AND p1 (NOT p2) p3)))), (X (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND p0 p1 (NOT p2)) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1 p2 (NOT p3))), (G (OR p0 p1 p2 p3)), (G (OR p0 p1))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (X (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (AND p0 (NOT p2) p3)), (X (NOT (AND p0 (NOT p2) p3))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3))))), (X (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (AND p0 (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (F (NOT (AND (OR (NOT p0) (NOT p1) p2) (OR (NOT p1) p2 (NOT p3))))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F p2), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F p3), (F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (F (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3))))]
Knowledge based reduction with 24 factoid took 2184 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter insensitive) to 6 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p3), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 191 ms :[(NOT p3), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p0))]
[2024-05-24 01:59:50] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2024-05-24 01:59:50] [INFO ] Invariant cache hit.
[2024-05-24 01:59:50] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 01:59:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:59:50] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 01:59:50] [INFO ] Computed and/alt/rep : 12/32/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 01:59:50] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 193 ms :[(NOT p3), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering criterion allowed to conclude after 13 steps with 2 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-14 finished in 51487 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))&&F((p1||X((p2||X(F(p3))))))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-40b-LTLFireability-12
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 3 out of 675 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Graph (trivial) has 554 edges and 675 vertex of which 6 / 675 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 670 vertex of which 626 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 0 with 324 rules applied. Total rules applied 326 place count 625 transition count 348
Reduce places removed 324 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 330 rules applied. Total rules applied 656 place count 301 transition count 342
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 659 place count 299 transition count 341
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 660 place count 298 transition count 341
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 660 place count 298 transition count 257
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 828 place count 214 transition count 257
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 867 place count 175 transition count 218
Iterating global reduction 4 with 39 rules applied. Total rules applied 906 place count 175 transition count 218
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 1150 place count 53 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1151 place count 53 transition count 95
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1189 place count 15 transition count 20
Iterating global reduction 5 with 38 rules applied. Total rules applied 1227 place count 15 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1231 place count 13 transition count 19
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1233 place count 13 transition count 19
Applied a total of 1233 rules in 23 ms. Remains 13 /675 variables (removed 662) and now considering 19/682 (removed 663) transitions.
[2024-05-24 01:59:51] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-24 01:59:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:59:51] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 01:59:51] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 01:59:51] [INFO ] Invariant cache hit.
[2024-05-24 01:59:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-24 01:59:51] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 18 sub problems to find dead transitions.
[2024-05-24 01:59:51] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 01:59:51] [INFO ] Invariant cache hit.
[2024-05-24 01:59:51] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/29 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/30 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 1/31 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/31 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 17 constraints, problems are : Problem set: 0 solved, 18 unsolved in 135 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/29 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 35 constraints, problems are : Problem set: 0 solved, 18 unsolved in 168 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 331ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 331ms
Starting structural reductions in LI_LTL mode, iteration 1 : 13/675 places, 19/682 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 413 ms. Remains : 13/675 places, 19/682 transitions.
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-12
Product exploration explored 100000 steps with 39959 reset in 78 ms.
Product exploration explored 100000 steps with 40004 reset in 90 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/13 stabilizing places and 4/19 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) p3), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-12 finished in 845 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-12 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-24 01:59:51] [INFO ] Flatten gal took : 21 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 395422 ms.

BK_STOP 1716515991770

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-40b"
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-40b, 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-171640603800620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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