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-171640602700108.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 FlexibleBarrier-PT-16b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602700108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 13 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 08:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 08:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 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 945K 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 FlexibleBarrier-PT-16b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717183178154

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:19:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:19:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:19:39] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-31 19:19:39] [INFO ] Transformed 3472 places.
[2024-05-31 19:19:39] [INFO ] Transformed 4001 transitions.
[2024-05-31 19:19:39] [INFO ] Found NUPN structural information;
[2024-05-31 19:19:39] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 3472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Discarding 1422 places :
Symmetric choice reduction at 0 with 1422 rule applications. Total rules 1422 place count 2050 transition count 2579
Iterating global reduction 0 with 1422 rules applied. Total rules applied 2844 place count 2050 transition count 2579
Discarding 670 places :
Symmetric choice reduction at 0 with 670 rule applications. Total rules 3514 place count 1380 transition count 1909
Iterating global reduction 0 with 670 rules applied. Total rules applied 4184 place count 1380 transition count 1909
Discarding 433 places :
Symmetric choice reduction at 0 with 433 rule applications. Total rules 4617 place count 947 transition count 1476
Iterating global reduction 0 with 433 rules applied. Total rules applied 5050 place count 947 transition count 1476
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 0 with 211 rules applied. Total rules applied 5261 place count 947 transition count 1265
Applied a total of 5261 rules in 687 ms. Remains 947 /3472 variables (removed 2525) and now considering 1265/4001 (removed 2736) transitions.
// Phase 1: matrix 1265 rows 947 cols
[2024-05-31 19:19:40] [INFO ] Computed 18 invariants in 53 ms
[2024-05-31 19:19:41] [INFO ] Implicit Places using invariants in 699 ms returned []
[2024-05-31 19:19:41] [INFO ] Invariant cache hit.
[2024-05-31 19:19:42] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1718 ms to find 0 implicit places.
Running 1264 sub problems to find dead transitions.
[2024-05-31 19:19:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/946 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1264 unsolved
SMT process timed out in 31384ms, After SMT, problems are : Problem set: 0 solved, 1264 unsolved
Search for dead transitions found 0 dead transitions in 31416ms
Starting structural reductions in LTL mode, iteration 1 : 947/3472 places, 1265/4001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33850 ms. Remains : 947/3472 places, 1265/4001 transitions.
Support contains 34 out of 947 places after structural reductions.
[2024-05-31 19:20:14] [INFO ] Flatten gal took : 106 ms
[2024-05-31 19:20:14] [INFO ] Flatten gal took : 57 ms
[2024-05-31 19:20:14] [INFO ] Input system was already deterministic with 1265 transitions.
Support contains 32 out of 947 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (353 resets) in 1788 ms. (22 steps per ms) remains 15/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
[2024-05-31 19:20:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 507/524 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 423/947 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-31 19:20:15] [INFO ] Deduced a trap composed of 278 places in 352 ms of which 42 ms to minimize.
[2024-05-31 19:20:15] [INFO ] Deduced a trap composed of 311 places in 299 ms of which 6 ms to minimize.
[2024-05-31 19:20:16] [INFO ] Deduced a trap composed of 315 places in 264 ms of which 5 ms to minimize.
[2024-05-31 19:20:16] [INFO ] Deduced a trap composed of 319 places in 250 ms of which 4 ms to minimize.
[2024-05-31 19:20:16] [INFO ] Deduced a trap composed of 286 places in 240 ms of which 4 ms to minimize.
[2024-05-31 19:20:17] [INFO ] Deduced a trap composed of 310 places in 277 ms of which 11 ms to minimize.
[2024-05-31 19:20:17] [INFO ] Deduced a trap composed of 275 places in 247 ms of which 4 ms to minimize.
[2024-05-31 19:20:17] [INFO ] Deduced a trap composed of 314 places in 279 ms of which 5 ms to minimize.
[2024-05-31 19:20:17] [INFO ] Deduced a trap composed of 277 places in 263 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/947 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/947 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1265/2212 variables, 947/974 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2212 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-31 19:20:19] [INFO ] Deduced a trap composed of 313 places in 246 ms of which 5 ms to minimize.
[2024-05-31 19:20:19] [INFO ] Deduced a trap composed of 314 places in 236 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/2212 variables, 2/976 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2212/2212 variables, and 976 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 947/947 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 507/524 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-31 19:20:20] [INFO ] Deduced a trap composed of 276 places in 176 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 423/947 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/947 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/947 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1265/2212 variables, 947/977 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2212 variables, 15/992 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2212 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-31 19:20:22] [INFO ] Deduced a trap composed of 309 places in 266 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/2212 variables, 1/993 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-31 19:20:23] [INFO ] Deduced a trap composed of 273 places in 270 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2212 variables, 1/994 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2212 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/2212 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2212/2212 variables, and 994 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4874 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 947/947 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 14/14 constraints]
After SMT, in 9910ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 14 properties in 4242 ms.
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Graph (trivial) has 896 edges and 947 vertex of which 97 / 947 are part of one of the 16 SCC in 9 ms
Free SCC test removed 81 places
Drop transitions (Empty/Sink Transition effects.) removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 866 transition count 1084
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 167 place count 783 transition count 1084
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 167 place count 783 transition count 1046
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 243 place count 745 transition count 1046
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 291 place count 697 transition count 998
Iterating global reduction 2 with 48 rules applied. Total rules applied 339 place count 697 transition count 998
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 339 place count 697 transition count 997
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 341 place count 696 transition count 997
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 351 place count 686 transition count 987
Iterating global reduction 2 with 10 rules applied. Total rules applied 361 place count 686 transition count 987
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 371 place count 686 transition count 977
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 571 place count 586 transition count 877
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 603 place count 586 transition count 845
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 622 place count 567 transition count 826
Iterating global reduction 4 with 19 rules applied. Total rules applied 641 place count 567 transition count 826
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 644 place count 567 transition count 823
Free-agglomeration rule applied 483 times.
Iterating global reduction 5 with 483 rules applied. Total rules applied 1127 place count 567 transition count 340
Reduce places removed 483 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Graph (complete) has 230 edges and 84 vertex of which 14 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 709 rules applied. Total rules applied 1836 place count 14 transition count 115
Drop transitions (Empty/Sink Transition effects.) removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 6 with 98 rules applied. Total rules applied 1934 place count 14 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1935 place count 13 transition count 16
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 14 edges and 11 vertex of which 10 / 11 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 1938 place count 3 transition count 16
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1953 place count 2 transition count 2
Applied a total of 1953 rules in 366 ms. Remains 2 /947 variables (removed 945) and now considering 2/1265 (removed 1263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 2/947 places, 2/1265 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-16b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FlexibleBarrier-PT-16b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FlexibleBarrier-PT-16b-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 18 stabilizing places and 18 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((p0 U p1)||F(p2)))||(((p0 U p1)||F(p2))&&F((G(F(p3))||(!p1&&F(p3))))))))'
Support contains 4 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 930 transition count 1248
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 930 transition count 1248
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 49 place count 915 transition count 1233
Iterating global reduction 0 with 15 rules applied. Total rules applied 64 place count 915 transition count 1233
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 72 place count 915 transition count 1225
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 910 transition count 1220
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 910 transition count 1220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 87 place count 910 transition count 1215
Applied a total of 87 rules in 101 ms. Remains 910 /947 variables (removed 37) and now considering 1215/1265 (removed 50) transitions.
// Phase 1: matrix 1215 rows 910 cols
[2024-05-31 19:20:29] [INFO ] Computed 18 invariants in 25 ms
[2024-05-31 19:20:30] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-31 19:20:30] [INFO ] Invariant cache hit.
[2024-05-31 19:20:31] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
Running 1214 sub problems to find dead transitions.
[2024-05-31 19:20:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/909 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (OVERLAPS) 1/910 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1214 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 910/2125 variables, and 18 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/910 constraints, PredecessorRefiner: 1214/1214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/909 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (OVERLAPS) 1/910 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1214 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 910/2125 variables, and 18 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/910 constraints, PredecessorRefiner: 0/1214 constraints, Known Traps: 0/0 constraints]
After SMT, in 61376ms problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 61391ms
Starting structural reductions in LTL mode, iteration 1 : 910/947 places, 1215/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62670 ms. Remains : 910/947 places, 1215/1265 transitions.
Stuttering acceptance computed with spot in 474 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Product exploration explored 100000 steps with 50000 reset in 313 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2 p3), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p3), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 26 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-00 finished in 63910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Graph (trivial) has 863 edges and 947 vertex of which 84 / 947 are part of one of the 14 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 876 transition count 1110
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 86 rules applied. Total rules applied 171 place count 792 transition count 1108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 791 transition count 1108
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 172 place count 791 transition count 1068
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 252 place count 751 transition count 1068
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 298 place count 705 transition count 1022
Iterating global reduction 3 with 46 rules applied. Total rules applied 344 place count 705 transition count 1022
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 344 place count 705 transition count 1021
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 346 place count 704 transition count 1021
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 356 place count 694 transition count 1011
Iterating global reduction 3 with 10 rules applied. Total rules applied 366 place count 694 transition count 1011
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 376 place count 694 transition count 1001
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 582 place count 591 transition count 898
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 586 place count 587 transition count 894
Iterating global reduction 4 with 4 rules applied. Total rules applied 590 place count 587 transition count 894
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 594 place count 587 transition count 890
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 598 place count 585 transition count 890
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 616 place count 585 transition count 872
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 618 place count 583 transition count 870
Applied a total of 618 rules in 418 ms. Remains 583 /947 variables (removed 364) and now considering 870/1265 (removed 395) transitions.
[2024-05-31 19:21:34] [INFO ] Flow matrix only has 841 transitions (discarded 29 similar events)
// Phase 1: matrix 841 rows 583 cols
[2024-05-31 19:21:34] [INFO ] Computed 18 invariants in 15 ms
[2024-05-31 19:21:34] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-31 19:21:34] [INFO ] Flow matrix only has 841 transitions (discarded 29 similar events)
[2024-05-31 19:21:34] [INFO ] Invariant cache hit.
[2024-05-31 19:21:35] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2024-05-31 19:21:35] [INFO ] Redundant transitions in 47 ms returned []
Running 403 sub problems to find dead transitions.
[2024-05-31 19:21:35] [INFO ] Flow matrix only has 841 transitions (discarded 29 similar events)
[2024-05-31 19:21:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 16/583 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (OVERLAPS) 840/1423 variables, 583/601 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1423 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 0/1423 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1423/1424 variables, and 601 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 16/583 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (OVERLAPS) 840/1423 variables, 583/601 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1423 variables, 403/1004 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1423 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 403 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 1423/1424 variables, and 1004 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints]
After SMT, in 60371ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60375ms
Starting structural reductions in SI_LTL mode, iteration 1 : 583/947 places, 870/1265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61755 ms. Remains : 583/947 places, 870/1265 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-02 finished in 61897 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 947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Graph (trivial) has 894 edges and 947 vertex of which 97 / 947 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 865 transition count 1099
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 167 place count 782 transition count 1099
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 167 place count 782 transition count 1062
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 241 place count 745 transition count 1062
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 289 place count 697 transition count 1014
Iterating global reduction 2 with 48 rules applied. Total rules applied 337 place count 697 transition count 1014
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 337 place count 697 transition count 1013
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 339 place count 696 transition count 1013
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 349 place count 686 transition count 1003
Iterating global reduction 2 with 10 rules applied. Total rules applied 359 place count 686 transition count 1003
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 369 place count 686 transition count 993
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 565 place count 588 transition count 895
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 569 place count 584 transition count 891
Iterating global reduction 3 with 4 rules applied. Total rules applied 573 place count 584 transition count 891
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 577 place count 584 transition count 887
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 593 place count 584 transition count 871
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 595 place count 582 transition count 869
Applied a total of 595 rules in 284 ms. Remains 582 /947 variables (removed 365) and now considering 869/1265 (removed 396) transitions.
[2024-05-31 19:22:35] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
// Phase 1: matrix 838 rows 582 cols
[2024-05-31 19:22:35] [INFO ] Computed 18 invariants in 18 ms
[2024-05-31 19:22:36] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-31 19:22:36] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-31 19:22:36] [INFO ] Invariant cache hit.
[2024-05-31 19:22:36] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
[2024-05-31 19:22:36] [INFO ] Redundant transitions in 46 ms returned []
Running 371 sub problems to find dead transitions.
[2024-05-31 19:22:36] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-31 19:22:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 837/1419 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (OVERLAPS) 0/1419 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1420 variables, and 600 constraints, problems are : Problem set: 0 solved, 371 unsolved in 29164 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 837/1419 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 371/971 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 371 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 1419/1420 variables, and 971 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
After SMT, in 59560ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 59564ms
Starting structural reductions in SI_LTL mode, iteration 1 : 582/947 places, 869/1265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60727 ms. Remains : 582/947 places, 869/1265 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-04
Product exploration explored 100000 steps with 4454 reset in 1007 ms.
Product exploration explored 100000 steps with 4442 reset in 934 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1823 resets) in 961 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 754056 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 754056 steps, saw 178526 distinct states, run finished after 3004 ms. (steps per millisecond=251 ) properties seen :0
[2024-05-31 19:23:41] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-31 19:23:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/228 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 452/680 variables, 228/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 544/1224 variables, 256/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1224 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/1320 variables, 16/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1320 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 96/1416 variables, 96/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:23:42] [INFO ] Deduced a trap composed of 246 places in 157 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1416 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1416 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/1419 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1419 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1419 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1419 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1420 variables, and 601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/228 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 452/680 variables, 228/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/680 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 544/1224 variables, 256/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1224 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 96/1320 variables, 16/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1320 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 96/1416 variables, 96/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1416 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1419 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1419 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1419 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1419 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1419/1420 variables, and 602 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 960ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 869/869 transitions.
Applied a total of 0 rules in 39 ms. Remains 582 /582 variables (removed 0) and now considering 869/869 (removed 0) transitions.
[2024-05-31 19:23:43] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-31 19:23:43] [INFO ] Invariant cache hit.
[2024-05-31 19:23:43] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-31 19:23:43] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-31 19:23:43] [INFO ] Invariant cache hit.
[2024-05-31 19:23:43] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2024-05-31 19:23:43] [INFO ] Redundant transitions in 6 ms returned []
Running 371 sub problems to find dead transitions.
[2024-05-31 19:23:43] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-31 19:23:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 837/1419 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (OVERLAPS) 0/1419 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1420 variables, and 600 constraints, problems are : Problem set: 0 solved, 371 unsolved in 29906 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 837/1419 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 371/971 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1419/1420 variables, and 971 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
After SMT, in 60278ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61095 ms. Remains : 582/582 places, 869/869 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1818 resets) in 474 ms. (84 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 751815 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :0 out of 1
Probabilistic random walk after 751815 steps, saw 177938 distinct states, run finished after 3002 ms. (steps per millisecond=250 ) properties seen :0
[2024-05-31 19:24:47] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-31 19:24:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/228 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 452/680 variables, 228/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 544/1224 variables, 256/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1224 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/1320 variables, 16/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1320 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 96/1416 variables, 96/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:24:47] [INFO ] Deduced a trap composed of 246 places in 163 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1416 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1416 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/1419 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1419 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1419 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1419 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1420 variables, and 601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/228 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 452/680 variables, 228/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/680 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 544/1224 variables, 256/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1224 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 96/1320 variables, 16/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1320 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 96/1416 variables, 96/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1416 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1419 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1419 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1419 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1419 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1419/1420 variables, and 602 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 901ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4448 reset in 786 ms.
Product exploration explored 100000 steps with 4445 reset in 835 ms.
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 869/869 transitions.
Applied a total of 0 rules in 33 ms. Remains 582 /582 variables (removed 0) and now considering 869/869 (removed 0) transitions.
[2024-05-31 19:24:50] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-31 19:24:50] [INFO ] Invariant cache hit.
[2024-05-31 19:24:50] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-31 19:24:50] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-31 19:24:50] [INFO ] Invariant cache hit.
[2024-05-31 19:24:51] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2024-05-31 19:24:51] [INFO ] Redundant transitions in 6 ms returned []
Running 371 sub problems to find dead transitions.
[2024-05-31 19:24:51] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-31 19:24:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 837/1419 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (OVERLAPS) 0/1419 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1420 variables, and 600 constraints, problems are : Problem set: 0 solved, 371 unsolved in 29578 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 837/1419 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 371/971 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1419/1420 variables, and 971 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
After SMT, in 60005ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60012ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60891 ms. Remains : 582/582 places, 869/869 transitions.
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-04 finished in 195645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||G((F(p0) U p2)))))'
Support contains 3 out of 947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Graph (trivial) has 668 edges and 947 vertex of which 97 / 947 are part of one of the 16 SCC in 0 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 865 transition count 1100
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 783 transition count 1100
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 165 place count 783 transition count 1062
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 241 place count 745 transition count 1062
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 288 place count 698 transition count 1015
Iterating global reduction 2 with 47 rules applied. Total rules applied 335 place count 698 transition count 1015
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 345 place count 688 transition count 1005
Iterating global reduction 2 with 10 rules applied. Total rules applied 355 place count 688 transition count 1005
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 364 place count 688 transition count 996
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 560 place count 590 transition count 898
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 563 place count 587 transition count 895
Iterating global reduction 3 with 3 rules applied. Total rules applied 566 place count 587 transition count 895
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 569 place count 587 transition count 892
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 571 place count 585 transition count 890
Applied a total of 571 rules in 121 ms. Remains 585 /947 variables (removed 362) and now considering 890/1265 (removed 375) transitions.
[2024-05-31 19:25:51] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
// Phase 1: matrix 844 rows 585 cols
[2024-05-31 19:25:51] [INFO ] Computed 18 invariants in 10 ms
[2024-05-31 19:25:51] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-31 19:25:51] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-31 19:25:51] [INFO ] Invariant cache hit.
[2024-05-31 19:25:52] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
[2024-05-31 19:25:52] [INFO ] Redundant transitions in 21 ms returned []
Running 614 sub problems to find dead transitions.
[2024-05-31 19:25:52] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-31 19:25:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 614 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 1428/1429 variables, and 603 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 614/1217 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 1217 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints]
After SMT, in 61333ms problems are : Problem set: 0 solved, 614 unsolved
Search for dead transitions found 0 dead transitions in 61339ms
Starting structural reductions in SI_LTL mode, iteration 1 : 585/947 places, 890/1265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62322 ms. Remains : 585/947 places, 890/1265 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-05
Product exploration explored 100000 steps with 5447 reset in 713 ms.
Product exploration explored 100000 steps with 5453 reset in 721 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
Knowledge based reduction with 9 factoid took 342 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (1750 resets) in 569 ms. (70 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 22 ms. (1739 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (14 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (15 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
[2024-05-31 19:26:55] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-31 19:26:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 249/252 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 511/763 variables, 252/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 620/1383 variables, 288/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1383 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1383 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 45/1428 variables, 15/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1428 variables, 45/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 603 constraints, problems are : Problem set: 0 solved, 4 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 249/252 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 511/763 variables, 252/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 620/1383 variables, 288/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1383 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1383 variables, 4/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1383 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 45/1428 variables, 15/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1428 variables, 45/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 607 constraints, problems are : Problem set: 0 solved, 4 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1526ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=13 )
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 4 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 p2))), (F p0), (F p1), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 540 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 890/890 transitions.
Applied a total of 0 rules in 26 ms. Remains 585 /585 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-31 19:26:58] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-31 19:26:58] [INFO ] Invariant cache hit.
[2024-05-31 19:26:58] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-31 19:26:58] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-31 19:26:58] [INFO ] Invariant cache hit.
[2024-05-31 19:26:59] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2024-05-31 19:26:59] [INFO ] Redundant transitions in 25 ms returned []
Running 614 sub problems to find dead transitions.
[2024-05-31 19:26:59] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-31 19:26:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 603 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 614/1217 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 1217 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints]
After SMT, in 61197ms problems are : Problem set: 0 solved, 614 unsolved
Search for dead transitions found 0 dead transitions in 61203ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62044 ms. Remains : 585/585 places, 890/890 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
Knowledge based reduction with 9 factoid took 333 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (1739 resets) in 1280 ms. (31 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 29 ms. (1333 steps per ms) remains 4/4 properties
[2024-05-31 19:28:01] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-31 19:28:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 249/252 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 511/763 variables, 252/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 620/1383 variables, 288/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1383 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1383 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 45/1428 variables, 15/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1428 variables, 45/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 603 constraints, problems are : Problem set: 0 solved, 4 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 249/252 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 511/763 variables, 252/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 620/1383 variables, 288/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1383 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1383 variables, 4/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1383 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 45/1428 variables, 15/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1428 variables, 45/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 607 constraints, problems are : Problem set: 0 solved, 4 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1534ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=13 )
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 4 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 p2))), (F p0), (F p1), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 496 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5437 reset in 714 ms.
Product exploration explored 100000 steps with 5444 reset in 714 ms.
Support contains 3 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 890/890 transitions.
Applied a total of 0 rules in 18 ms. Remains 585 /585 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-31 19:28:05] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-31 19:28:05] [INFO ] Invariant cache hit.
[2024-05-31 19:28:05] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-31 19:28:05] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-31 19:28:05] [INFO ] Invariant cache hit.
[2024-05-31 19:28:05] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2024-05-31 19:28:05] [INFO ] Redundant transitions in 10 ms returned []
Running 614 sub problems to find dead transitions.
[2024-05-31 19:28:05] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-31 19:28:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 603 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 614/1217 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 1217 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints]
After SMT, in 61154ms problems are : Problem set: 0 solved, 614 unsolved
Search for dead transitions found 0 dead transitions in 61160ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61972 ms. Remains : 585/585 places, 890/890 transitions.
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-05 finished in 195834 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((G(p0)||(p0&&F(!p1)))))))'
Support contains 2 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 929 transition count 1247
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 929 transition count 1247
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 52 place count 913 transition count 1231
Iterating global reduction 0 with 16 rules applied. Total rules applied 68 place count 913 transition count 1231
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 76 place count 913 transition count 1223
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 907 transition count 1217
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 907 transition count 1217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 93 place count 907 transition count 1212
Applied a total of 93 rules in 79 ms. Remains 907 /947 variables (removed 40) and now considering 1212/1265 (removed 53) transitions.
// Phase 1: matrix 1212 rows 907 cols
[2024-05-31 19:29:07] [INFO ] Computed 18 invariants in 19 ms
[2024-05-31 19:29:07] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-31 19:29:07] [INFO ] Invariant cache hit.
[2024-05-31 19:29:08] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
Running 1211 sub problems to find dead transitions.
[2024-05-31 19:29:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/2119 variables, and 18 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 1211/1211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1211 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 907/2119 variables, and 18 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 0/1211 constraints, Known Traps: 0/0 constraints]
After SMT, in 61205ms problems are : Problem set: 0 solved, 1211 unsolved
Search for dead transitions found 0 dead transitions in 61218ms
Starting structural reductions in LTL mode, iteration 1 : 907/947 places, 1212/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62363 ms. Remains : 907/947 places, 1212/1265 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 192 ms.
Product exploration explored 100000 steps with 33333 reset in 220 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-06 finished in 62977 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' '!((p0 U (p1||X((G(F(p0)) U p2)))))'
Support contains 3 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 930 transition count 1248
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 930 transition count 1248
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 49 place count 915 transition count 1233
Iterating global reduction 0 with 15 rules applied. Total rules applied 64 place count 915 transition count 1233
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 71 place count 915 transition count 1226
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 77 place count 909 transition count 1220
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 909 transition count 1220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 88 place count 909 transition count 1215
Applied a total of 88 rules in 69 ms. Remains 909 /947 variables (removed 38) and now considering 1215/1265 (removed 50) transitions.
// Phase 1: matrix 1215 rows 909 cols
[2024-05-31 19:30:10] [INFO ] Computed 18 invariants in 21 ms
[2024-05-31 19:30:10] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-31 19:30:10] [INFO ] Invariant cache hit.
[2024-05-31 19:30:11] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
Running 1214 sub problems to find dead transitions.
[2024-05-31 19:30:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (OVERLAPS) 1/909 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1214 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 909/2124 variables, and 18 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/909 constraints, PredecessorRefiner: 1214/1214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (OVERLAPS) 1/909 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 909/2124 variables, and 18 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/909 constraints, PredecessorRefiner: 0/1214 constraints, Known Traps: 0/0 constraints]
After SMT, in 61243ms problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 61254ms
Starting structural reductions in LTL mode, iteration 1 : 909/947 places, 1215/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62386 ms. Remains : 909/947 places, 1215/1265 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-07
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-07 finished in 62649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 2 out of 947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Graph (trivial) has 878 edges and 947 vertex of which 91 / 947 are part of one of the 15 SCC in 2 ms
Free SCC test removed 76 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 870 transition count 1105
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 788 transition count 1105
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 165 place count 788 transition count 1066
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 243 place count 749 transition count 1066
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 290 place count 702 transition count 1019
Iterating global reduction 2 with 47 rules applied. Total rules applied 337 place count 702 transition count 1019
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 337 place count 702 transition count 1018
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 339 place count 701 transition count 1018
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 349 place count 691 transition count 1008
Iterating global reduction 2 with 10 rules applied. Total rules applied 359 place count 691 transition count 1008
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 369 place count 691 transition count 998
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 569 place count 591 transition count 898
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 573 place count 587 transition count 894
Iterating global reduction 3 with 4 rules applied. Total rules applied 577 place count 587 transition count 894
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 581 place count 587 transition count 890
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 583 place count 586 transition count 890
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 600 place count 586 transition count 873
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 601 place count 586 transition count 873
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 603 place count 584 transition count 871
Applied a total of 603 rules in 296 ms. Remains 584 /947 variables (removed 363) and now considering 871/1265 (removed 394) transitions.
[2024-05-31 19:31:12] [INFO ] Flow matrix only has 841 transitions (discarded 30 similar events)
// Phase 1: matrix 841 rows 584 cols
[2024-05-31 19:31:13] [INFO ] Computed 18 invariants in 19 ms
[2024-05-31 19:31:13] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-31 19:31:13] [INFO ] Flow matrix only has 841 transitions (discarded 30 similar events)
[2024-05-31 19:31:13] [INFO ] Invariant cache hit.
[2024-05-31 19:31:13] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
[2024-05-31 19:31:13] [INFO ] Redundant transitions in 9 ms returned []
Running 388 sub problems to find dead transitions.
[2024-05-31 19:31:13] [INFO ] Flow matrix only has 841 transitions (discarded 30 similar events)
[2024-05-31 19:31:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 388 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1425 variables, and 602 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 388/990 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1424 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1424/1425 variables, and 990 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Starting structural reductions in SI_LTL mode, iteration 1 : 584/947 places, 871/1265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61538 ms. Remains : 584/947 places, 871/1265 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-08 finished in 61633 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 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 929 transition count 1247
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 929 transition count 1247
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 52 place count 913 transition count 1231
Iterating global reduction 0 with 16 rules applied. Total rules applied 68 place count 913 transition count 1231
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 76 place count 913 transition count 1223
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 907 transition count 1217
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 907 transition count 1217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 93 place count 907 transition count 1212
Applied a total of 93 rules in 68 ms. Remains 907 /947 variables (removed 40) and now considering 1212/1265 (removed 53) transitions.
// Phase 1: matrix 1212 rows 907 cols
[2024-05-31 19:32:14] [INFO ] Computed 18 invariants in 23 ms
[2024-05-31 19:32:14] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-31 19:32:14] [INFO ] Invariant cache hit.
[2024-05-31 19:32:15] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
Running 1211 sub problems to find dead transitions.
[2024-05-31 19:32:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1211 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 907/2119 variables, and 18 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 1211/1211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/2119 variables, and 18 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 0/1211 constraints, Known Traps: 0/0 constraints]
After SMT, in 61159ms problems are : Problem set: 0 solved, 1211 unsolved
Search for dead transitions found 0 dead transitions in 61170ms
Starting structural reductions in LTL mode, iteration 1 : 907/947 places, 1212/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62279 ms. Remains : 907/947 places, 1212/1265 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-10
Product exploration explored 100000 steps with 887 reset in 209 ms.
Product exploration explored 100000 steps with 891 reset in 220 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (355 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (33 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 590002 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 1
Probabilistic random walk after 590002 steps, saw 170886 distinct states, run finished after 3002 ms. (steps per millisecond=196 ) properties seen :0
[2024-05-31 19:33:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 231/232 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 675/907 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/907 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1212/2119 variables, 907/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2119 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2119 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2119/2119 variables, and 925 constraints, problems are : Problem set: 0 solved, 1 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 907/907 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 231/232 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 675/907 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/907 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1212/2119 variables, 907/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2119 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2119 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2119 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2119/2119 variables, and 926 constraints, problems are : Problem set: 0 solved, 1 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 907/907 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 901ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 95 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16b-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-10 finished in 67058 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 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 928 transition count 1246
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 928 transition count 1246
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 55 place count 911 transition count 1229
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 911 transition count 1229
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 81 place count 911 transition count 1220
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 905 transition count 1214
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 905 transition count 1214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 98 place count 905 transition count 1209
Applied a total of 98 rules in 68 ms. Remains 905 /947 variables (removed 42) and now considering 1209/1265 (removed 56) transitions.
// Phase 1: matrix 1209 rows 905 cols
[2024-05-31 19:33:21] [INFO ] Computed 18 invariants in 21 ms
[2024-05-31 19:33:21] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-31 19:33:21] [INFO ] Invariant cache hit.
[2024-05-31 19:33:22] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
Running 1208 sub problems to find dead transitions.
[2024-05-31 19:33:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1208 unsolved
At refinement iteration 1 (OVERLAPS) 1/905 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1208 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 905/2114 variables, and 18 constraints, problems are : Problem set: 0 solved, 1208 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 1208/1208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1208 unsolved
At refinement iteration 1 (OVERLAPS) 1/905 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1208 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 905/2114 variables, and 18 constraints, problems are : Problem set: 0 solved, 1208 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 0/1208 constraints, Known Traps: 0/0 constraints]
After SMT, in 61174ms problems are : Problem set: 0 solved, 1208 unsolved
Search for dead transitions found 0 dead transitions in 61186ms
Starting structural reductions in LTL mode, iteration 1 : 905/947 places, 1209/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62336 ms. Remains : 905/947 places, 1209/1265 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2296 steps with 20 reset in 10 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-11 finished in 62462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 928 transition count 1246
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 928 transition count 1246
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 55 place count 911 transition count 1229
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 911 transition count 1229
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 81 place count 911 transition count 1220
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 905 transition count 1214
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 905 transition count 1214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 98 place count 905 transition count 1209
Applied a total of 98 rules in 69 ms. Remains 905 /947 variables (removed 42) and now considering 1209/1265 (removed 56) transitions.
[2024-05-31 19:34:23] [INFO ] Invariant cache hit.
[2024-05-31 19:34:24] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-31 19:34:24] [INFO ] Invariant cache hit.
[2024-05-31 19:34:25] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
Running 1208 sub problems to find dead transitions.
[2024-05-31 19:34:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1208 unsolved
At refinement iteration 1 (OVERLAPS) 1/905 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1208 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 905/2114 variables, and 18 constraints, problems are : Problem set: 0 solved, 1208 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 1208/1208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1208 unsolved
At refinement iteration 1 (OVERLAPS) 1/905 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1208 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 905/2114 variables, and 18 constraints, problems are : Problem set: 0 solved, 1208 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 0/1208 constraints, Known Traps: 0/0 constraints]
After SMT, in 61471ms problems are : Problem set: 0 solved, 1208 unsolved
Search for dead transitions found 0 dead transitions in 61484ms
Starting structural reductions in LTL mode, iteration 1 : 905/947 places, 1209/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62638 ms. Remains : 905/947 places, 1209/1265 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-12
Stuttering criterion allowed to conclude after 379 steps with 3 reset in 2 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-12 finished in 62747 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)||X(p1))))'
Support contains 3 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 930 transition count 1248
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 930 transition count 1248
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 49 place count 915 transition count 1233
Iterating global reduction 0 with 15 rules applied. Total rules applied 64 place count 915 transition count 1233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 73 place count 915 transition count 1224
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 911 transition count 1220
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 911 transition count 1220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 911 transition count 1217
Applied a total of 84 rules in 83 ms. Remains 911 /947 variables (removed 36) and now considering 1217/1265 (removed 48) transitions.
// Phase 1: matrix 1217 rows 911 cols
[2024-05-31 19:35:26] [INFO ] Computed 18 invariants in 18 ms
[2024-05-31 19:35:27] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-31 19:35:27] [INFO ] Invariant cache hit.
[2024-05-31 19:35:27] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Running 1216 sub problems to find dead transitions.
[2024-05-31 19:35:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (OVERLAPS) 1/911 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 911/2128 variables, and 18 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/911 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (OVERLAPS) 1/911 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 911/2128 variables, and 18 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/911 constraints, PredecessorRefiner: 0/1216 constraints, Known Traps: 0/0 constraints]
After SMT, in 61410ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 61423ms
Starting structural reductions in LTL mode, iteration 1 : 911/947 places, 1217/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62653 ms. Remains : 911/947 places, 1217/1265 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-13
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-13 finished in 62831 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' '!((p0 U X(p1)))'
Support contains 4 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 932 transition count 1250
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 932 transition count 1250
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 44 place count 918 transition count 1236
Iterating global reduction 0 with 14 rules applied. Total rules applied 58 place count 918 transition count 1236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 66 place count 918 transition count 1228
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 914 transition count 1224
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 914 transition count 1224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 914 transition count 1221
Applied a total of 77 rules in 66 ms. Remains 914 /947 variables (removed 33) and now considering 1221/1265 (removed 44) transitions.
// Phase 1: matrix 1221 rows 914 cols
[2024-05-31 19:36:29] [INFO ] Computed 18 invariants in 12 ms
[2024-05-31 19:36:29] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-31 19:36:29] [INFO ] Invariant cache hit.
[2024-05-31 19:36:30] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
Running 1220 sub problems to find dead transitions.
[2024-05-31 19:36:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/913 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (OVERLAPS) 1/914 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 914/2135 variables, and 18 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/914 constraints, PredecessorRefiner: 1220/1220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/913 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (OVERLAPS) 1/914 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 914/2135 variables, and 18 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/914 constraints, PredecessorRefiner: 0/1220 constraints, Known Traps: 0/0 constraints]
After SMT, in 61223ms problems are : Problem set: 0 solved, 1220 unsolved
Search for dead transitions found 0 dead transitions in 61236ms
Starting structural reductions in LTL mode, iteration 1 : 914/947 places, 1221/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62354 ms. Remains : 914/947 places, 1221/1265 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Product exploration explored 100000 steps with 50000 reset in 285 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-15 finished in 63075 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||G((F(p0) U p2)))))'
[2024-05-31 19:37:32] [INFO ] Flatten gal took : 52 ms
[2024-05-31 19:37:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 19:37:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 947 places, 1265 transitions and 3727 arcs took 9 ms.
Total runtime 1073564 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

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="FlexibleBarrier-PT-16b"
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 FlexibleBarrier-PT-16b, 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-171640602700108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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