MCC'2024- Execution of r496-tall-171640603800588

About the Execution of LTSMin+red for GPUForwardProgress-PT-32b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
824.747	1332769.00	2599834.00	2412.30	FFFFFFFFTFFTFTFF	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640603800588.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 ltsminxred
Input is GPUForwardProgress-PT-32b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603800588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 22:23 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 160K 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-32b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717198825303

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:40:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:40:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:40:26] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-31 23:40:26] [INFO ] Transformed 644 places.
[2024-05-31 23:40:26] [INFO ] Transformed 677 transitions.
[2024-05-31 23:40:26] [INFO ] Found NUPN structural information;
[2024-05-31 23:40:26] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 644/644 places, 677/677 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 643 transition count 677
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 63 place count 581 transition count 615
Iterating global reduction 1 with 62 rules applied. Total rules applied 125 place count 581 transition count 615
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 153 place count 553 transition count 587
Iterating global reduction 1 with 28 rules applied. Total rules applied 181 place count 553 transition count 587
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 206 place count 553 transition count 562
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 207 place count 552 transition count 561
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 552 transition count 561
Applied a total of 208 rules in 151 ms. Remains 552 /644 variables (removed 92) and now considering 561/677 (removed 116) transitions.
// Phase 1: matrix 561 rows 552 cols
[2024-05-31 23:40:26] [INFO ] Computed 33 invariants in 27 ms
[2024-05-31 23:40:27] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-31 23:40:27] [INFO ] Invariant cache hit.
[2024-05-31 23:40:27] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 560 sub problems to find dead transitions.
[2024-05-31 23:40:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 561/1112 variables, 551/584 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1112 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (OVERLAPS) 1/1113 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 585 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 561/1112 variables, 551/584 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1112 variables, 560/1144 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1112 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (OVERLAPS) 1/1113 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1113/1113 variables, and 1145 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 0/0 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 560 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Starting structural reductions in LTL mode, iteration 1 : 552/644 places, 561/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61154 ms. Remains : 552/644 places, 561/677 transitions.
Support contains 28 out of 552 places after structural reductions.
[2024-05-31 23:41:28] [INFO ] Flatten gal took : 62 ms
[2024-05-31 23:41:28] [INFO ] Flatten gal took : 26 ms
[2024-05-31 23:41:28] [INFO ] Input system was already deterministic with 561 transitions.
RANDOM walk for 40000 steps (144 resets) in 1304 ms. (30 steps per ms) remains 6/26 properties
BEST_FIRST walk for 40003 steps (14 resets) in 66 ms. (597 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (15 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 111 ms. (357 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (15 resets) in 71 ms. (555 steps per ms) remains 3/4 properties
[2024-05-31 23:41:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 545/551 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 561/1112 variables, 551/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1112 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/1113 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1113 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1113 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 585 constraints, problems are : Problem set: 0 solved, 3 unsolved in 410 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 545/551 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 561/1112 variables, 551/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1112 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1112 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/1113 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1113 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1113/1113 variables, and 588 constraints, problems are : Problem set: 0 solved, 3 unsolved in 742 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1170ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 318 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=39 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 24 ms.
Computed a total of 102 stabilizing places and 102 stable transitions
Graph (complete) has 858 edges and 552 vertex of which 516 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.33 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Graph (trivial) has 456 edges and 552 vertex of which 6 / 552 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 852 edges and 547 vertex of which 511 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 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 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 510 transition count 282
Reduce places removed 269 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 276 rules applied. Total rules applied 547 place count 241 transition count 275
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 549 place count 240 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 550 place count 239 transition count 274
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 550 place count 239 transition count 207
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 684 place count 172 transition count 207
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 716 place count 140 transition count 175
Iterating global reduction 4 with 32 rules applied. Total rules applied 748 place count 140 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 749 place count 140 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 749 place count 140 transition count 173
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 751 place count 139 transition count 173
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 943 place count 43 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 944 place count 43 transition count 76
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 975 place count 12 transition count 15
Iterating global reduction 6 with 31 rules applied. Total rules applied 1006 place count 12 transition count 15
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 6 with 2 rules applied. Total rules applied 1008 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1009 place count 10 transition count 13
Applied a total of 1009 rules in 79 ms. Remains 10 /552 variables (removed 542) and now considering 13/561 (removed 548) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-31 23:41:30] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:41:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-31 23:41:30] [INFO ] Invariant cache hit.
[2024-05-31 23:41:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:41:30] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-31 23:41:30] [INFO ] Redundant transitions in 11 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-31 23:41:30] [INFO ] Invariant cache hit.
[2024-05-31 23:41:30] [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) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/22 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 11 constraints, problems are : Problem set: 0 solved, 8 unsolved in 89 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) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/22 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 237 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 330ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 330ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/552 places, 13/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 515 ms. Remains : 10/552 places, 13/561 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-00
Stuttering criterion allowed to conclude after 429 steps with 33 reset in 10 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-00 finished in 721 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)))&&F((p1&&X((p1 U (p2||G(p1))))))))'
Support contains 3 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 537 transition count 546
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 537 transition count 546
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 537 transition count 540
Applied a total of 36 rules in 68 ms. Remains 537 /552 variables (removed 15) and now considering 540/561 (removed 21) transitions.
// Phase 1: matrix 540 rows 537 cols
[2024-05-31 23:41:31] [INFO ] Computed 33 invariants in 3 ms
[2024-05-31 23:41:31] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-31 23:41:31] [INFO ] Invariant cache hit.
[2024-05-31 23:41:31] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 539 sub problems to find dead transitions.
[2024-05-31 23:41:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1076 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 4 (OVERLAPS) 1/1077 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1077/1077 variables, and 570 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 539 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1076 variables, 539/1108 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1076 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 5 (OVERLAPS) 1/1077 variables, 1/1109 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1077/1077 variables, and 1109 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 539 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in LTL mode, iteration 1 : 537/552 places, 540/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60810 ms. Remains : 537/552 places, 540/561 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-01
Stuttering criterion allowed to conclude after 359 steps with 0 reset in 4 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-01 finished in 61026 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 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Graph (trivial) has 460 edges and 552 vertex of which 6 / 552 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 852 edges and 547 vertex of which 511 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 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 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 510 transition count 280
Reduce places removed 271 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 552 place count 239 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 553 place count 238 transition count 272
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 553 place count 238 transition count 204
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 689 place count 170 transition count 204
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 720 place count 139 transition count 173
Iterating global reduction 3 with 31 rules applied. Total rules applied 751 place count 139 transition count 173
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 947 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 948 place count 41 transition count 74
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 979 place count 10 transition count 13
Iterating global reduction 4 with 31 rules applied. Total rules applied 1010 place count 10 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 1012 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1013 place count 8 transition count 11
Applied a total of 1013 rules in 40 ms. Remains 8 /552 variables (removed 544) and now considering 11/561 (removed 550) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-31 23:42:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:42:32] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 23:42:32] [INFO ] Invariant cache hit.
[2024-05-31 23:42:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:42:32] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-31 23:42:32] [INFO ] Redundant transitions in 13 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-31 23:42:32] [INFO ] Invariant cache hit.
[2024-05-31 23:42:32] [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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 52 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 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) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 63 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/552 places, 11/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 8/552 places, 11/561 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-02 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 542 transition count 551
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 542 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 542 transition count 550
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 536 transition count 544
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 536 transition count 544
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 39 place count 536 transition count 538
Applied a total of 39 rules in 33 ms. Remains 536 /552 variables (removed 16) and now considering 538/561 (removed 23) transitions.
// Phase 1: matrix 538 rows 536 cols
[2024-05-31 23:42:32] [INFO ] Computed 33 invariants in 4 ms
[2024-05-31 23:42:32] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-31 23:42:32] [INFO ] Invariant cache hit.
[2024-05-31 23:42:32] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2024-05-31 23:42:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 1/1074 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 569 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 1/1074 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 1106 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 536/552 places, 538/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60640 ms. Remains : 536/552 places, 538/561 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 14324 steps with 53 reset in 47 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-03 finished in 60832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U p1))))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 537 transition count 545
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 537 transition count 545
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 37 place count 537 transition count 539
Applied a total of 37 rules in 31 ms. Remains 537 /552 variables (removed 15) and now considering 539/561 (removed 22) transitions.
// Phase 1: matrix 539 rows 537 cols
[2024-05-31 23:43:33] [INFO ] Computed 33 invariants in 5 ms
[2024-05-31 23:43:33] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-31 23:43:33] [INFO ] Invariant cache hit.
[2024-05-31 23:43:33] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 538 sub problems to find dead transitions.
[2024-05-31 23:43:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 539/1075 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 4 (OVERLAPS) 1/1076 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1076/1076 variables, and 570 constraints, problems are : Problem set: 0 solved, 538 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 538 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 539/1075 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 538/1107 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1075 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 5 (OVERLAPS) 1/1076 variables, 1/1108 constraints. Problems are: Problem set: 0 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1076/1076 variables, and 1108 constraints, problems are : Problem set: 0 solved, 538 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 538 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 537/552 places, 539/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60567 ms. Remains : 537/552 places, 539/561 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-05
Product exploration explored 100000 steps with 1329 reset in 201 ms.
Product exploration explored 100000 steps with 1315 reset in 245 ms.
Computed a total of 100 stabilizing places and 100 stable transitions
Graph (complete) has 836 edges and 537 vertex of which 501 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.7 ms
Computed a total of 100 stabilizing places and 100 stable transitions
Detected a total of 100/537 stabilizing places and 100/539 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 (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (143 resets) in 188 ms. (211 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
[2024-05-31 23:44:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 532/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 539/1075 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1075 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/1076 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1076 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1076 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1076/1076 variables, and 570 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 532/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 539/1075 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1075 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1075 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/1076 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1076 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1076 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1076/1076 variables, and 571 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 579ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 140 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
[2024-05-31 23:44:36] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-32b-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-05 finished in 63265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 538 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 538 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 538 transition count 541
Applied a total of 34 rules in 34 ms. Remains 538 /552 variables (removed 14) and now considering 541/561 (removed 20) transitions.
// Phase 1: matrix 541 rows 538 cols
[2024-05-31 23:44:36] [INFO ] Computed 33 invariants in 5 ms
[2024-05-31 23:44:36] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 23:44:36] [INFO ] Invariant cache hit.
[2024-05-31 23:44:37] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-05-31 23:44:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 1111 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 538/552 places, 541/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60604 ms. Remains : 538/552 places, 541/561 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-06
Product exploration explored 100000 steps with 367 reset in 183 ms.
Entered a terminal (fully accepting) state of product in 4390 steps with 14 reset in 11 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-06 finished in 60910 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)&&F(p1)))'
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Graph (trivial) has 460 edges and 552 vertex of which 6 / 552 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 852 edges and 547 vertex of which 511 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Discarding 36 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 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 510 transition count 280
Reduce places removed 271 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 552 place count 239 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 553 place count 238 transition count 272
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 553 place count 238 transition count 204
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 689 place count 170 transition count 204
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 720 place count 139 transition count 173
Iterating global reduction 3 with 31 rules applied. Total rules applied 751 place count 139 transition count 173
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 947 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 948 place count 41 transition count 74
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 979 place count 10 transition count 13
Iterating global reduction 4 with 31 rules applied. Total rules applied 1010 place count 10 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 1012 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1013 place count 8 transition count 11
Applied a total of 1013 rules in 24 ms. Remains 8 /552 variables (removed 544) and now considering 11/561 (removed 550) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-31 23:45:37] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:45:37] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 23:45:37] [INFO ] Invariant cache hit.
[2024-05-31 23:45:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:45:37] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-31 23:45:37] [INFO ] Redundant transitions in 9 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-31 23:45:37] [INFO ] Invariant cache hit.
[2024-05-31 23:45:37] [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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 62 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 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) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 57 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/552 places, 11/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 8/552 places, 11/561 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-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' '!(X(X(F((p0||X(F(p1)))))))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 544 transition count 553
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 544 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 544 transition count 552
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 539 transition count 547
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 539 transition count 547
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 539 transition count 542
Applied a total of 32 rules in 60 ms. Remains 539 /552 variables (removed 13) and now considering 542/561 (removed 19) transitions.
// Phase 1: matrix 542 rows 539 cols
[2024-05-31 23:45:38] [INFO ] Computed 33 invariants in 7 ms
[2024-05-31 23:45:38] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-31 23:45:38] [INFO ] Invariant cache hit.
[2024-05-31 23:45:38] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-31 23:45:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 542/1080 variables, 538/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (OVERLAPS) 1/1081 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1081/1081 variables, and 572 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 542/1080 variables, 538/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 541/1112 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1080 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 1/1081 variables, 1/1113 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1081/1081 variables, and 1113 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in LTL mode, iteration 1 : 539/552 places, 542/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60820 ms. Remains : 539/552 places, 542/561 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-09
Stuttering criterion allowed to conclude after 656 steps with 1 reset in 4 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-09 finished in 61013 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||F(p1)))&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0))))))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 538 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 538 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 538 transition count 541
Applied a total of 34 rules in 36 ms. Remains 538 /552 variables (removed 14) and now considering 541/561 (removed 20) transitions.
// Phase 1: matrix 541 rows 538 cols
[2024-05-31 23:46:38] [INFO ] Computed 33 invariants in 6 ms
[2024-05-31 23:46:39] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-31 23:46:39] [INFO ] Invariant cache hit.
[2024-05-31 23:46:39] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-05-31 23:46:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 1111 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 538/552 places, 541/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60633 ms. Remains : 538/552 places, 541/561 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) p0), (AND (NOT p1) (NOT p0)), p0, p0, (NOT p1), true]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-10
Product exploration explored 100000 steps with 1103 reset in 151 ms.
Product exploration explored 100000 steps with 1119 reset in 171 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.17 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 86 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 717 steps (0 resets) in 6 ms. (102 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 10 factoid took 147 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-31 23:47:40] [INFO ] Invariant cache hit.
[2024-05-31 23:47:40] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-31 23:47:41] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-05-31 23:47:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:47:41] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 9 ms returned sat
[2024-05-31 23:47:41] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2024-05-31 23:47:41] [INFO ] Computed and/alt/rep : 535/703/535 causal constraints (skipped 5 transitions) in 30 ms.
[2024-05-31 23:47:45] [INFO ] Added : 511 causal constraints over 103 iterations in 4044 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 538 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Applied a total of 0 rules in 9 ms. Remains 538 /538 variables (removed 0) and now considering 541/541 (removed 0) transitions.
[2024-05-31 23:47:45] [INFO ] Invariant cache hit.
[2024-05-31 23:47:45] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-31 23:47:45] [INFO ] Invariant cache hit.
[2024-05-31 23:47:46] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-05-31 23:47:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 1111 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Finished structural reductions in LTL mode , in 1 iterations and 60587 ms. Remains : 538/538 places, 541/541 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.9 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 804 steps (0 resets) in 8 ms. (89 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-31 23:48:46] [INFO ] Invariant cache hit.
[2024-05-31 23:48:46] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-31 23:48:47] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-05-31 23:48:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:48:47] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-31 23:48:47] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2024-05-31 23:48:47] [INFO ] Computed and/alt/rep : 535/703/535 causal constraints (skipped 5 transitions) in 32 ms.
[2024-05-31 23:48:51] [INFO ] Added : 511 causal constraints over 103 iterations in 3822 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 547 reset in 150 ms.
Product exploration explored 100000 steps with 550 reset in 161 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 440 edges and 538 vertex of which 6 / 538 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 832 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 259 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 259 rules applied. Total rules applied 261 place count 497 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 262 place count 497 transition count 531
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 262 place count 497 transition count 533
Deduced a syphon composed of 292 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 295 place count 497 transition count 533
Discarding 191 places :
Symmetric choice reduction at 2 with 191 rule applications. Total rules 486 place count 306 transition count 342
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 2 with 191 rules applied. Total rules applied 677 place count 306 transition count 342
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 708 place count 275 transition count 311
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 739 place count 275 transition count 311
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 203 places in 0 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 841 place count 275 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 843 place count 275 transition count 310
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 914 place count 204 transition count 238
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 3 with 71 rules applied. Total rules applied 985 place count 204 transition count 238
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 986 place count 204 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 987 place count 203 transition count 237
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 988 place count 203 transition count 237
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 3 with 32 rules applied. Total rules applied 1020 place count 203 transition count 332
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1082 place count 141 transition count 208
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 3 with 62 rules applied. Total rules applied 1144 place count 141 transition count 208
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 1234 place count 51 transition count 58
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 3 with 90 rules applied. Total rules applied 1324 place count 51 transition count 58
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 1324 rules in 77 ms. Remains 51 /538 variables (removed 487) and now considering 58/541 (removed 483) transitions.
[2024-05-31 23:48:52] [INFO ] Redundant transitions in 15 ms returned []
Running 57 sub problems to find dead transitions.
// Phase 1: matrix 58 rows 51 cols
[2024-05-31 23:48:52] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:48:52] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 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 TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/107 variables, 50/50 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/58 constraints. Problems are: Problem set: 46 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/58 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/108 variables, 1/59 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/60 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/60 constraints. Problems are: Problem set: 46 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 60 constraints, problems are : Problem set: 46 solved, 11 unsolved in 333 ms.
Refiners :[State Equation: 51/51 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 56/64 variables, 8/8 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 8/16 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 11/27 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/27 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 44/108 variables, 43/70 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/70 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/109 variables, 1/71 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/71 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/71 constraints. Problems are: Problem set: 46 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 71 constraints, problems are : Problem set: 46 solved, 11 unsolved in 220 ms.
Refiners :[State Equation: 51/51 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 11/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 567ms problems are : Problem set: 46 solved, 11 unsolved
Search for dead transitions found 46 dead transitions in 569ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 51/538 places, 12/541 transitions.
Graph (complete) has 30 edges and 51 vertex of which 9 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 9 /51 variables (removed 42) and now considering 12/12 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/538 places, 12/541 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 666 ms. Remains : 9/538 places, 12/541 transitions.
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 537 transition count 540
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 537 transition count 540
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 536 transition count 539
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 536 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 536 transition count 538
Applied a total of 5 rules in 31 ms. Remains 536 /538 variables (removed 2) and now considering 538/541 (removed 3) transitions.
// Phase 1: matrix 538 rows 536 cols
[2024-05-31 23:48:52] [INFO ] Computed 33 invariants in 5 ms
[2024-05-31 23:48:52] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-31 23:48:52] [INFO ] Invariant cache hit.
[2024-05-31 23:48:53] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2024-05-31 23:48:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 1/1074 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 569 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 1/1074 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 1106 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in LTL mode, iteration 1 : 536/538 places, 538/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60639 ms. Remains : 536/538 places, 538/541 transitions.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-10 finished in 194589 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(!p0)&&X(F(!p1)))))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 538 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 538 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 538 transition count 541
Applied a total of 34 rules in 26 ms. Remains 538 /552 variables (removed 14) and now considering 541/561 (removed 20) transitions.
// Phase 1: matrix 541 rows 538 cols
[2024-05-31 23:49:53] [INFO ] Computed 33 invariants in 2 ms
[2024-05-31 23:49:53] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-31 23:49:53] [INFO ] Invariant cache hit.
[2024-05-31 23:49:54] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-05-31 23:49:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 1111 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 538/552 places, 541/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60732 ms. Remains : 538/552 places, 541/561 transitions.
Stuttering acceptance computed with spot in 171 ms :[p0, p0, (AND p1 p0), (AND p0 p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-11
Product exploration explored 100000 steps with 371 reset in 171 ms.
Product exploration explored 100000 steps with 373 reset in 170 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND p0 p1), (AND p1 p0), (AND p0 p1), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (145 resets) in 216 ms. (184 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
[2024-05-31 23:50:55] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 533/537 variables, 33/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1079 variables, 0/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 1 solved, 1 unsolved in 223 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 533/537 variables, 33/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 1/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/1079 variables, 1/572 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1079 variables, 0/572 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1079 variables, 0/572 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 572 constraints, problems are : Problem set: 1 solved, 1 unsolved in 403 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 636ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 482 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=120 )
Parikh walk visited 1 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 210 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 175 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 436 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 832 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 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 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 496 transition count 274
Reduce places removed 257 places and 0 transitions.
Iterating post reduction 1 with 257 rules applied. Total rules applied 516 place count 239 transition count 274
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 516 place count 239 transition count 209
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 646 place count 174 transition count 209
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 677 place count 143 transition count 178
Iterating global reduction 2 with 31 rules applied. Total rules applied 708 place count 143 transition count 178
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 904 place count 45 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 905 place count 45 transition count 79
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 935 place count 15 transition count 20
Iterating global reduction 3 with 30 rules applied. Total rules applied 965 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 3 with 4 rules applied. Total rules applied 969 place count 13 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 970 place count 12 transition count 18
Applied a total of 970 rules in 23 ms. Remains 12 /538 variables (removed 526) and now considering 18/541 (removed 523) transitions.
[2024-05-31 23:50:56] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 12 cols
[2024-05-31 23:50:56] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:50:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-31 23:50:56] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:50:56] [INFO ] Invariant cache hit.
[2024-05-31 23:50:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:50:56] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-31 23:50:56] [INFO ] Redundant transitions in 9 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-31 23:50:56] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:50:56] [INFO ] Invariant cache hit.
[2024-05-31 23:50:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/28 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 13 constraints, problems are : Problem set: 0 solved, 15 unsolved in 112 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/28 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/29 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 28 constraints, problems are : Problem set: 0 solved, 15 unsolved in 136 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 268ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 268ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/538 places, 18/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 355 ms. Remains : 12/538 places, 18/541 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (3115 resets) in 145 ms. (273 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (2003 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-05-31 23:50:57] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:50:57] [INFO ] Invariant cache hit.
[2024-05-31 23:50:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/29 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 11 ms.
Refiners :[State Equation: 0/12 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 14ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 10 factoid took 189 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 172 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 173 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 12661 reset in 128 ms.
Product exploration explored 100000 steps with 12672 reset in 139 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-31 23:50:58] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:50:58] [INFO ] Invariant cache hit.
[2024-05-31 23:50:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 23:50:58] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:50:58] [INFO ] Invariant cache hit.
[2024-05-31 23:50:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:50:58] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-31 23:50:58] [INFO ] Redundant transitions in 10 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-31 23:50:58] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:50:58] [INFO ] Invariant cache hit.
[2024-05-31 23:50:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/28 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 13 constraints, problems are : Problem set: 0 solved, 15 unsolved in 117 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/28 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/29 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 28 constraints, problems are : Problem set: 0 solved, 15 unsolved in 127 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 276ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 276ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 12/12 places, 18/18 transitions.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-11 finished in 65074 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) U (G(p1) U (p2||X(F((p2&&F(p3)))))))))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 538 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 538 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 538 transition count 541
Applied a total of 34 rules in 32 ms. Remains 538 /552 variables (removed 14) and now considering 541/561 (removed 20) transitions.
// Phase 1: matrix 541 rows 538 cols
[2024-05-31 23:50:58] [INFO ] Computed 33 invariants in 8 ms
[2024-05-31 23:50:58] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-31 23:50:58] [INFO ] Invariant cache hit.
[2024-05-31 23:50:59] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-05-31 23:50:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 1111 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 538/552 places, 541/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60634 ms. Remains : 538/552 places, 541/561 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p2), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-12
Product exploration explored 100000 steps with 862 reset in 152 ms.
Product exploration explored 100000 steps with 850 reset in 164 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/538 stabilizing places and 99/541 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 132 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 18 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 810 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
RANDOM walk for 40000 steps (145 resets) in 910 ms. (43 steps per ms) remains 11/24 properties
BEST_FIRST walk for 40004 steps (15 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (12 resets) in 161 ms. (246 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40003 steps (16 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (13 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (13 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
[2024-05-31 23:52:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 91/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 442/537 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1079 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1079 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 0 solved, 7 unsolved in 823 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 91/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 442/537 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 7/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1078 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/1079 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1079 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1079 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 578 constraints, problems are : Problem set: 0 solved, 7 unsolved in 669 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1500ms problems are : Problem set: 0 solved, 7 unsolved
Finished Parikh walk after 13061 steps, including 83 resets, run visited all 4 properties in 158 ms. (steps per millisecond=82 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 501 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p2) p3))), (F p1), (F (NOT (OR p0 (NOT p1) p2))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F p0), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2) p3)))]
Knowledge based reduction with 19 factoid took 1049 ms. Reduced automaton from 18 states, 51 edges and 4 AP (stutter insensitive) to 18 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 761 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 839 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
[2024-05-31 23:52:06] [INFO ] Invariant cache hit.
[2024-05-31 23:52:06] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 24 ms returned sat
[2024-05-31 23:52:06] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-05-31 23:52:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:52:06] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-31 23:52:06] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2024-05-31 23:52:06] [INFO ] Computed and/alt/rep : 535/703/535 causal constraints (skipped 5 transitions) in 26 ms.
[2024-05-31 23:52:10] [INFO ] Added : 513 causal constraints over 103 iterations in 3886 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 435 edges and 538 vertex of which 6 / 538 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 832 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 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 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 496 transition count 278
Reduce places removed 253 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 255 rules applied. Total rules applied 510 place count 243 transition count 276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 512 place count 241 transition count 276
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 512 place count 241 transition count 210
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 644 place count 175 transition count 210
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 675 place count 144 transition count 179
Iterating global reduction 3 with 31 rules applied. Total rules applied 706 place count 144 transition count 179
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 898 place count 48 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 899 place count 48 transition count 82
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 928 place count 19 transition count 25
Iterating global reduction 4 with 29 rules applied. Total rules applied 957 place count 19 transition count 25
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 961 place count 17 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 962 place count 16 transition count 23
Applied a total of 962 rules in 24 ms. Remains 16 /538 variables (removed 522) and now considering 23/541 (removed 518) transitions.
[2024-05-31 23:52:10] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
// Phase 1: matrix 22 rows 16 cols
[2024-05-31 23:52:10] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:52:10] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-31 23:52:10] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
[2024-05-31 23:52:10] [INFO ] Invariant cache hit.
[2024-05-31 23:52:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:52:10] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-31 23:52:10] [INFO ] Redundant transitions in 9 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-31 23:52:10] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
[2024-05-31 23:52:10] [INFO ] Invariant cache hit.
[2024-05-31 23:52:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 21/35 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 17 constraints, problems are : Problem set: 0 solved, 19 unsolved in 132 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 21/35 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 2/37 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/38 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 36 constraints, problems are : Problem set: 0 solved, 19 unsolved in 166 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 304ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/538 places, 23/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 383 ms. Remains : 16/538 places, 23/541 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/16 stabilizing places and 4/23 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 33 factoid took 984 ms. Reduced automaton from 18 states, 51 edges and 4 AP (stutter insensitive) to 18 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 751 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
RANDOM walk for 7725 steps (537 resets) in 32 ms. (234 steps per ms) remains 0/24 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p2) p3))), (F p1), (F (NOT (OR p0 (NOT p1) p2))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F p0), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2) p3)))]
Knowledge based reduction with 33 factoid took 1996 ms. Reduced automaton from 18 states, 51 edges and 4 AP (stutter insensitive) to 18 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 738 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 835 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
[2024-05-31 23:52:16] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
[2024-05-31 23:52:16] [INFO ] Invariant cache hit.
[2024-05-31 23:52:16] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-31 23:52:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:52:16] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:52:16] [INFO ] Computed and/alt/rep : 18/44/18 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-31 23:52:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:52:16] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-31 23:52:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 23:52:16] [INFO ] Computed and/alt/rep : 18/44/18 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-31 23:52:16] [INFO ] Added : 14 causal constraints over 4 iterations in 10 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 702 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-12 finished in 78822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(G(p1))))||G(p2))))'
Support contains 3 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 544 transition count 553
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 544 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 544 transition count 552
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 539 transition count 547
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 539 transition count 547
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 539 transition count 542
Applied a total of 32 rules in 33 ms. Remains 539 /552 variables (removed 13) and now considering 542/561 (removed 19) transitions.
// Phase 1: matrix 542 rows 539 cols
[2024-05-31 23:52:17] [INFO ] Computed 33 invariants in 5 ms
[2024-05-31 23:52:17] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-31 23:52:17] [INFO ] Invariant cache hit.
[2024-05-31 23:52:17] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-31 23:52:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 542/1080 variables, 538/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (OVERLAPS) 1/1081 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1081/1081 variables, and 572 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 542/1080 variables, 538/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 541/1112 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1080 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 1/1081 variables, 1/1113 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1081/1081 variables, and 1113 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 539/552 places, 542/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60589 ms. Remains : 539/552 places, 542/561 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-14
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-14 finished in 60794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((G(p0)||X(F(p1)))))))))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 542 transition count 551
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 542 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 542 transition count 550
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 536 transition count 544
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 536 transition count 544
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 39 place count 536 transition count 538
Applied a total of 39 rules in 38 ms. Remains 536 /552 variables (removed 16) and now considering 538/561 (removed 23) transitions.
// Phase 1: matrix 538 rows 536 cols
[2024-05-31 23:53:18] [INFO ] Computed 33 invariants in 5 ms
[2024-05-31 23:53:18] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-31 23:53:18] [INFO ] Invariant cache hit.
[2024-05-31 23:53:18] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2024-05-31 23:53:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 1/1074 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 569 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 1/1074 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 1106 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 536/552 places, 538/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60603 ms. Remains : 536/552 places, 538/561 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-15
Product exploration explored 100000 steps with 496 reset in 139 ms.
Product exploration explored 100000 steps with 490 reset in 152 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 835 edges and 536 vertex of which 500 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/536 stabilizing places and 99/538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 773 steps (0 resets) in 10 ms. (70 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-31 23:54:20] [INFO ] Invariant cache hit.
[2024-05-31 23:54:20] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 13 ms returned sat
[2024-05-31 23:54:20] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2024-05-31 23:54:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:54:21] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-31 23:54:21] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2024-05-31 23:54:21] [INFO ] Computed and/alt/rep : 532/698/532 causal constraints (skipped 5 transitions) in 30 ms.
[2024-05-31 23:54:24] [INFO ] Added : 445 causal constraints over 89 iterations in 3352 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 538/538 transitions.
Applied a total of 0 rules in 15 ms. Remains 536 /536 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2024-05-31 23:54:24] [INFO ] Invariant cache hit.
[2024-05-31 23:54:24] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-31 23:54:24] [INFO ] Invariant cache hit.
[2024-05-31 23:54:25] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2024-05-31 23:54:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 1/1074 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 569 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 1/1074 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 1106 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Finished structural reductions in LTL mode , in 1 iterations and 60609 ms. Remains : 536/536 places, 538/538 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 835 edges and 536 vertex of which 500 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/536 stabilizing places and 99/538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 778 steps (0 resets) in 8 ms. (86 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-31 23:55:26] [INFO ] Invariant cache hit.
[2024-05-31 23:55:26] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 11 ms returned sat
[2024-05-31 23:55:26] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2024-05-31 23:55:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:55:26] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-31 23:55:27] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2024-05-31 23:55:27] [INFO ] Computed and/alt/rep : 532/698/532 causal constraints (skipped 5 transitions) in 35 ms.
[2024-05-31 23:55:30] [INFO ] Added : 445 causal constraints over 89 iterations in 3410 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 490 reset in 147 ms.
Product exploration explored 100000 steps with 492 reset in 154 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 536 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 536/536 places, 538/538 transitions.
Graph (trivial) has 436 edges and 536 vertex of which 6 / 536 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 829 edges and 531 vertex of which 495 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 257 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 495 transition count 529
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 33 Pre rules applied. Total rules applied 259 place count 495 transition count 531
Deduced a syphon composed of 290 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 292 place count 495 transition count 531
Discarding 189 places :
Symmetric choice reduction at 1 with 189 rule applications. Total rules 481 place count 306 transition count 342
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 1 with 189 rules applied. Total rules applied 670 place count 306 transition count 342
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 701 place count 275 transition count 311
Deduced a syphon composed of 101 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 732 place count 275 transition count 311
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 201 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 832 place count 275 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 834 place count 275 transition count 310
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 904 place count 205 transition count 239
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 974 place count 205 transition count 239
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 975 place count 205 transition count 239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 976 place count 204 transition count 238
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 977 place count 204 transition count 238
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 1009 place count 204 transition count 333
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1071 place count 142 transition count 209
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 2 with 62 rules applied. Total rules applied 1133 place count 142 transition count 209
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1223 place count 52 transition count 59
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 2 with 90 rules applied. Total rules applied 1313 place count 52 transition count 59
Deduced a syphon composed of 41 places in 0 ms
Applied a total of 1313 rules in 50 ms. Remains 52 /536 variables (removed 484) and now considering 59/538 (removed 479) transitions.
[2024-05-31 23:55:31] [INFO ] Redundant transitions in 15 ms returned []
Running 58 sub problems to find dead transitions.
// Phase 1: matrix 59 rows 52 cols
[2024-05-31 23:55:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:55:31] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 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 TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 1 (OVERLAPS) 58/109 variables, 51/51 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/59 constraints. Problems are: Problem set: 45 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/59 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/110 variables, 1/60 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/60 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/111 variables, 1/61 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/61 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/61 constraints. Problems are: Problem set: 45 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 61 constraints, problems are : Problem set: 45 solved, 13 unsolved in 316 ms.
Refiners :[State Equation: 52/52 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 45 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 57/67 variables, 10/10 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 8/18 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 13/31 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/31 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 43/110 variables, 42/73 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/73 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/111 variables, 1/74 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/74 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/74 constraints. Problems are: Problem set: 45 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 74 constraints, problems are : Problem set: 45 solved, 13 unsolved in 290 ms.
Refiners :[State Equation: 52/52 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 13/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 615ms problems are : Problem set: 45 solved, 13 unsolved
Search for dead transitions found 45 dead transitions in 616ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 52/536 places, 14/538 transitions.
Graph (complete) has 34 edges and 52 vertex of which 11 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Discarding 41 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 11 /52 variables (removed 41) and now considering 14/14 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/536 places, 14/538 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 689 ms. Remains : 11/536 places, 14/538 transitions.
Support contains 2 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 538/538 transitions.
Applied a total of 0 rules in 11 ms. Remains 536 /536 variables (removed 0) and now considering 538/538 (removed 0) transitions.
// Phase 1: matrix 538 rows 536 cols
[2024-05-31 23:55:32] [INFO ] Computed 33 invariants in 4 ms
[2024-05-31 23:55:32] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-31 23:55:32] [INFO ] Invariant cache hit.
[2024-05-31 23:55:32] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2024-05-31 23:55:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 1/1074 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 569 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 1/1074 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 1106 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in LTL mode , in 1 iterations and 60593 ms. Remains : 536/536 places, 538/538 transitions.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-15 finished in 194571 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||F(p1)))&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0))))))'
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(!p0)&&X(F(!p1)))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-32b-LTLFireability-11
Stuttering acceptance computed with spot in 140 ms :[p0, p0, (AND p1 p0), (AND p0 p1)]
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Graph (trivial) has 456 edges and 552 vertex of which 6 / 552 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 852 edges and 547 vertex of which 511 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 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 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 272 place count 510 transition count 281
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 277 rules applied. Total rules applied 549 place count 240 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 550 place count 239 transition count 274
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 550 place count 239 transition count 209
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 680 place count 174 transition count 209
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 711 place count 143 transition count 178
Iterating global reduction 3 with 31 rules applied. Total rules applied 742 place count 143 transition count 178
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 938 place count 45 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 939 place count 45 transition count 79
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 969 place count 15 transition count 20
Iterating global reduction 4 with 30 rules applied. Total rules applied 999 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 4 with 4 rules applied. Total rules applied 1003 place count 13 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1004 place count 12 transition count 18
Applied a total of 1004 rules in 23 ms. Remains 12 /552 variables (removed 540) and now considering 18/561 (removed 543) transitions.
[2024-05-31 23:56:33] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 12 cols
[2024-05-31 23:56:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:56:33] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-31 23:56:33] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:56:33] [INFO ] Invariant cache hit.
[2024-05-31 23:56:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:56:33] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-05-31 23:56:33] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:56:33] [INFO ] Invariant cache hit.
[2024-05-31 23:56:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/28 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 13 constraints, problems are : Problem set: 0 solved, 15 unsolved in 120 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/28 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/29 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 28 constraints, problems are : Problem set: 0 solved, 15 unsolved in 127 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 274ms
Starting structural reductions in LI_LTL mode, iteration 1 : 12/552 places, 18/561 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 343 ms. Remains : 12/552 places, 18/561 transitions.
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-11
Product exploration explored 100000 steps with 12556 reset in 86 ms.
Product exploration explored 100000 steps with 12584 reset in 99 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND p0 p1), (AND p1 p0), (AND p0 p1), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (3090 resets) in 81 ms. (487 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1987 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-05-31 23:56:33] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:56:33] [INFO ] Invariant cache hit.
[2024-05-31 23:56:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/29 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 11 ms.
Refiners :[State Equation: 0/12 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 13ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 181 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 188 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-31 23:56:34] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:56:34] [INFO ] Invariant cache hit.
[2024-05-31 23:56:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 23:56:34] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:56:34] [INFO ] Invariant cache hit.
[2024-05-31 23:56:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:56:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-31 23:56:34] [INFO ] Redundant transitions in 10 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-31 23:56:34] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:56:34] [INFO ] Invariant cache hit.
[2024-05-31 23:56:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/28 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 13 constraints, problems are : Problem set: 0 solved, 15 unsolved in 103 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/28 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/29 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 28 constraints, problems are : Problem set: 0 solved, 15 unsolved in 128 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 238ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 238ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 12/12 places, 18/18 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (3117 resets) in 66 ms. (597 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (1994 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2024-05-31 23:56:35] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:56:35] [INFO ] Invariant cache hit.
[2024-05-31 23:56:35] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/29 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 10 ms.
Refiners :[State Equation: 0/12 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 13ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 10 factoid took 183 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 182 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 186 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 12563 reset in 89 ms.
Product exploration explored 100000 steps with 12574 reset in 101 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-31 23:56:36] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:56:36] [INFO ] Invariant cache hit.
[2024-05-31 23:56:36] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 23:56:36] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:56:36] [INFO ] Invariant cache hit.
[2024-05-31 23:56:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:56:36] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-31 23:56:36] [INFO ] Redundant transitions in 11 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-31 23:56:36] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:56:36] [INFO ] Invariant cache hit.
[2024-05-31 23:56:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/28 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 13 constraints, problems are : Problem set: 0 solved, 15 unsolved in 109 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/28 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/29 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 28 constraints, problems are : Problem set: 0 solved, 15 unsolved in 126 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 243ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 244ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 12/12 places, 18/18 transitions.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-11 finished in 3564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((G(p0)||X(F(p1)))))))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-32b-LTLFireability-15
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Graph (trivial) has 459 edges and 552 vertex of which 6 / 552 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 852 edges and 547 vertex of which 511 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 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 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 272 place count 510 transition count 281
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 550 place count 240 transition count 273
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 553 place count 239 transition count 271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 555 place count 237 transition count 271
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 555 place count 237 transition count 204
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 689 place count 170 transition count 204
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 720 place count 139 transition count 173
Iterating global reduction 4 with 31 rules applied. Total rules applied 751 place count 139 transition count 173
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 943 place count 43 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 944 place count 43 transition count 76
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 975 place count 12 transition count 15
Iterating global reduction 5 with 31 rules applied. Total rules applied 1006 place count 12 transition count 15
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 1008 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1009 place count 10 transition count 13
Applied a total of 1009 rules in 16 ms. Remains 10 /552 variables (removed 542) and now considering 13/561 (removed 548) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-31 23:56:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:56:36] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-31 23:56:36] [INFO ] Invariant cache hit.
[2024-05-31 23:56:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:56:36] [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.
Running 8 sub problems to find dead transitions.
[2024-05-31 23:56:36] [INFO ] Invariant cache hit.
[2024-05-31 23:56:36] [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) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/22 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 11 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]
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) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/22 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 67 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 LI_LTL mode, iteration 1 : 10/552 places, 13/561 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 204 ms. Remains : 10/552 places, 13/561 transitions.
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-15 finished in 515 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-31 23:56:36] [INFO ] Flatten gal took : 24 ms
[2024-05-31 23:56:36] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 23:56:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 552 places, 561 transitions and 1443 arcs took 13 ms.
Total runtime 970596 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA GPUForwardProgress-PT-32b-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA GPUForwardProgress-PT-32b-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA GPUForwardProgress-PT-32b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717200158072

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name GPUForwardProgress-PT-32b-LTLFireability-10
ltl formula formula --ltl=/tmp/2870/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 552 places, 561 transitions and 1443 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2870/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2870/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2870/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2870/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 554 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 553, there are 587 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~107!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 545
pnml2lts-mc( 0/ 4): unique transitions count: 5323
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 553
pnml2lts-mc( 0/ 4): - cum. max stack depth: 553
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 553 states 5342 transitions, fanout: 9.660
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.030 sec minimum, 0.038 sec on average)
pnml2lts-mc( 0/ 4): States per second: 13825, Transitions per second: 133550
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 23.2 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 573 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name GPUForwardProgress-PT-32b-LTLFireability-11
ltl formula formula --ltl=/tmp/2870/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 552 places, 561 transitions and 1443 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2870/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2870/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2870/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2870/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 554 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 553, there are 569 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~266 levels ~10000 states ~43624 transitions
pnml2lts-mc( 3/ 4): ~265 levels ~20000 states ~95792 transitions
pnml2lts-mc( 3/ 4): ~265 levels ~40000 states ~201488 transitions
pnml2lts-mc( 3/ 4): ~265 levels ~80000 states ~409804 transitions
pnml2lts-mc( 1/ 4): ~265 levels ~160000 states ~847004 transitions
pnml2lts-mc( 1/ 4): ~265 levels ~320000 states ~1806600 transitions
pnml2lts-mc( 1/ 4): ~265 levels ~640000 states ~3902904 transitions
pnml2lts-mc( 1/ 4): ~265 levels ~1280000 states ~8433296 transitions
pnml2lts-mc( 1/ 4): ~265 levels ~2560000 states ~17291388 transitions
pnml2lts-mc( 3/ 4): ~265 levels ~5120000 states ~35342448 transitions
pnml2lts-mc( 2/ 4): ~408271 levels ~10240000 states ~34291256 transitions
pnml2lts-mc( 2/ 4): ~808387 levels ~20480000 states ~69023316 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 27608781
pnml2lts-mc( 0/ 4): unique states count: 29146802
pnml2lts-mc( 0/ 4): unique transitions count: 193483575
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 148747172
pnml2lts-mc( 0/ 4): - claim found count: 9671504
pnml2lts-mc( 0/ 4): - claim success count: 29146811
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1137501
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 29146811 states 193483590 transitions, fanout: 6.638
pnml2lts-mc( 0/ 4): Total exploration time 359.660 sec (359.510 sec minimum, 359.550 sec on average)
pnml2lts-mc( 0/ 4): States per second: 81040, Transitions per second: 537962
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 265.1MB, 8.3 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/14.0%
pnml2lts-mc( 0/ 4): Stored 573 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 265.1MB (~256.0MB paged-in)
ltl formula name GPUForwardProgress-PT-32b-LTLFireability-15
ltl formula formula --ltl=/tmp/2870/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 552 places, 561 transitions and 1443 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2870/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2870/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2870/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2870/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 554 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 553, there are 570 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~232!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1000
pnml2lts-mc( 0/ 4): unique states count: 1889
pnml2lts-mc( 0/ 4): unique transitions count: 9977
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 631
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1900
pnml2lts-mc( 0/ 4): - cum. max stack depth: 914
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1900 states 10004 transitions, fanout: 5.265
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 31667, Transitions per second: 166733
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 19.7 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 573 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)

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-32b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is GPUForwardProgress-PT-32b, 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 r496-tall-171640603800588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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