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.r500-smll-171649587500115.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 HirschbergSinclair-PT-40, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587500115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 13 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 580K 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 HirschbergSinclair-PT-40-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717248981310

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:36:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:36:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:36:23] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2024-06-01 13:36:23] [INFO ] Transformed 1068 places.
[2024-06-01 13:36:23] [INFO ] Transformed 982 transitions.
[2024-06-01 13:36:23] [INFO ] Parsed PT model containing 1068 places and 982 transitions and 2991 arcs in 352 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 155 ms.
Working with output stream class java.io.PrintStream
Support contains 56 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 982/982 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 1030 transition count 982
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 73 place count 995 transition count 947
Iterating global reduction 1 with 35 rules applied. Total rules applied 108 place count 995 transition count 947
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 141 place count 962 transition count 914
Iterating global reduction 1 with 33 rules applied. Total rules applied 174 place count 962 transition count 914
Applied a total of 174 rules in 427 ms. Remains 962 /1068 variables (removed 106) and now considering 914/982 (removed 68) transitions.
// Phase 1: matrix 914 rows 962 cols
[2024-06-01 13:36:24] [INFO ] Computed 48 invariants in 49 ms
[2024-06-01 13:36:25] [INFO ] Implicit Places using invariants in 1217 ms returned []
[2024-06-01 13:36:25] [INFO ] Invariant cache hit.
[2024-06-01 13:36:32] [INFO ] Implicit Places using invariants and state equation in 6621 ms returned []
Implicit Place search using SMT with State Equation took 7974 ms to find 0 implicit places.
Running 874 sub problems to find dead transitions.
[2024-06-01 13:36:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/920 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 2 (OVERLAPS) 4/924 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 874 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 924/1876 variables, and 8 constraints, problems are : Problem set: 0 solved, 874 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/962 constraints, PredecessorRefiner: 874/874 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 874 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/920 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 2 (OVERLAPS) 4/924 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/924 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 874 unsolved
SMT process timed out in 60697ms, After SMT, problems are : Problem set: 0 solved, 874 unsolved
Search for dead transitions found 0 dead transitions in 60751ms
Starting structural reductions in LTL mode, iteration 1 : 962/1068 places, 914/982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69201 ms. Remains : 962/1068 places, 914/982 transitions.
Support contains 56 out of 962 places after structural reductions.
[2024-06-01 13:37:33] [INFO ] Flatten gal took : 143 ms
[2024-06-01 13:37:33] [INFO ] Flatten gal took : 86 ms
[2024-06-01 13:37:33] [INFO ] Input system was already deterministic with 914 transitions.
Support contains 55 out of 962 places (down from 56) after GAL structural reductions.
RANDOM walk for 40000 steps (40 resets) in 2752 ms. (14 steps per ms) remains 11/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
[2024-06-01 13:37:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 846/865 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/865 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3/868 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/868 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 17/885 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/885 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 9 (OVERLAPS) 914/1799 variables, 885/933 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1799 variables, 0/933 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 77/1876 variables, 77/1010 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1876 variables, 0/1010 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1876 variables, 0/1010 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1876/1876 variables, and 1010 constraints, problems are : Problem set: 9 solved, 2 unsolved in 2910 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 962/962 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 819/829 variables, 42/43 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/829 variables, 0/43 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/832 variables, 1/44 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 0/44 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 50/882 variables, 4/48 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/882 variables, 0/48 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 914/1796 variables, 882/930 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1796 variables, 1/931 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1796 variables, 0/931 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 80/1876 variables, 80/1011 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1876 variables, 1/1012 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1876 variables, 0/1012 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1876 variables, 0/1012 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1876/1876 variables, and 1012 constraints, problems are : Problem set: 9 solved, 2 unsolved in 2294 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 962/962 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 5250ms problems are : Problem set: 9 solved, 2 unsolved
Parikh walk visited 0 properties in 1308 ms.
Support contains 5 out of 962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 914/914 transitions.
Graph (complete) has 1834 edges and 962 vertex of which 944 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 397 transitions
Trivial Post-agglo rules discarded 397 transitions
Performed 397 trivial Post agglomeration. Transition count delta: 397
Iterating post reduction 0 with 414 rules applied. Total rules applied 415 place count 944 transition count 500
Reduce places removed 397 places and 0 transitions.
Graph (complete) has 965 edges and 547 vertex of which 474 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 400 rules applied. Total rules applied 815 place count 474 transition count 498
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 75 rules applied. Total rules applied 890 place count 472 transition count 425
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 893 place count 469 transition count 422
Iterating global reduction 3 with 3 rules applied. Total rules applied 896 place count 469 transition count 422
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 898 place count 469 transition count 420
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 814 edges and 467 vertex of which 463 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 901 place count 463 transition count 420
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 905 place count 463 transition count 416
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 906 place count 462 transition count 415
Iterating global reduction 6 with 1 rules applied. Total rules applied 907 place count 462 transition count 415
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 6 with 25 rules applied. Total rules applied 932 place count 462 transition count 390
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 957 place count 437 transition count 390
Reduce places removed 39 places and 39 transitions.
Iterating global reduction 7 with 39 rules applied. Total rules applied 996 place count 398 transition count 351
Reduce places removed 17 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 7 with 148 rules applied. Total rules applied 1144 place count 381 transition count 220
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 132 rules applied. Total rules applied 1276 place count 250 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1277 place count 249 transition count 219
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 16 Pre rules applied. Total rules applied 1277 place count 249 transition count 203
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 1309 place count 233 transition count 203
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 1310 place count 232 transition count 203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1310 place count 232 transition count 202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1312 place count 231 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1318 place count 228 transition count 199
Applied a total of 1318 rules in 630 ms. Remains 228 /962 variables (removed 734) and now considering 199/914 (removed 715) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 630 ms. Remains : 228/962 places, 199/914 transitions.
RANDOM walk for 40000 steps (200 resets) in 374 ms. (106 steps per ms) remains 1/2 properties
BEST_FIRST walk for 2313 steps (0 resets) in 6 ms. (330 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-40-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-40-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-40-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 962 stabilizing places and 914 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 962 transition count 914
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 962 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Graph (complete) has 1834 edges and 962 vertex of which 960 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 40 places and 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 409 place count 920 transition count 466
Reduce places removed 408 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 409 rules applied. Total rules applied 818 place count 512 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 819 place count 511 transition count 465
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 826 place count 504 transition count 458
Iterating global reduction 3 with 7 rules applied. Total rules applied 833 place count 504 transition count 458
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 835 place count 504 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 837 place count 502 transition count 456
Applied a total of 837 rules in 280 ms. Remains 502 /962 variables (removed 460) and now considering 456/914 (removed 458) transitions.
// Phase 1: matrix 456 rows 502 cols
[2024-06-01 13:37:43] [INFO ] Computed 46 invariants in 4 ms
[2024-06-01 13:37:43] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-06-01 13:37:43] [INFO ] Invariant cache hit.
[2024-06-01 13:37:45] [INFO ] Implicit Places using invariants and state equation in 2012 ms returned []
Implicit Place search using SMT with State Equation took 2660 ms to find 0 implicit places.
[2024-06-01 13:37:45] [INFO ] Redundant transitions in 31 ms returned []
Running 377 sub problems to find dead transitions.
[2024-06-01 13:37:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 2/425 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 379/804 variables, 425/471 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 804/958 variables, and 471 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 425/502 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 2/425 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 379/804 variables, 425/471 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 377/848 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/804 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(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 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(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 0)
(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 0)
(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 0)
(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 0)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/958 variables, and 848 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 425/502 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in SI_LTL mode, iteration 1 : 502/962 places, 456/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63144 ms. Remains : 502/962 places, 456/914 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-00
Product exploration explored 100000 steps with 251 reset in 533 ms.
Product exploration explored 100000 steps with 251 reset in 499 ms.
Computed a total of 502 stabilizing places and 456 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 502 transition count 456
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1461 steps (0 resets) in 12 ms. (112 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 456/456 transitions.
Applied a total of 0 rules in 30 ms. Remains 502 /502 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2024-06-01 13:38:48] [INFO ] Invariant cache hit.
[2024-06-01 13:38:49] [INFO ] Implicit Places using invariants in 820 ms returned []
[2024-06-01 13:38:49] [INFO ] Invariant cache hit.
[2024-06-01 13:38:51] [INFO ] Implicit Places using invariants and state equation in 2109 ms returned []
Implicit Place search using SMT with State Equation took 2935 ms to find 0 implicit places.
[2024-06-01 13:38:51] [INFO ] Redundant transitions in 10 ms returned []
Running 377 sub problems to find dead transitions.
[2024-06-01 13:38:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 2/425 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 379/804 variables, 425/471 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 804/958 variables, and 471 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 425/502 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 2/425 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 379/804 variables, 425/471 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 377/848 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/804 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 377 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 804/958 variables, and 848 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 425/502 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63069 ms. Remains : 502/502 places, 456/456 transitions.
Computed a total of 502 stabilizing places and 456 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 502 transition count 456
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1496 steps (0 resets) in 11 ms. (124 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 245 reset in 345 ms.
Product exploration explored 100000 steps with 247 reset in 404 ms.
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 456/456 transitions.
Applied a total of 0 rules in 25 ms. Remains 502 /502 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2024-06-01 13:39:52] [INFO ] Invariant cache hit.
[2024-06-01 13:39:53] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-06-01 13:39:53] [INFO ] Invariant cache hit.
[2024-06-01 13:39:55] [INFO ] Implicit Places using invariants and state equation in 2128 ms returned []
Implicit Place search using SMT with State Equation took 2808 ms to find 0 implicit places.
[2024-06-01 13:39:55] [INFO ] Redundant transitions in 5 ms returned []
Running 377 sub problems to find dead transitions.
[2024-06-01 13:39:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 2/425 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 379/804 variables, 425/471 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 804/958 variables, and 471 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 425/502 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 2/425 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 379/804 variables, 425/471 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 377/848 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/804 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/958 variables, and 848 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 425/502 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62945 ms. Remains : 502/502 places, 456/456 transitions.
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-00 finished in 192951 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))'
Support contains 1 out of 962 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Graph (complete) has 1834 edges and 962 vertex of which 960 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 40 places and 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 409 transitions
Trivial Post-agglo rules discarded 409 transitions
Performed 409 trivial Post agglomeration. Transition count delta: 409
Iterating post reduction 0 with 409 rules applied. Total rules applied 410 place count 920 transition count 465
Reduce places removed 409 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 410 rules applied. Total rules applied 820 place count 511 transition count 464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 821 place count 510 transition count 464
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 828 place count 503 transition count 457
Iterating global reduction 3 with 7 rules applied. Total rules applied 835 place count 503 transition count 457
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 837 place count 503 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 839 place count 501 transition count 455
Applied a total of 839 rules in 66 ms. Remains 501 /962 variables (removed 461) and now considering 455/914 (removed 459) transitions.
// Phase 1: matrix 455 rows 501 cols
[2024-06-01 13:40:55] [INFO ] Computed 46 invariants in 4 ms
[2024-06-01 13:40:56] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-06-01 13:40:56] [INFO ] Invariant cache hit.
[2024-06-01 13:40:59] [INFO ] Implicit Places using invariants and state equation in 2518 ms returned []
Implicit Place search using SMT with State Equation took 3185 ms to find 0 implicit places.
[2024-06-01 13:40:59] [INFO ] Redundant transitions in 2 ms returned []
Running 376 sub problems to find dead transitions.
[2024-06-01 13:40:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 2/424 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 378/802 variables, 424/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/956 variables, and 470 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 424/501 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 2/424 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 378/802 variables, 424/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 376/846 constraints. Problems are: Problem set: 0 solved, 376 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 802/956 variables, and 846 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 424/501 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/962 places, 455/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63342 ms. Remains : 501/962 places, 455/914 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-01
Product exploration explored 100000 steps with 498 reset in 503 ms.
Product exploration explored 100000 steps with 497 reset in 561 ms.
Computed a total of 501 stabilizing places and 455 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 455
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 879 steps (0 resets) in 8 ms. (97 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-06-01 13:42:00] [INFO ] Invariant cache hit.
[2024-06-01 13:42:01] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 196 ms returned sat
[2024-06-01 13:42:02] [INFO ] [Real]Absence check using state equation in 1153 ms returned sat
[2024-06-01 13:42:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:42:03] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 336 ms returned sat
[2024-06-01 13:42:04] [INFO ] [Nat]Absence check using state equation in 1013 ms returned sat
[2024-06-01 13:42:04] [INFO ] Computed and/alt/rep : 376/383/376 causal constraints (skipped 0 transitions) in 36 ms.
[2024-06-01 13:42:05] [INFO ] Added : 103 causal constraints over 21 iterations in 779 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 455/455 transitions.
Applied a total of 0 rules in 23 ms. Remains 501 /501 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2024-06-01 13:42:05] [INFO ] Invariant cache hit.
[2024-06-01 13:42:06] [INFO ] Implicit Places using invariants in 762 ms returned []
[2024-06-01 13:42:06] [INFO ] Invariant cache hit.
[2024-06-01 13:42:08] [INFO ] Implicit Places using invariants and state equation in 2498 ms returned []
Implicit Place search using SMT with State Equation took 3267 ms to find 0 implicit places.
[2024-06-01 13:42:08] [INFO ] Redundant transitions in 2 ms returned []
Running 376 sub problems to find dead transitions.
[2024-06-01 13:42:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 2/424 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 378/802 variables, 424/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/956 variables, and 470 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 424/501 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 2/424 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 378/802 variables, 424/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 376/846 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/956 variables, and 846 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 424/501 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63386 ms. Remains : 501/501 places, 455/455 transitions.
Computed a total of 501 stabilizing places and 455 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 455
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 857 steps (0 resets) in 9 ms. (85 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-06-01 13:43:09] [INFO ] Invariant cache hit.
[2024-06-01 13:43:10] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 197 ms returned sat
[2024-06-01 13:43:11] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2024-06-01 13:43:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:43:12] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 337 ms returned sat
[2024-06-01 13:43:13] [INFO ] [Nat]Absence check using state equation in 1015 ms returned sat
[2024-06-01 13:43:13] [INFO ] Computed and/alt/rep : 376/383/376 causal constraints (skipped 0 transitions) in 33 ms.
[2024-06-01 13:43:13] [INFO ] Added : 103 causal constraints over 21 iterations in 727 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 497 reset in 502 ms.
Product exploration explored 100000 steps with 496 reset in 552 ms.
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 455/455 transitions.
Applied a total of 0 rules in 22 ms. Remains 501 /501 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2024-06-01 13:43:15] [INFO ] Invariant cache hit.
[2024-06-01 13:43:15] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-06-01 13:43:15] [INFO ] Invariant cache hit.
[2024-06-01 13:43:18] [INFO ] Implicit Places using invariants and state equation in 2567 ms returned []
Implicit Place search using SMT with State Equation took 3251 ms to find 0 implicit places.
[2024-06-01 13:43:18] [INFO ] Redundant transitions in 3 ms returned []
Running 376 sub problems to find dead transitions.
[2024-06-01 13:43:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 2/424 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 378/802 variables, 424/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/956 variables, and 470 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 424/501 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 2/424 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 378/802 variables, 424/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 376/846 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/956 variables, and 846 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 424/501 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63377 ms. Remains : 501/501 places, 455/455 transitions.
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-01 finished in 202507 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 G(p1)))'
Support contains 3 out of 962 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Graph (complete) has 1834 edges and 962 vertex of which 960 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 40 places and 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 408 place count 920 transition count 467
Reduce places removed 407 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 408 rules applied. Total rules applied 816 place count 513 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 817 place count 512 transition count 466
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 824 place count 505 transition count 459
Iterating global reduction 3 with 7 rules applied. Total rules applied 831 place count 505 transition count 459
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 833 place count 505 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 835 place count 503 transition count 457
Applied a total of 835 rules in 75 ms. Remains 503 /962 variables (removed 459) and now considering 457/914 (removed 457) transitions.
// Phase 1: matrix 457 rows 503 cols
[2024-06-01 13:44:18] [INFO ] Computed 46 invariants in 4 ms
[2024-06-01 13:44:19] [INFO ] Implicit Places using invariants in 817 ms returned []
[2024-06-01 13:44:19] [INFO ] Invariant cache hit.
[2024-06-01 13:44:22] [INFO ] Implicit Places using invariants and state equation in 2716 ms returned []
Implicit Place search using SMT with State Equation took 3536 ms to find 0 implicit places.
[2024-06-01 13:44:22] [INFO ] Redundant transitions in 2 ms returned []
Running 378 sub problems to find dead transitions.
[2024-06-01 13:44:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 2/426 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 378 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 806/960 variables, and 472 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/503 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 2/426 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 378/850 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/960 variables, and 850 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/503 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in SI_LTL mode, iteration 1 : 503/962 places, 457/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63702 ms. Remains : 503/962 places, 457/914 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-03
Stuttering criterion allowed to conclude after 492 steps with 0 reset in 5 ms.
FORMULA HirschbergSinclair-PT-40-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-03 finished in 63825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 962 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 960 transition count 914
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 953 transition count 907
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 953 transition count 907
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 948 transition count 902
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 948 transition count 902
Applied a total of 26 rules in 118 ms. Remains 948 /962 variables (removed 14) and now considering 902/914 (removed 12) transitions.
// Phase 1: matrix 902 rows 948 cols
[2024-06-01 13:45:22] [INFO ] Computed 46 invariants in 8 ms
[2024-06-01 13:45:23] [INFO ] Implicit Places using invariants in 1204 ms returned []
[2024-06-01 13:45:23] [INFO ] Invariant cache hit.
[2024-06-01 13:45:30] [INFO ] Implicit Places using invariants and state equation in 6922 ms returned []
Implicit Place search using SMT with State Equation took 8134 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2024-06-01 13:45:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 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 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60354ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Starting structural reductions in LTL mode, iteration 1 : 948/962 places, 902/914 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68634 ms. Remains : 948/962 places, 902/914 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 539 ms.
Product exploration explored 100000 steps with 50000 reset in 576 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
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 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-05 finished in 70220 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 G(p1))||G(F(p2))))'
Support contains 6 out of 962 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Graph (complete) has 1834 edges and 962 vertex of which 960 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 40 places and 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 402 transitions
Trivial Post-agglo rules discarded 402 transitions
Performed 402 trivial Post agglomeration. Transition count delta: 402
Iterating post reduction 0 with 402 rules applied. Total rules applied 403 place count 920 transition count 472
Reduce places removed 402 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 405 rules applied. Total rules applied 808 place count 518 transition count 469
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 811 place count 515 transition count 469
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 817 place count 509 transition count 463
Iterating global reduction 3 with 6 rules applied. Total rules applied 823 place count 509 transition count 463
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 3 with 1 rules applied. Total rules applied 824 place count 509 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 825 place count 508 transition count 462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 827 place count 507 transition count 461
Applied a total of 827 rules in 75 ms. Remains 507 /962 variables (removed 455) and now considering 461/914 (removed 453) transitions.
// Phase 1: matrix 461 rows 507 cols
[2024-06-01 13:46:32] [INFO ] Computed 46 invariants in 4 ms
[2024-06-01 13:46:33] [INFO ] Implicit Places using invariants in 830 ms returned []
[2024-06-01 13:46:33] [INFO ] Invariant cache hit.
[2024-06-01 13:46:36] [INFO ] Implicit Places using invariants and state equation in 2899 ms returned []
Implicit Place search using SMT with State Equation took 3732 ms to find 0 implicit places.
[2024-06-01 13:46:36] [INFO ] Redundant transitions in 3 ms returned []
Running 382 sub problems to find dead transitions.
[2024-06-01 13:46:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/430 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 386/816 variables, 430/476 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/816 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 4/820 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/968 variables, and 479 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 433/507 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/430 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 386/816 variables, 430/476 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/816 variables, 374/850 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/968 variables, and 850 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 430/507 constraints, PredecessorRefiner: 374/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in SI_LTL mode, iteration 1 : 507/962 places, 461/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63908 ms. Remains : 507/962 places, 461/914 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-06
Product exploration explored 100000 steps with 200 reset in 332 ms.
Product exploration explored 100000 steps with 200 reset in 386 ms.
Computed a total of 507 stabilizing places and 461 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 461
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 706 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (76 resets) in 241 ms. (165 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
[2024-06-01 13:47:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 376/380 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/430 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 386/816 variables, 430/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/816 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/820 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/820 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/968 variables, and 479 constraints, problems are : Problem set: 0 solved, 1 unsolved in 395 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 433/507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 376/380 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/430 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 816/968 variables, and 476 constraints, problems are : Problem set: 1 solved, 0 unsolved in 316 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 430/507 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 730ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 26 factoid took 1100 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 4 out of 507 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 461/461 transitions.
Applied a total of 0 rules in 23 ms. Remains 507 /507 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2024-06-01 13:47:40] [INFO ] Invariant cache hit.
[2024-06-01 13:47:41] [INFO ] Implicit Places using invariants in 816 ms returned []
[2024-06-01 13:47:41] [INFO ] Invariant cache hit.
[2024-06-01 13:47:44] [INFO ] Implicit Places using invariants and state equation in 2666 ms returned []
Implicit Place search using SMT with State Equation took 3486 ms to find 0 implicit places.
[2024-06-01 13:47:44] [INFO ] Redundant transitions in 2 ms returned []
Running 382 sub problems to find dead transitions.
[2024-06-01 13:47:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/430 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 386/816 variables, 430/476 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/816 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 4/820 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/968 variables, and 479 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 433/507 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/430 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 386/816 variables, 430/476 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/816 variables, 374/850 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/968 variables, and 850 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 430/507 constraints, PredecessorRefiner: 374/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63605 ms. Remains : 507/507 places, 461/461 transitions.
Computed a total of 507 stabilizing places and 461 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 461
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (76 resets) in 141 ms. (281 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
[2024-06-01 13:48:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 376/380 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/430 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 386/816 variables, 430/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/816 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/820 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/820 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/968 variables, and 479 constraints, problems are : Problem set: 0 solved, 1 unsolved in 393 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 433/507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 376/380 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/430 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 816/968 variables, and 476 constraints, problems are : Problem set: 1 solved, 0 unsolved in 339 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 430/507 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 741ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 342 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 200 reset in 335 ms.
Product exploration explored 100000 steps with 200 reset in 550 ms.
Support contains 4 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 507 transition count 459
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 505 transition count 459
Applied a total of 4 rules in 29 ms. Remains 505 /507 variables (removed 2) and now considering 459/461 (removed 2) transitions.
// Phase 1: matrix 459 rows 505 cols
[2024-06-01 13:48:47] [INFO ] Computed 46 invariants in 3 ms
[2024-06-01 13:48:47] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-06-01 13:48:47] [INFO ] Invariant cache hit.
[2024-06-01 13:48:50] [INFO ] Implicit Places using invariants and state equation in 2643 ms returned []
Implicit Place search using SMT with State Equation took 3281 ms to find 0 implicit places.
[2024-06-01 13:48:50] [INFO ] Redundant transitions in 2 ms returned []
Running 380 sub problems to find dead transitions.
[2024-06-01 13:48:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 2/428 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/811 variables, 428/474 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 6 (OVERLAPS) 1/812 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 812/964 variables, and 475 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 429/505 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 2/428 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/811 variables, 428/474 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 380/854 constraints. Problems are: Problem set: 0 solved, 380 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 811/964 variables, and 854 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 428/505 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in SI_LTL mode, iteration 1 : 505/507 places, 459/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63410 ms. Remains : 505/507 places, 459/461 transitions.
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-06 finished in 198175 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 962 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Graph (complete) has 1834 edges and 962 vertex of which 960 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 40 places and 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 410 transitions
Trivial Post-agglo rules discarded 410 transitions
Performed 410 trivial Post agglomeration. Transition count delta: 410
Iterating post reduction 0 with 410 rules applied. Total rules applied 411 place count 920 transition count 464
Reduce places removed 410 places and 0 transitions.
Iterating post reduction 1 with 410 rules applied. Total rules applied 821 place count 510 transition count 464
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 828 place count 503 transition count 457
Iterating global reduction 2 with 7 rules applied. Total rules applied 835 place count 503 transition count 457
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 837 place count 503 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 839 place count 501 transition count 455
Applied a total of 839 rules in 51 ms. Remains 501 /962 variables (removed 461) and now considering 455/914 (removed 459) transitions.
// Phase 1: matrix 455 rows 501 cols
[2024-06-01 13:49:50] [INFO ] Computed 46 invariants in 3 ms
[2024-06-01 13:49:51] [INFO ] Implicit Places using invariants in 783 ms returned []
[2024-06-01 13:49:51] [INFO ] Invariant cache hit.
[2024-06-01 13:49:54] [INFO ] Implicit Places using invariants and state equation in 2625 ms returned []
Implicit Place search using SMT with State Equation took 3411 ms to find 0 implicit places.
[2024-06-01 13:49:54] [INFO ] Redundant transitions in 3 ms returned []
Running 376 sub problems to find dead transitions.
[2024-06-01 13:49:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 2/424 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 379/803 variables, 424/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/803 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (OVERLAPS) 3/806 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 376 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 806/956 variables, and 472 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/501 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 2/424 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 379/803 variables, 424/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/803 variables, 366/836 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/803 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 376 unsolved
SMT process timed out in 60067ms, After SMT, problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/962 places, 455/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63544 ms. Remains : 501/962 places, 455/914 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-07
Product exploration explored 100000 steps with 202 reset in 315 ms.
Product exploration explored 100000 steps with 202 reset in 354 ms.
Computed a total of 501 stabilizing places and 455 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 455
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-07 finished in 64491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 962 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Graph (complete) has 1834 edges and 962 vertex of which 960 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 39 places and 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 399 rules applied. Total rules applied 400 place count 921 transition count 476
Reduce places removed 399 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 522 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 801 place count 521 transition count 475
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 807 place count 515 transition count 469
Iterating global reduction 3 with 6 rules applied. Total rules applied 813 place count 515 transition count 469
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 815 place count 515 transition count 467
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 817 place count 513 transition count 467
Applied a total of 817 rules in 51 ms. Remains 513 /962 variables (removed 449) and now considering 467/914 (removed 447) transitions.
// Phase 1: matrix 467 rows 513 cols
[2024-06-01 13:50:55] [INFO ] Computed 46 invariants in 3 ms
[2024-06-01 13:50:55] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-06-01 13:50:55] [INFO ] Invariant cache hit.
[2024-06-01 13:50:58] [INFO ] Implicit Places using invariants and state equation in 2522 ms returned []
Implicit Place search using SMT with State Equation took 3162 ms to find 0 implicit places.
[2024-06-01 13:50:58] [INFO ] Redundant transitions in 2 ms returned []
Running 391 sub problems to find dead transitions.
[2024-06-01 13:50:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 3/440 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 396/836 variables, 440/486 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 2/838 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 838/980 variables, and 488 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 442/513 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 3/440 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 396/836 variables, 440/486 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 391/877 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SMT process timed out in 60072ms, After SMT, problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Starting structural reductions in SI_LTL mode, iteration 1 : 513/962 places, 467/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63299 ms. Remains : 513/962 places, 467/914 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-08
Product exploration explored 100000 steps with 197 reset in 482 ms.
Product exploration explored 100000 steps with 197 reset in 399 ms.
Computed a total of 513 stabilizing places and 467 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 467
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-08 finished in 64487 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 2 out of 962 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 960 transition count 914
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 953 transition count 907
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 953 transition count 907
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 948 transition count 902
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 948 transition count 902
Applied a total of 26 rules in 113 ms. Remains 948 /962 variables (removed 14) and now considering 902/914 (removed 12) transitions.
// Phase 1: matrix 902 rows 948 cols
[2024-06-01 13:51:59] [INFO ] Computed 46 invariants in 7 ms
[2024-06-01 13:52:00] [INFO ] Implicit Places using invariants in 786 ms returned []
[2024-06-01 13:52:00] [INFO ] Invariant cache hit.
[2024-06-01 13:52:07] [INFO ] Implicit Places using invariants and state equation in 6682 ms returned []
Implicit Place search using SMT with State Equation took 7471 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2024-06-01 13:52:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
SMT process timed out in 30295ms, After SMT, problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 30305ms
Starting structural reductions in LTL mode, iteration 1 : 948/962 places, 902/914 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37891 ms. Remains : 948/962 places, 902/914 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-09
Product exploration explored 100000 steps with 22718 reset in 701 ms.
Product exploration explored 100000 steps with 23512 reset in 697 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 213 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Applied a total of 0 rules in 35 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2024-06-01 13:52:39] [INFO ] Invariant cache hit.
[2024-06-01 13:52:40] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-06-01 13:52:40] [INFO ] Invariant cache hit.
[2024-06-01 13:52:47] [INFO ] Implicit Places using invariants and state equation in 6759 ms returned []
Implicit Place search using SMT with State Equation took 7429 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2024-06-01 13:52:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 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 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 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 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Finished structural reductions in LTL mode , in 1 iterations and 67875 ms. Remains : 948/948 places, 902/902 transitions.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 121 steps (0 resets) in 4 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23222 reset in 628 ms.
Product exploration explored 100000 steps with 23325 reset in 683 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 948 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Performed 407 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 407 rules applied. Total rules applied 407 place count 948 transition count 902
Deduced a syphon composed of 407 places in 5 ms
Applied a total of 407 rules in 134 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2024-06-01 13:53:50] [INFO ] Redundant transitions in 9 ms returned []
Running 862 sub problems to find dead transitions.
// Phase 1: matrix 902 rows 948 cols
[2024-06-01 13:53:50] [INFO ] Computed 46 invariants in 7 ms
[2024-06-01 13:53:50] [INFO ] State equation strengthened by 407 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 697.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 698.0)
(s10 0.0)
(s11 697.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 695.0)
(s16 0.0)
(s17 694.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 689.0)
(s25 1.0)
(s26 688.0)
(s27 1.0)
(s28 0.0)
(s29 688.0)
(s30 687.0)
(s31 1.0)
(s32 0.0)
(s33 688.0)
(s34 0.0)
(s35 687.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 677.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 676.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 674.0)
(s58 672.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 671.0)
(s64 669.0)
(s65 1.0)
(s66 668.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 666.0)
(s72 0.0)
(s73 664.0)
(s74 0.0)
(s75 662.0)
(s76 0.0)
(s77 660.0)
(s78 0.0)
(s79 699.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 698.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 698.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 698.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 696.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 693.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 692.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 691.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 685.0)
(s156 1.0)
(s157 686.0)
(s158 1.0)
(s159 684.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 683.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 682.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 680.0)
(s178 1.0)
(s179 677.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 675.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 672.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 668.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, ReadFeed: 0/407 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 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 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, ReadFeed: 0/407 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60293ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Starting structural reductions in SI_LTL mode, iteration 1 : 948/948 places, 902/902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60455 ms. Remains : 948/948 places, 902/902 transitions.
Support contains 2 out of 948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Applied a total of 0 rules in 38 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 948 cols
[2024-06-01 13:54:51] [INFO ] Computed 46 invariants in 6 ms
[2024-06-01 13:54:51] [INFO ] Implicit Places using invariants in 822 ms returned []
[2024-06-01 13:54:51] [INFO ] Invariant cache hit.
[2024-06-01 13:54:58] [INFO ] Implicit Places using invariants and state equation in 6650 ms returned []
Implicit Place search using SMT with State Equation took 7476 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2024-06-01 13:54:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60330ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60341ms
Finished structural reductions in LTL mode , in 1 iterations and 67856 ms. Remains : 948/948 places, 902/902 transitions.
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-09 finished in 239357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0))) U G(p1)))'
Support contains 7 out of 962 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 961 transition count 914
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 955 transition count 908
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 955 transition count 908
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 951 transition count 904
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 951 transition count 904
Applied a total of 21 rules in 114 ms. Remains 951 /962 variables (removed 11) and now considering 904/914 (removed 10) transitions.
// Phase 1: matrix 904 rows 951 cols
[2024-06-01 13:55:59] [INFO ] Computed 47 invariants in 6 ms
[2024-06-01 13:55:59] [INFO ] Implicit Places using invariants in 832 ms returned []
[2024-06-01 13:55:59] [INFO ] Invariant cache hit.
[2024-06-01 13:56:06] [INFO ] Implicit Places using invariants and state equation in 6685 ms returned []
Implicit Place search using SMT with State Equation took 7521 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2024-06-01 13:56:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 912/1855 variables, and 7 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/912 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
SMT process timed out in 60329ms, After SMT, problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60339ms
Starting structural reductions in LTL mode, iteration 1 : 951/962 places, 904/914 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67977 ms. Remains : 951/962 places, 904/914 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-10
Product exploration explored 100000 steps with 33387 reset in 583 ms.
Product exploration explored 100000 steps with 33263 reset in 634 ms.
Computed a total of 951 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 951 transition count 904
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 134 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 900 steps (0 resets) in 16 ms. (52 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 7 out of 951 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 904/904 transitions.
Applied a total of 0 rules in 36 ms. Remains 951 /951 variables (removed 0) and now considering 904/904 (removed 0) transitions.
[2024-06-01 13:57:09] [INFO ] Invariant cache hit.
[2024-06-01 13:57:10] [INFO ] Implicit Places using invariants in 846 ms returned []
[2024-06-01 13:57:10] [INFO ] Invariant cache hit.
[2024-06-01 13:57:17] [INFO ] Implicit Places using invariants and state equation in 6845 ms returned []
Implicit Place search using SMT with State Equation took 7693 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2024-06-01 13:57:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 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 912/1855 variables, and 7 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/912 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 4 (OVERLAPS) 39/951 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 951/1855 variables, and 47 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 60345ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Finished structural reductions in LTL mode , in 1 iterations and 68087 ms. Remains : 951/951 places, 904/904 transitions.
Computed a total of 951 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 951 transition count 904
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 144 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 942 steps (0 resets) in 12 ms. (72 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 213 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 33311 reset in 565 ms.
Product exploration explored 100000 steps with 33303 reset in 592 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 7 out of 951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 951/951 places, 904/904 transitions.
Performed 403 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 403 rules applied. Total rules applied 403 place count 951 transition count 904
Deduced a syphon composed of 403 places in 5 ms
Applied a total of 403 rules in 60 ms. Remains 951 /951 variables (removed 0) and now considering 904/904 (removed 0) transitions.
[2024-06-01 13:58:20] [INFO ] Redundant transitions in 10 ms returned []
Running 864 sub problems to find dead transitions.
// Phase 1: matrix 904 rows 951 cols
[2024-06-01 13:58:20] [INFO ] Computed 47 invariants in 9 ms
[2024-06-01 13:58:20] [INFO ] State equation strengthened by 403 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 912/1855 variables, and 7 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, ReadFeed: 0/403 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:59:06] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 6 ms to minimize.
Problem TDEAD76 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/912 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/1855 variables, and 8 constraints, problems are : Problem set: 1 solved, 863 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, ReadFeed: 0/403 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 1/1 constraints]
After SMT, in 60276ms problems are : Problem set: 1 solved, 863 unsolved
Search for dead transitions found 1 dead transitions in 60287ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 951/951 places, 903/904 transitions.
Graph (complete) has 2182 edges and 951 vertex of which 950 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Deduced a syphon composed of 402 places in 4 ms
Applied a total of 1 rules in 34 ms. Remains 950 /951 variables (removed 1) and now considering 903/903 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 950/951 places, 903/904 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60401 ms. Remains : 950/951 places, 903/904 transitions.
Support contains 7 out of 951 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 904/904 transitions.
Applied a total of 0 rules in 35 ms. Remains 951 /951 variables (removed 0) and now considering 904/904 (removed 0) transitions.
// Phase 1: matrix 904 rows 951 cols
[2024-06-01 13:59:20] [INFO ] Computed 47 invariants in 5 ms
[2024-06-01 13:59:21] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-06-01 13:59:21] [INFO ] Invariant cache hit.
[2024-06-01 13:59:28] [INFO ] Implicit Places using invariants and state equation in 6882 ms returned []
Implicit Place search using SMT with State Equation took 7770 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2024-06-01 13:59:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 912/1855 variables, and 7 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/912 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
SMT process timed out in 60323ms, After SMT, problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Finished structural reductions in LTL mode , in 1 iterations and 68142 ms. Remains : 951/951 places, 904/904 transitions.
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-10 finished in 270098 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||X(p1)))))'
Support contains 4 out of 962 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 960 transition count 914
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 954 transition count 908
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 954 transition count 908
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 950 transition count 904
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 950 transition count 904
Applied a total of 22 rules in 112 ms. Remains 950 /962 variables (removed 12) and now considering 904/914 (removed 10) transitions.
// Phase 1: matrix 904 rows 950 cols
[2024-06-01 14:00:29] [INFO ] Computed 46 invariants in 5 ms
[2024-06-01 14:00:30] [INFO ] Implicit Places using invariants in 886 ms returned []
[2024-06-01 14:00:30] [INFO ] Invariant cache hit.
[2024-06-01 14:00:36] [INFO ] Implicit Places using invariants and state equation in 6810 ms returned []
Implicit Place search using SMT with State Equation took 7705 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2024-06-01 14:00:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 40/950 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 950/1854 variables, and 46 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 40/950 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
(s258 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 697)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 698)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 695)
(s16 693)
(s17 1)
(s18 0)
(s19 693)
(s20 0)
(s21 692)
(s22 0)
(s23 1)
(s24 689)
(s25 1)
(s26 0)
(s27 689)
(s28 0)
(s29 1)
(s30 0)
(s31 688)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 683)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 675)
(s56 0)
(s57 674)
(s58 0)
(s59 1)
(s60 0)
(s61 672)
(s62 0)
(s63 671)
(s64 669)
(s65 1)
(s66 0)
(s67 669)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 663)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 1)
(s81 699)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 698)
(s88 1)
(s89 698)
(s90 1)
(s91 698)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 697)
(s100 1)
(s101 1)
(s102 1)
(s103 696)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 691)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 688)
(s142 1)
(s143 688)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 686)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 685)
(s158 1)
(s159 686)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 683)
(s172 1)
(s173 680)
(s174 1)
(s175 682)
(s176 1)
(s177 678)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 676)
(s186 1)
(s187 677)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 673)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 668)
(s218 1)
(s219 1)
(s220 1)
(s221 666)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 660)
(s234 1)
(s235 662)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 950/1854 variables, and 46 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 60330ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Starting structural reductions in LTL mode, iteration 1 : 950/962 places, 904/914 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68159 ms. Remains : 950/962 places, 904/914 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-11
Product exploration explored 100000 steps with 102 reset in 358 ms.
Product exploration explored 100000 steps with 102 reset in 397 ms.
Computed a total of 950 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 950 transition count 904
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 141 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2779 steps (0 resets) in 54 ms. (50 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 309 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 904/904 transitions.
Applied a total of 0 rules in 36 ms. Remains 950 /950 variables (removed 0) and now considering 904/904 (removed 0) transitions.
[2024-06-01 14:01:39] [INFO ] Invariant cache hit.
[2024-06-01 14:01:40] [INFO ] Implicit Places using invariants in 883 ms returned []
[2024-06-01 14:01:40] [INFO ] Invariant cache hit.
[2024-06-01 14:01:47] [INFO ] Implicit Places using invariants and state equation in 6898 ms returned []
Implicit Place search using SMT with State Equation took 7787 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2024-06-01 14:01:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 40/950 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 697.0)
(s1 1.0)
(s2 697.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 698.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 697.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 695.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 691.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 689.0)
(s28 0.0)
(s29 688.0)
(s30 687.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 685.0)
(s35 1.0)
(s36 685.0)
(s37 1.0)
(s38 0.0)
(s39 685.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 683.0)
(s44 0.0)
(s45 682.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 676.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 671.0)
(s61 1.0)
(s62 0.0)
(s63 671.0)
(s64 0.0)
(s65 670.0)
(s66 668.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 664.0)
(s74 0.0)
(s75 1.0)
(s76 659.0)
(s77 1.0)
(s78 0.0)
(s79 699.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 698.0)
(s94 1.0)
(s95 698.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 696.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 694.0)
(s118 1.0)
(s119 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 950/1854 variables, and 46 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 40/950 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 864 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 950/1854 variables, and 46 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 60348ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60358ms
Finished structural reductions in LTL mode , in 1 iterations and 68183 ms. Remains : 950/950 places, 904/904 transitions.
Computed a total of 950 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 950 transition count 904
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X p0)), (X (X (AND p1 p0))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 155 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2796 steps (0 resets) in 89 ms. (31 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X p0)), (X (X (AND p1 p0))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 323 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 101 reset in 363 ms.
Product exploration explored 100000 steps with 102 reset in 402 ms.
Support contains 4 out of 950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 904/904 transitions.
Applied a total of 0 rules in 35 ms. Remains 950 /950 variables (removed 0) and now considering 904/904 (removed 0) transitions.
[2024-06-01 14:02:49] [INFO ] Invariant cache hit.
[2024-06-01 14:02:50] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-06-01 14:02:50] [INFO ] Invariant cache hit.
[2024-06-01 14:02:57] [INFO ] Implicit Places using invariants and state equation in 6999 ms returned []
Implicit Place search using SMT with State Equation took 7863 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2024-06-01 14:02:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 40/950 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 950/1854 variables, and 46 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 40/950 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 697)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 698)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 695)
(s16 693)
(s17 1)
(s18 0)
(s19 693)
(s20 0)
(s21 692)
(s22 0)
(s23 1)
(s24 689)
(s25 1)
(s26 0)
(s27 689)
(s28 0)
(s29 1)
(s30 0)
(s31 688)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 683)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 675)
(s56 0)
(s57 674)
(s58 0)
(s59 1)
(s60 0)
(s61 672)
(s62 0)
(s63 671)
(s64 669)
(s65 1)
(s66 0)
(s67 669)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 663)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 1)
(s81 699)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 698)
(s88 1)
(s89 698)
(s90 1)
(s91 698)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 697)
(s100 1)
(s101 1)
(s102 1)
(s103 696)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 691)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 950/1854 variables, and 46 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 60340ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60350ms
Finished structural reductions in LTL mode , in 1 iterations and 68251 ms. Remains : 950/950 places, 904/904 transitions.
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-11 finished in 209129 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 2 out of 962 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 961 transition count 914
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 955 transition count 908
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 955 transition count 908
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 951 transition count 904
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 951 transition count 904
Applied a total of 21 rules in 172 ms. Remains 951 /962 variables (removed 11) and now considering 904/914 (removed 10) transitions.
// Phase 1: matrix 904 rows 951 cols
[2024-06-01 14:03:58] [INFO ] Computed 47 invariants in 4 ms
[2024-06-01 14:03:59] [INFO ] Implicit Places using invariants in 801 ms returned []
[2024-06-01 14:03:59] [INFO ] Invariant cache hit.
[2024-06-01 14:04:06] [INFO ] Implicit Places using invariants and state equation in 6819 ms returned []
Implicit Place search using SMT with State Equation took 7623 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2024-06-01 14:04:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/1855 variables, and 6 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/1855 variables, and 7 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Starting structural reductions in LTL mode, iteration 1 : 951/962 places, 904/914 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68143 ms. Remains : 951/962 places, 904/914 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 637 ms.
Product exploration explored 100000 steps with 50000 reset in 589 ms.
Computed a total of 951 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 951 transition count 904
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-15 finished in 69997 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)))'
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))'
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 G(p1))||G(F(p2))))'
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)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-40-LTLCardinality-09
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 962 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Graph (complete) has 1834 edges and 962 vertex of which 960 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 39 places and 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 409 place count 921 transition count 467
Reduce places removed 408 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 410 rules applied. Total rules applied 819 place count 513 transition count 465
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 821 place count 511 transition count 465
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 828 place count 504 transition count 458
Iterating global reduction 3 with 7 rules applied. Total rules applied 835 place count 504 transition count 458
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 837 place count 504 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 839 place count 502 transition count 456
Applied a total of 839 rules in 76 ms. Remains 502 /962 variables (removed 460) and now considering 456/914 (removed 458) transitions.
// Phase 1: matrix 456 rows 502 cols
[2024-06-01 14:05:09] [INFO ] Computed 46 invariants in 4 ms
[2024-06-01 14:05:10] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2024-06-01 14:05:10] [INFO ] Invariant cache hit.
[2024-06-01 14:05:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 14:05:15] [INFO ] Implicit Places using invariants and state equation in 5037 ms returned []
Implicit Place search using SMT with State Equation took 6078 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2024-06-01 14:05:15] [INFO ] Invariant cache hit.
[2024-06-01 14:05:15] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/426 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 14/486 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/958 variables, and 486 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/502 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/426 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 14/486 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 379/865 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/958 variables, and 865 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/502 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LI_LTL mode, iteration 1 : 502/962 places, 456/914 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 66240 ms. Remains : 502/962 places, 456/914 transitions.
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-09
Product exploration explored 100000 steps with 38349 reset in 1063 ms.
Product exploration explored 100000 steps with 36961 reset in 866 ms.
Computed a total of 502 stabilizing places and 456 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 502 transition count 456
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 315 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 282 steps (0 resets) in 6 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 260 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 456/456 transitions.
Applied a total of 0 rules in 17 ms. Remains 502 /502 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2024-06-01 14:06:18] [INFO ] Invariant cache hit.
[2024-06-01 14:06:19] [INFO ] Implicit Places using invariants in 940 ms returned []
[2024-06-01 14:06:19] [INFO ] Invariant cache hit.
[2024-06-01 14:06:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 14:06:24] [INFO ] Implicit Places using invariants and state equation in 5515 ms returned []
Implicit Place search using SMT with State Equation took 6457 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2024-06-01 14:06:24] [INFO ] Invariant cache hit.
[2024-06-01 14:06:24] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/426 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 14/486 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/958 variables, and 486 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/502 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/426 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 14/486 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 379/865 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/958 variables, and 865 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/502 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Finished structural reductions in LTL mode , in 1 iterations and 66560 ms. Remains : 502/502 places, 456/456 transitions.
Computed a total of 502 stabilizing places and 456 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 502 transition count 456
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 240 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 271 steps (0 resets) in 7 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 271 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 39052 reset in 1135 ms.
Product exploration explored 100000 steps with 38189 reset in 878 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 456/456 transitions.
Applied a total of 0 rules in 14 ms. Remains 502 /502 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2024-06-01 14:07:28] [INFO ] Redundant transitions in 2 ms returned []
Running 379 sub problems to find dead transitions.
[2024-06-01 14:07:28] [INFO ] Invariant cache hit.
[2024-06-01 14:07:28] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/426 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 14/486 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/958 variables, and 486 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/502 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/426 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 14/486 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 379/865 constraints. Problems are: Problem set: 0 solved, 379 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 806/958 variables, and 865 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/502 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60105 ms. Remains : 502/502 places, 456/456 transitions.
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 456/456 transitions.
Applied a total of 0 rules in 17 ms. Remains 502 /502 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2024-06-01 14:08:28] [INFO ] Invariant cache hit.
[2024-06-01 14:08:29] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2024-06-01 14:08:29] [INFO ] Invariant cache hit.
[2024-06-01 14:08:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 14:08:34] [INFO ] Implicit Places using invariants and state equation in 5366 ms returned []
Implicit Place search using SMT with State Equation took 6534 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2024-06-01 14:08:34] [INFO ] Invariant cache hit.
[2024-06-01 14:08:34] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/426 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 14/486 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/958 variables, and 486 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/502 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/426 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 14/486 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 379/865 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/958 variables, and 865 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/502 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Finished structural reductions in LTL mode , in 1 iterations and 66634 ms. Remains : 502/502 places, 456/456 transitions.
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-09 finished in 266320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0))) U G(p1)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-40-LTLCardinality-10
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 7 out of 962 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Graph (complete) has 1834 edges and 962 vertex of which 961 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 40 places and 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 402 transitions
Trivial Post-agglo rules discarded 402 transitions
Performed 402 trivial Post agglomeration. Transition count delta: 402
Iterating post reduction 0 with 402 rules applied. Total rules applied 403 place count 921 transition count 472
Reduce places removed 402 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 405 rules applied. Total rules applied 808 place count 519 transition count 469
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 811 place count 516 transition count 469
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 817 place count 510 transition count 463
Iterating global reduction 3 with 6 rules applied. Total rules applied 823 place count 510 transition count 463
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 825 place count 510 transition count 461
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 827 place count 508 transition count 461
Applied a total of 827 rules in 63 ms. Remains 508 /962 variables (removed 454) and now considering 461/914 (removed 453) transitions.
// Phase 1: matrix 461 rows 508 cols
[2024-06-01 14:09:35] [INFO ] Computed 47 invariants in 6 ms
[2024-06-01 14:09:36] [INFO ] Implicit Places using invariants in 1136 ms returned []
[2024-06-01 14:09:36] [INFO ] Invariant cache hit.
[2024-06-01 14:09:39] [INFO ] Implicit Places using invariants and state equation in 3050 ms returned []
Implicit Place search using SMT with State Equation took 4189 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-06-01 14:09:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/430 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 2/432 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 386/818 variables, 432/479 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/969 variables, and 479 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 432/508 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/430 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 2/432 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 386/818 variables, 432/479 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 372/851 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/969 variables, and 851 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 432/508 constraints, PredecessorRefiner: 372/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LI_LTL mode, iteration 1 : 508/962 places, 461/914 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64341 ms. Remains : 508/962 places, 461/914 transitions.
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-10
Product exploration explored 100000 steps with 33138 reset in 1241 ms.
Product exploration explored 100000 steps with 33079 reset in 1021 ms.
Computed a total of 508 stabilizing places and 461 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 508 transition count 461
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X p0)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 312 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 431 steps (0 resets) in 10 ms. (39 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p0)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 419 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 7 out of 508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 461/461 transitions.
Applied a total of 0 rules in 18 ms. Remains 508 /508 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2024-06-01 14:10:43] [INFO ] Invariant cache hit.
[2024-06-01 14:10:44] [INFO ] Implicit Places using invariants in 1103 ms returned []
[2024-06-01 14:10:44] [INFO ] Invariant cache hit.
[2024-06-01 14:10:48] [INFO ] Implicit Places using invariants and state equation in 3480 ms returned []
Implicit Place search using SMT with State Equation took 4592 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-06-01 14:10:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/430 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 2/432 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s114 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 0.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 0.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 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 1.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 0.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 0.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 0.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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 386/818 variables, 432/479 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/969 variables, and 479 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 432/508 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/430 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 2/432 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 386/818 variables, 432/479 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 372/851 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/969 variables, and 851 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 432/508 constraints, PredecessorRefiner: 372/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Finished structural reductions in LTL mode , in 1 iterations and 64709 ms. Remains : 508/508 places, 461/461 transitions.
Computed a total of 508 stabilizing places and 461 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 508 transition count 461
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X p0)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 368 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 530 steps (0 resets) in 10 ms. (48 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p0)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 550 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 33087 reset in 1327 ms.
Product exploration explored 100000 steps with 33138 reset in 1012 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 7 out of 508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 508/508 places, 461/461 transitions.
Applied a total of 0 rules in 24 ms. Remains 508 /508 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2024-06-01 14:11:53] [INFO ] Redundant transitions in 4 ms returned []
Running 382 sub problems to find dead transitions.
[2024-06-01 14:11:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/430 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 2/432 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 386/818 variables, 432/479 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/969 variables, and 479 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 432/508 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/430 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 2/432 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 386/818 variables, 432/479 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 372/851 constraints. Problems are: Problem set: 0 solved, 382 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 818/969 variables, and 851 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 432/508 constraints, PredecessorRefiner: 372/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60156 ms. Remains : 508/508 places, 461/461 transitions.
Support contains 7 out of 508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 461/461 transitions.
Applied a total of 0 rules in 17 ms. Remains 508 /508 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2024-06-01 14:12:53] [INFO ] Invariant cache hit.
[2024-06-01 14:12:54] [INFO ] Implicit Places using invariants in 1173 ms returned []
[2024-06-01 14:12:54] [INFO ] Invariant cache hit.
[2024-06-01 14:12:57] [INFO ] Implicit Places using invariants and state equation in 3328 ms returned []
Implicit Place search using SMT with State Equation took 4505 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-06-01 14:12:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/430 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 2/432 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 386/818 variables, 432/479 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/969 variables, and 479 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 432/508 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/430 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 2/432 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 386/818 variables, 432/479 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 372/851 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/969 variables, and 851 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 432/508 constraints, PredecessorRefiner: 372/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Finished structural reductions in LTL mode , in 1 iterations and 64653 ms. Remains : 508/508 places, 461/461 transitions.
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-10 finished in 262860 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||X(p1)))))'
Found a Lengthening insensitive property : HirschbergSinclair-PT-40-LTLCardinality-11
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 962 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 962/962 places, 914/914 transitions.
Graph (complete) has 1834 edges and 962 vertex of which 960 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 40 places and 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 406 transitions
Trivial Post-agglo rules discarded 406 transitions
Performed 406 trivial Post agglomeration. Transition count delta: 406
Iterating post reduction 0 with 406 rules applied. Total rules applied 407 place count 920 transition count 468
Reduce places removed 406 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 407 rules applied. Total rules applied 814 place count 514 transition count 467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 815 place count 513 transition count 467
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 821 place count 507 transition count 461
Iterating global reduction 3 with 6 rules applied. Total rules applied 827 place count 507 transition count 461
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 829 place count 507 transition count 459
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 831 place count 505 transition count 459
Applied a total of 831 rules in 69 ms. Remains 505 /962 variables (removed 457) and now considering 459/914 (removed 455) transitions.
// Phase 1: matrix 459 rows 505 cols
[2024-06-01 14:13:58] [INFO ] Computed 46 invariants in 4 ms
[2024-06-01 14:13:59] [INFO ] Implicit Places using invariants in 1146 ms returned []
[2024-06-01 14:13:59] [INFO ] Invariant cache hit.
[2024-06-01 14:14:02] [INFO ] Implicit Places using invariants and state equation in 3119 ms returned []
Implicit Place search using SMT with State Equation took 4267 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2024-06-01 14:14:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 2/428 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/811 variables, 428/474 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/964 variables, and 474 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 428/505 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 2/428 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/811 variables, 428/474 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 380/854 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/964 variables, and 854 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 428/505 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LI_LTL mode, iteration 1 : 505/962 places, 459/914 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64430 ms. Remains : 505/962 places, 459/914 transitions.
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-11
Product exploration explored 100000 steps with 201 reset in 519 ms.
Product exploration explored 100000 steps with 201 reset in 404 ms.
Computed a total of 505 stabilizing places and 459 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 505 transition count 459
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 164 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1405 steps (0 resets) in 12 ms. (108 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 401 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 459/459 transitions.
Applied a total of 0 rules in 18 ms. Remains 505 /505 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2024-06-01 14:15:04] [INFO ] Invariant cache hit.
[2024-06-01 14:15:06] [INFO ] Implicit Places using invariants in 1139 ms returned []
[2024-06-01 14:15:06] [INFO ] Invariant cache hit.
[2024-06-01 14:15:09] [INFO ] Implicit Places using invariants and state equation in 3436 ms returned []
Implicit Place search using SMT with State Equation took 4577 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2024-06-01 14:15:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 2/428 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/811 variables, 428/474 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/964 variables, and 474 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 428/505 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 2/428 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/811 variables, 428/474 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 380/854 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 380 unsolved
SMT process timed out in 60080ms, After SMT, problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Finished structural reductions in LTL mode , in 1 iterations and 64681 ms. Remains : 505/505 places, 459/459 transitions.
Computed a total of 505 stabilizing places and 459 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 505 transition count 459
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X p0)), (X (X (AND p1 p0))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 154 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1427 steps (0 resets) in 12 ms. (109 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X p0)), (X (X (AND p1 p0))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 367 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 201 reset in 523 ms.
Product exploration explored 100000 steps with 201 reset in 496 ms.
Support contains 4 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 459/459 transitions.
Applied a total of 0 rules in 11 ms. Remains 505 /505 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2024-06-01 14:16:12] [INFO ] Invariant cache hit.
[2024-06-01 14:16:13] [INFO ] Implicit Places using invariants in 1026 ms returned []
[2024-06-01 14:16:13] [INFO ] Invariant cache hit.
[2024-06-01 14:16:16] [INFO ] Implicit Places using invariants and state equation in 3126 ms returned []
Implicit Place search using SMT with State Equation took 4154 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2024-06-01 14:16:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 2/428 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/811 variables, 428/474 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/964 variables, and 474 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 428/505 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 2/428 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/811 variables, 428/474 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 380/854 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/964 variables, and 854 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 428/505 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Finished structural reductions in LTL mode , in 1 iterations and 64262 ms. Remains : 505/505 places, 459/459 transitions.
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-11 finished in 198558 ms.
[2024-06-01 14:17:16] [INFO ] Flatten gal took : 99 ms
[2024-06-01 14:17:16] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 14:17:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 962 places, 914 transitions and 2745 arcs took 17 ms.
Total runtime 2453653 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 LTLCardinality -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="HirschbergSinclair-PT-40"
export BK_EXAMINATION="LTLCardinality"
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 HirschbergSinclair-PT-40, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r500-smll-171649587500115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-40.tgz
mv HirschbergSinclair-PT-40 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;