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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 03:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 03:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 03:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 03:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 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 357K 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-30-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717243019986

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-30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:57:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:57:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:57:02] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2024-06-01 11:57:02] [INFO ] Transformed 670 places.
[2024-06-01 11:57:02] [INFO ] Transformed 605 transitions.
[2024-06-01 11:57:02] [INFO ] Parsed PT model containing 670 places and 605 transitions and 1849 arcs in 500 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Support contains 63 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 605/605 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 645 transition count 605
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 48 place count 622 transition count 582
Iterating global reduction 1 with 23 rules applied. Total rules applied 71 place count 622 transition count 582
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 89 place count 604 transition count 564
Iterating global reduction 1 with 18 rules applied. Total rules applied 107 place count 604 transition count 564
Applied a total of 107 rules in 334 ms. Remains 604 /670 variables (removed 66) and now considering 564/605 (removed 41) transitions.
// Phase 1: matrix 564 rows 604 cols
[2024-06-01 11:57:04] [INFO ] Computed 40 invariants in 62 ms
[2024-06-01 11:57:05] [INFO ] Implicit Places using invariants in 1461 ms returned []
[2024-06-01 11:57:05] [INFO ] Invariant cache hit.
[2024-06-01 11:57:08] [INFO ] Implicit Places using invariants and state equation in 2933 ms returned []
Implicit Place search using SMT with State Equation took 4497 ms to find 0 implicit places.
Running 534 sub problems to find dead transitions.
[2024-06-01 11:57:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (OVERLAPS) 10/579 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/1168 variables, and 15 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 10/35 constraints, State Equation: 0/604 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (OVERLAPS) 10/579 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-06-01 11:57:49] [INFO ] Deduced a trap composed of 50 places in 441 ms of which 75 ms to minimize.
[2024-06-01 11:57:53] [INFO ] Deduced a trap composed of 192 places in 412 ms of which 8 ms to minimize.
[2024-06-01 11:58:04] [INFO ] Deduced a trap composed of 192 places in 416 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/1168 variables, and 18 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 10/35 constraints, State Equation: 0/604 constraints, PredecessorRefiner: 0/534 constraints, Known Traps: 3/3 constraints]
After SMT, in 60545ms problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 60582ms
Starting structural reductions in LTL mode, iteration 1 : 604/670 places, 564/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65478 ms. Remains : 604/670 places, 564/605 transitions.
Support contains 63 out of 604 places after structural reductions.
[2024-06-01 11:58:09] [INFO ] Flatten gal took : 165 ms
[2024-06-01 11:58:09] [INFO ] Flatten gal took : 88 ms
[2024-06-01 11:58:09] [INFO ] Input system was already deterministic with 564 transitions.
Support contains 57 out of 604 places (down from 63) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (64 resets) in 2413 ms. (16 steps per ms) remains 6/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
[2024-06-01 11:58:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 1 (OVERLAPS) 286/293 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 538/1168 variables, and 38 constraints, problems are : Problem set: 6 solved, 0 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/604 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 303ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 604 stabilizing places and 564 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 604 transition count 564
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-30-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Graph (complete) has 1187 edges and 604 vertex of which 600 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 570 transition count 293
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 483 place count 329 transition count 293
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 494 place count 318 transition count 282
Iterating global reduction 2 with 11 rules applied. Total rules applied 505 place count 318 transition count 282
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 510 place count 318 transition count 277
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 515 place count 313 transition count 277
Applied a total of 515 rules in 124 ms. Remains 313 /604 variables (removed 291) and now considering 277/564 (removed 287) transitions.
// Phase 1: matrix 277 rows 313 cols
[2024-06-01 11:58:11] [INFO ] Computed 36 invariants in 5 ms
[2024-06-01 11:58:12] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-06-01 11:58:12] [INFO ] Invariant cache hit.
[2024-06-01 11:58:13] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1371 ms to find 0 implicit places.
[2024-06-01 11:58:13] [INFO ] Redundant transitions in 16 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 11:58:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 2/255 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 2/257 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 221/478 variables, 257/293 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/478 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/590 variables, and 293 constraints, problems are : Problem set: 0 solved, 218 unsolved in 21160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/313 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 2/255 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 2/257 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 221/478 variables, 257/293 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 218/511 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/478 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/590 variables, and 511 constraints, problems are : Problem set: 0 solved, 218 unsolved in 29821 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/313 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 51048ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 51053ms
Starting structural reductions in SI_LTL mode, iteration 1 : 313/604 places, 277/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52573 ms. Remains : 313/604 places, 277/564 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-00
Product exploration explored 100000 steps with 327 reset in 613 ms.
Product exploration explored 100000 steps with 327 reset in 390 ms.
Computed a total of 313 stabilizing places and 277 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 313 transition count 277
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 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 380 steps (0 resets) in 8 ms. (42 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 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-06-01 11:59:06] [INFO ] Invariant cache hit.
[2024-06-01 11:59:06] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 11:59:06] [INFO ] [Real]Absence check using 1 positive and 35 generalized place invariants in 126 ms returned sat
[2024-06-01 11:59:13] [INFO ] [Real]Absence check using state equation in 6195 ms returned sat
[2024-06-01 11:59:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:59:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-06-01 11:59:13] [INFO ] [Nat]Absence check using 1 positive and 35 generalized place invariants in 147 ms returned sat
[2024-06-01 11:59:14] [INFO ] [Nat]Absence check using state equation in 1148 ms returned sat
[2024-06-01 11:59:14] [INFO ] Computed and/alt/rep : 218/224/218 causal constraints (skipped 0 transitions) in 19 ms.
[2024-06-01 11:59:16] [INFO ] Added : 114 causal constraints over 23 iterations in 1451 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 277/277 transitions.
Applied a total of 0 rules in 26 ms. Remains 313 /313 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2024-06-01 11:59:16] [INFO ] Invariant cache hit.
[2024-06-01 11:59:16] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-06-01 11:59:16] [INFO ] Invariant cache hit.
[2024-06-01 11:59:18] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
[2024-06-01 11:59:18] [INFO ] Redundant transitions in 7 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 11:59:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 2/255 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 2/257 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 221/478 variables, 257/293 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/478 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/590 variables, and 293 constraints, problems are : Problem set: 0 solved, 218 unsolved in 20228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/313 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 2/255 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 2/257 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 221/478 variables, 257/293 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 218/511 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/478 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/590 variables, and 511 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/313 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 50293ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 50299ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52166 ms. Remains : 313/313 places, 277/277 transitions.
Computed a total of 313 stabilizing places and 277 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 313 transition count 277
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 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 377 steps (0 resets) in 9 ms. (37 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 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2024-06-01 12:00:08] [INFO ] Invariant cache hit.
[2024-06-01 12:00:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 12:00:09] [INFO ] [Real]Absence check using 1 positive and 35 generalized place invariants in 137 ms returned sat
[2024-06-01 12:00:15] [INFO ] [Real]Absence check using state equation in 5924 ms returned sat
[2024-06-01 12:00:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 12:00:15] [INFO ] [Nat]Absence check using 1 positive and 35 generalized place invariants in 137 ms returned sat
[2024-06-01 12:00:17] [INFO ] [Nat]Absence check using state equation in 1366 ms returned sat
[2024-06-01 12:00:17] [INFO ] Computed and/alt/rep : 218/224/218 causal constraints (skipped 0 transitions) in 31 ms.
[2024-06-01 12:00:18] [INFO ] Added : 114 causal constraints over 23 iterations in 1698 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 327 reset in 394 ms.
Product exploration explored 100000 steps with 327 reset in 416 ms.
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 277/277 transitions.
Applied a total of 0 rules in 15 ms. Remains 313 /313 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2024-06-01 12:00:19] [INFO ] Invariant cache hit.
[2024-06-01 12:00:20] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-06-01 12:00:20] [INFO ] Invariant cache hit.
[2024-06-01 12:00:21] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2024-06-01 12:00:21] [INFO ] Redundant transitions in 4 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 12:00:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 2/255 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 2/257 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 221/478 variables, 257/293 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/478 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/590 variables, and 293 constraints, problems are : Problem set: 0 solved, 218 unsolved in 20672 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/313 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 2/255 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 2/257 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 221/478 variables, 257/293 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 218/511 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/478 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/590 variables, and 511 constraints, problems are : Problem set: 0 solved, 218 unsolved in 28949 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/313 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 49653ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 49657ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51015 ms. Remains : 313/313 places, 277/277 transitions.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-00 finished in 179149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 599 transition count 564
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 16 place count 588 transition count 553
Iterating global reduction 1 with 11 rules applied. Total rules applied 27 place count 588 transition count 553
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 581 transition count 546
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 581 transition count 546
Applied a total of 41 rules in 47 ms. Remains 581 /604 variables (removed 23) and now considering 546/564 (removed 18) transitions.
// Phase 1: matrix 546 rows 581 cols
[2024-06-01 12:01:10] [INFO ] Computed 35 invariants in 23 ms
[2024-06-01 12:01:11] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-06-01 12:01:11] [INFO ] Invariant cache hit.
[2024-06-01 12:01:14] [INFO ] Implicit Places using invariants and state equation in 3057 ms returned []
Implicit Place search using SMT with State Equation took 3717 ms to find 0 implicit places.
Running 516 sub problems to find dead transitions.
[2024-06-01 12:01:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (OVERLAPS) 30/581 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
SMT process timed out in 30247ms, After SMT, problems are : Problem set: 0 solved, 516 unsolved
Search for dead transitions found 0 dead transitions in 30258ms
Starting structural reductions in LTL mode, iteration 1 : 581/604 places, 546/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34025 ms. Remains : 581/604 places, 546/564 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-01 finished in 34196 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 2 out of 604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Graph (complete) has 1187 edges and 604 vertex of which 599 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.8 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 29 places and 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 236 place count 570 transition count 300
Reduce places removed 235 places and 0 transitions.
Iterating post reduction 1 with 235 rules applied. Total rules applied 471 place count 335 transition count 300
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 482 place count 324 transition count 289
Iterating global reduction 2 with 11 rules applied. Total rules applied 493 place count 324 transition count 289
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 497 place count 324 transition count 285
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 501 place count 320 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 503 place count 319 transition count 284
Applied a total of 503 rules in 99 ms. Remains 319 /604 variables (removed 285) and now considering 284/564 (removed 280) transitions.
// Phase 1: matrix 284 rows 319 cols
[2024-06-01 12:01:45] [INFO ] Computed 35 invariants in 3 ms
[2024-06-01 12:01:45] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-06-01 12:01:45] [INFO ] Invariant cache hit.
[2024-06-01 12:01:47] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2024-06-01 12:01:47] [INFO ] Redundant transitions in 3 ms returned []
Running 228 sub problems to find dead transitions.
[2024-06-01 12:01:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 3/266 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 232/498 variables, 266/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 1/499 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/603 variables, and 302 constraints, problems are : Problem set: 0 solved, 228 unsolved in 24970 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 267/319 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 3/266 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 232/498 variables, 266/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 228/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/499 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/499 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/603 variables, and 530 constraints, problems are : Problem set: 0 solved, 228 unsolved in 23159 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 267/319 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 48164ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 48169ms
Starting structural reductions in SI_LTL mode, iteration 1 : 319/604 places, 284/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50306 ms. Remains : 319/604 places, 284/564 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-02
Product exploration explored 100000 steps with 1733 reset in 617 ms.
Product exploration explored 100000 steps with 1736 reset in 622 ms.
Computed a total of 319 stabilizing places and 284 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 319 transition count 284
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)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 137 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 35 ms :[(NOT p0)]
RANDOM walk for 327 steps (0 resets) in 6 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 160 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 12:02:37] [INFO ] Invariant cache hit.
[2024-06-01 12:02:37] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 78 ms returned sat
[2024-06-01 12:02:38] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2024-06-01 12:02:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:02:38] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 95 ms returned sat
[2024-06-01 12:02:40] [INFO ] [Nat]Absence check using state equation in 1526 ms returned sat
[2024-06-01 12:02:40] [INFO ] Computed and/alt/rep : 228/282/228 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 12:02:41] [INFO ] Added : 164 causal constraints over 33 iterations in 1574 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 284/284 transitions.
Applied a total of 0 rules in 15 ms. Remains 319 /319 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-06-01 12:02:41] [INFO ] Invariant cache hit.
[2024-06-01 12:02:42] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-06-01 12:02:42] [INFO ] Invariant cache hit.
[2024-06-01 12:02:43] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
[2024-06-01 12:02:43] [INFO ] Redundant transitions in 1 ms returned []
Running 228 sub problems to find dead transitions.
[2024-06-01 12:02:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 3/266 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 232/498 variables, 266/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 1/499 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/603 variables, and 302 constraints, problems are : Problem set: 0 solved, 228 unsolved in 16224 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 267/319 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 3/266 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 232/498 variables, 266/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 228/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/499 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/499 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/603 variables, and 530 constraints, problems are : Problem set: 0 solved, 228 unsolved in 23089 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 267/319 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 39346ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 39349ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40835 ms. Remains : 319/319 places, 284/284 transitions.
Computed a total of 319 stabilizing places and 284 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 319 transition count 284
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)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 138 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 38 ms :[(NOT p0)]
RANDOM walk for 277 steps (0 resets) in 8 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 157 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-06-01 12:03:23] [INFO ] Invariant cache hit.
[2024-06-01 12:03:23] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 82 ms returned sat
[2024-06-01 12:03:24] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2024-06-01 12:03:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:03:24] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 102 ms returned sat
[2024-06-01 12:03:26] [INFO ] [Nat]Absence check using state equation in 1581 ms returned sat
[2024-06-01 12:03:26] [INFO ] Computed and/alt/rep : 228/282/228 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 12:03:27] [INFO ] Added : 164 causal constraints over 33 iterations in 1589 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1707 reset in 543 ms.
Product exploration explored 100000 steps with 1735 reset in 596 ms.
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 284/284 transitions.
Applied a total of 0 rules in 15 ms. Remains 319 /319 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-06-01 12:03:29] [INFO ] Invariant cache hit.
[2024-06-01 12:03:29] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-06-01 12:03:29] [INFO ] Invariant cache hit.
[2024-06-01 12:03:30] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
[2024-06-01 12:03:30] [INFO ] Redundant transitions in 1 ms returned []
Running 228 sub problems to find dead transitions.
[2024-06-01 12:03:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 3/266 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 232/498 variables, 266/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 1/499 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/603 variables, and 302 constraints, problems are : Problem set: 0 solved, 228 unsolved in 16252 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 267/319 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 3/266 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 232/498 variables, 266/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 228/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/499 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/499 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/603 variables, and 530 constraints, problems are : Problem set: 0 solved, 228 unsolved in 23563 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 267/319 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 39842ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 39846ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41366 ms. Remains : 319/319 places, 284/284 transitions.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-02 finished in 145428 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((X(p1)||p0)))'
Support contains 4 out of 604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 599 transition count 564
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 16 place count 588 transition count 553
Iterating global reduction 1 with 11 rules applied. Total rules applied 27 place count 588 transition count 553
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 582 transition count 547
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 582 transition count 547
Applied a total of 39 rules in 52 ms. Remains 582 /604 variables (removed 22) and now considering 547/564 (removed 17) transitions.
// Phase 1: matrix 547 rows 582 cols
[2024-06-01 12:04:10] [INFO ] Computed 35 invariants in 7 ms
[2024-06-01 12:04:11] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-06-01 12:04:11] [INFO ] Invariant cache hit.
[2024-06-01 12:04:13] [INFO ] Implicit Places using invariants and state equation in 2522 ms returned []
Implicit Place search using SMT with State Equation took 3003 ms to find 0 implicit places.
Running 517 sub problems to find dead transitions.
[2024-06-01 12:04:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 30/582 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (OVERLAPS) 547/1129 variables, 582/617 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1129/1129 variables, and 617 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 30/582 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (OVERLAPS) 547/1129 variables, 582/617 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1129 variables, 517/1134 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1129/1129 variables, and 1134 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 582/604 places, 547/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63250 ms. Remains : 582/604 places, 547/564 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-03
Product exploration explored 100000 steps with 1146 reset in 514 ms.
Product exploration explored 100000 steps with 1161 reset in 553 ms.
Computed a total of 582 stabilizing places and 547 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 582 transition count 547
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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 163 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 2
RANDOM walk for 40000 steps (64 resets) in 486 ms. (82 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
[2024-06-01 12:05:15] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 4/1129 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Generalized P Invariants (flows): 0/35 constraints, State Equation: 0/582 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR p0 (NOT p1))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 454 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
[2024-06-01 12:05:16] [INFO ] Invariant cache hit.
[2024-06-01 12:05:17] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 139 ms returned sat
[2024-06-01 12:05:22] [INFO ] [Real]Absence check using state equation in 5672 ms returned sat
[2024-06-01 12:05:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:05:23] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 207 ms returned sat
[2024-06-01 12:05:34] [INFO ] [Nat]Absence check using state equation in 10526 ms returned sat
[2024-06-01 12:05:34] [INFO ] Computed and/alt/rep : 344/1073/344 causal constraints (skipped 173 transitions) in 47 ms.
[2024-06-01 12:05:36] [INFO ] Added : 92 causal constraints over 19 iterations in 2023 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 547/547 transitions.
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 552 transition count 280
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 315 transition count 280
Applied a total of 474 rules in 22 ms. Remains 315 /582 variables (removed 267) and now considering 280/547 (removed 267) transitions.
// Phase 1: matrix 280 rows 315 cols
[2024-06-01 12:05:36] [INFO ] Computed 35 invariants in 3 ms
[2024-06-01 12:05:36] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-06-01 12:05:36] [INFO ] Invariant cache hit.
[2024-06-01 12:05:37] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
[2024-06-01 12:05:37] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-06-01 12:05:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 2/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/484 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 5/489 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/489 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/595 variables, and 297 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15253 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 262/315 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 2/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/484 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 213/506 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 5/489 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 8/518 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/489 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 489/595 variables, and 518 constraints, problems are : Problem set: 0 solved, 221 unsolved in 24588 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 262/315 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 39866ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 39869ms
Starting structural reductions in SI_LTL mode, iteration 1 : 315/582 places, 280/547 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41280 ms. Remains : 315/582 places, 280/547 transitions.
Computed a total of 315 stabilizing places and 280 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 315 transition count 280
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 p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 186 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 p1), (NOT p1)]
RANDOM walk for 206 steps (0 resets) in 5 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 173 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 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
[2024-06-01 12:06:18] [INFO ] Invariant cache hit.
[2024-06-01 12:06:18] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 89 ms returned sat
[2024-06-01 12:06:20] [INFO ] [Real]Absence check using state equation in 1808 ms returned sat
[2024-06-01 12:06:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:06:20] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 100 ms returned sat
[2024-06-01 12:06:22] [INFO ] [Nat]Absence check using state equation in 2166 ms returned sat
[2024-06-01 12:06:22] [INFO ] Computed and/alt/rep : 221/227/221 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-01 12:06:23] [INFO ] Added : 11 causal constraints over 3 iterations in 386 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2738 reset in 624 ms.
Product exploration explored 100000 steps with 2744 reset in 686 ms.
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 280/280 transitions.
Applied a total of 0 rules in 13 ms. Remains 315 /315 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-06-01 12:06:24] [INFO ] Invariant cache hit.
[2024-06-01 12:06:25] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-06-01 12:06:25] [INFO ] Invariant cache hit.
[2024-06-01 12:06:26] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
[2024-06-01 12:06:26] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-06-01 12:06:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 2/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/484 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 5/489 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/489 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/595 variables, and 297 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15012 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 262/315 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 2/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/484 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 213/506 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 5/489 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 8/518 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/489 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 489/595 variables, and 518 constraints, problems are : Problem set: 0 solved, 221 unsolved in 24574 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 262/315 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 39611ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 39613ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41048 ms. Remains : 315/315 places, 280/280 transitions.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-03 finished in 175201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1))) U p2))'
Support contains 5 out of 604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Graph (complete) has 1187 edges and 604 vertex of which 599 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 28 places and 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 231 place count 571 transition count 306
Reduce places removed 230 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 232 rules applied. Total rules applied 463 place count 341 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 465 place count 339 transition count 304
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 477 place count 327 transition count 292
Iterating global reduction 3 with 12 rules applied. Total rules applied 489 place count 327 transition count 292
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 494 place count 327 transition count 287
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 499 place count 322 transition count 287
Applied a total of 499 rules in 37 ms. Remains 322 /604 variables (removed 282) and now considering 287/564 (removed 277) transitions.
// Phase 1: matrix 287 rows 322 cols
[2024-06-01 12:07:05] [INFO ] Computed 35 invariants in 2 ms
[2024-06-01 12:07:06] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-06-01 12:07:06] [INFO ] Invariant cache hit.
[2024-06-01 12:07:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 12:07:07] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1473 ms to find 0 implicit places.
[2024-06-01 12:07:07] [INFO ] Redundant transitions in 1 ms returned []
Running 233 sub problems to find dead transitions.
[2024-06-01 12:07:07] [INFO ] Invariant cache hit.
[2024-06-01 12:07:07] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 2/270 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 235/505 variables, 270/305 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/609 variables, and 317 constraints, problems are : Problem set: 0 solved, 233 unsolved in 24431 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 270/322 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 2/270 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 235/505 variables, 270/305 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 233/550 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/505 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/609 variables, and 550 constraints, problems are : Problem set: 0 solved, 233 unsolved in 23124 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 270/322 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 47585ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 47588ms
Starting structural reductions in SI_LTL mode, iteration 1 : 322/604 places, 287/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49105 ms. Remains : 322/604 places, 287/564 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-07
Product exploration explored 100000 steps with 594 reset in 316 ms.
Product exploration explored 100000 steps with 595 reset in 358 ms.
Computed a total of 322 stabilizing places and 287 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 322 transition count 287
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 p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 1531 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 1583 steps (4 resets) in 9 ms. (158 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F p1), (F (NOT (OR p2 p1 (NOT p0)))), (F p2), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 6 factoid took 2005 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 12:07:59] [INFO ] Invariant cache hit.
[2024-06-01 12:08:00] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 81 ms returned sat
[2024-06-01 12:08:00] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2024-06-01 12:08:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:08:01] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 120 ms returned sat
[2024-06-01 12:08:01] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-06-01 12:08:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 12:08:01] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2024-06-01 12:08:01] [INFO ] Computed and/alt/rep : 226/261/226 causal constraints (skipped 7 transitions) in 20 ms.
[2024-06-01 12:08:01] [INFO ] Added : 6 causal constraints over 2 iterations in 93 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 287/287 transitions.
Applied a total of 0 rules in 12 ms. Remains 322 /322 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-06-01 12:08:01] [INFO ] Invariant cache hit.
[2024-06-01 12:08:01] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-06-01 12:08:01] [INFO ] Invariant cache hit.
[2024-06-01 12:08:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 12:08:02] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1570 ms to find 0 implicit places.
[2024-06-01 12:08:02] [INFO ] Redundant transitions in 1 ms returned []
Running 233 sub problems to find dead transitions.
[2024-06-01 12:08:02] [INFO ] Invariant cache hit.
[2024-06-01 12:08:02] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 2/270 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 235/505 variables, 270/305 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/609 variables, and 317 constraints, problems are : Problem set: 0 solved, 233 unsolved in 23706 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 270/322 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 2/270 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 235/505 variables, 270/305 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 233/550 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/505 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/609 variables, and 550 constraints, problems are : Problem set: 0 solved, 233 unsolved in 22633 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 270/322 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 46375ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 46378ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47967 ms. Remains : 322/322 places, 287/287 transitions.
Computed a total of 322 stabilizing places and 287 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 322 transition count 287
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 p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 1531 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 1777 steps (4 resets) in 11 ms. (148 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F p1), (F (NOT (OR p2 p1 (NOT p0)))), (F p2), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 6 factoid took 1959 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 12:08:53] [INFO ] Invariant cache hit.
[2024-06-01 12:08:53] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 80 ms returned sat
[2024-06-01 12:08:54] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2024-06-01 12:08:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:08:54] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 114 ms returned sat
[2024-06-01 12:08:54] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-06-01 12:08:54] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 12:08:54] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2024-06-01 12:08:54] [INFO ] Computed and/alt/rep : 226/261/226 causal constraints (skipped 7 transitions) in 22 ms.
[2024-06-01 12:08:54] [INFO ] Added : 6 causal constraints over 2 iterations in 96 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 595 reset in 325 ms.
Product exploration explored 100000 steps with 591 reset in 361 ms.
Support contains 5 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 287/287 transitions.
Applied a total of 0 rules in 12 ms. Remains 322 /322 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-06-01 12:08:55] [INFO ] Invariant cache hit.
[2024-06-01 12:08:56] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-06-01 12:08:56] [INFO ] Invariant cache hit.
[2024-06-01 12:08:56] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 12:08:57] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
[2024-06-01 12:08:57] [INFO ] Redundant transitions in 1 ms returned []
Running 233 sub problems to find dead transitions.
[2024-06-01 12:08:57] [INFO ] Invariant cache hit.
[2024-06-01 12:08:57] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 2/270 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 235/505 variables, 270/305 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/609 variables, and 317 constraints, problems are : Problem set: 0 solved, 233 unsolved in 24350 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 270/322 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 2/270 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 235/505 variables, 270/305 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 233/550 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/505 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/609 variables, and 550 constraints, problems are : Problem set: 0 solved, 233 unsolved in 22890 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 270/322 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 47272ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 47274ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48840 ms. Remains : 322/322 places, 287/287 transitions.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-07 finished in 158869 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&&F(p2)))))))'
Support contains 6 out of 604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 600 transition count 564
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 16 place count 588 transition count 552
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 588 transition count 552
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 581 transition count 545
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 581 transition count 545
Applied a total of 42 rules in 45 ms. Remains 581 /604 variables (removed 23) and now considering 545/564 (removed 19) transitions.
// Phase 1: matrix 545 rows 581 cols
[2024-06-01 12:09:44] [INFO ] Computed 36 invariants in 8 ms
[2024-06-01 12:09:45] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-06-01 12:09:45] [INFO ] Invariant cache hit.
[2024-06-01 12:09:48] [INFO ] Implicit Places using invariants and state equation in 2774 ms returned []
Implicit Place search using SMT with State Equation took 3471 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2024-06-01 12:09:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 2/552 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/552 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-01 12:10:10] [INFO ] Deduced a trap composed of 192 places in 196 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/1126 variables, and 8 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/35 constraints, State Equation: 0/581 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 2/552 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/552 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 6 (OVERLAPS) 29/581 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-01 12:10:34] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 5 ms to minimize.
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 4 ms to minimize.
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 4 ms to minimize.
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 5 ms to minimize.
[2024-06-01 12:10:43] [INFO ] Deduced a trap composed of 192 places in 197 ms of which 4 ms to minimize.
[2024-06-01 12:10:44] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/1126 variables, and 43 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/581 constraints, PredecessorRefiner: 0/515 constraints, Known Traps: 7/7 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in LTL mode, iteration 1 : 581/604 places, 545/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63703 ms. Remains : 581/604 places, 545/564 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-08
Product exploration explored 100000 steps with 1802 reset in 511 ms.
Product exploration explored 100000 steps with 1756 reset in 560 ms.
Computed a total of 581 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 581 transition count 545
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 p2), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 732 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 1641 steps (0 resets) in 10 ms. (149 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 7 factoid took 1136 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 581 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 : 581/581 places, 545/545 transitions.
Reduce places removed 29 places and 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 229 rules applied. Total rules applied 229 place count 552 transition count 287
Reduce places removed 229 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 231 rules applied. Total rules applied 460 place count 323 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 462 place count 321 transition count 285
Applied a total of 462 rules in 31 ms. Remains 321 /581 variables (removed 260) and now considering 285/545 (removed 260) transitions.
// Phase 1: matrix 285 rows 321 cols
[2024-06-01 12:10:52] [INFO ] Computed 36 invariants in 6 ms
[2024-06-01 12:10:52] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-06-01 12:10:52] [INFO ] Invariant cache hit.
[2024-06-01 12:10:53] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
[2024-06-01 12:10:53] [INFO ] Redundant transitions in 1 ms returned []
Running 229 sub problems to find dead transitions.
[2024-06-01 12:10:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 2/266 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 2/268 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-06-01 12:11:01] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 233/501 variables, 268/305 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 3/504 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 12 (OVERLAPS) 0/504 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/606 variables, and 307 constraints, problems are : Problem set: 0 solved, 229 unsolved in 24309 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 270/321 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 2/266 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-06-01 12:11:21] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 2/268 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 233/501 variables, 268/306 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 223/529 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-06-01 12:11:29] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 13 (OVERLAPS) 3/504 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 6/538 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 229 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 0)
(s10 0)
(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 0)
(s49 0)
(s50 0)
(s51 1)
(s52 1)
(s53 0)
(s54 1)
(s73 0)
(s74 1)
(s75 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/606 variables, and 538 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 270/321 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 3/3 constraints]
After SMT, in 54349ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 54352ms
Starting structural reductions in SI_LTL mode, iteration 1 : 321/581 places, 285/545 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56063 ms. Remains : 321/581 places, 285/545 transitions.
Computed a total of 321 stabilizing places and 285 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 321 transition count 285
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 p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 5 factoid took 462 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 890 steps (0 resets) in 16 ms. (52 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p2), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 5 factoid took 535 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 1916 reset in 558 ms.
Product exploration explored 100000 steps with 1944 reset in 619 ms.
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 285/285 transitions.
Graph (complete) has 840 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 320 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 319 transition count 284
Applied a total of 3 rules in 14 ms. Remains 319 /321 variables (removed 2) and now considering 284/285 (removed 1) transitions.
// Phase 1: matrix 284 rows 319 cols
[2024-06-01 12:11:50] [INFO ] Computed 35 invariants in 2 ms
[2024-06-01 12:11:51] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-06-01 12:11:51] [INFO ] Invariant cache hit.
[2024-06-01 12:11:52] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
[2024-06-01 12:11:52] [INFO ] Redundant transitions in 1 ms returned []
Running 228 sub problems to find dead transitions.
[2024-06-01 12:11:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 3/266 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 231/497 variables, 266/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/497 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/603 variables, and 301 constraints, problems are : Problem set: 0 solved, 228 unsolved in 13383 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 266/319 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 3/266 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 231/497 variables, 266/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 228/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/603 variables, and 529 constraints, problems are : Problem set: 0 solved, 228 unsolved in 17647 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 266/319 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 31056ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 31059ms
Starting structural reductions in SI_LTL mode, iteration 1 : 319/321 places, 284/285 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32509 ms. Remains : 319/321 places, 284/285 transitions.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-08 finished in 158743 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(X((X((F(p1)&&p0)) U !p1))))'
Support contains 6 out of 604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 599 transition count 564
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 15 place count 589 transition count 554
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 589 transition count 554
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 583 transition count 548
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 583 transition count 548
Applied a total of 37 rules in 44 ms. Remains 583 /604 variables (removed 21) and now considering 548/564 (removed 16) transitions.
// Phase 1: matrix 548 rows 583 cols
[2024-06-01 12:12:23] [INFO ] Computed 35 invariants in 3 ms
[2024-06-01 12:12:23] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-06-01 12:12:23] [INFO ] Invariant cache hit.
[2024-06-01 12:12:26] [INFO ] Implicit Places using invariants and state equation in 2483 ms returned []
Implicit Place search using SMT with State Equation took 2984 ms to find 0 implicit places.
Running 518 sub problems to find dead transitions.
[2024-06-01 12:12:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 30/583 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (OVERLAPS) 548/1131 variables, 583/618 constraints. Problems are: Problem set: 0 solved, 518 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 1131/1131 variables, and 618 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 30/583 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (OVERLAPS) 548/1131 variables, 583/618 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1131 variables, 518/1136 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 1136 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 583/604 places, 548/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63205 ms. Remains : 583/604 places, 548/564 transitions.
Stuttering acceptance computed with spot in 174 ms :[p1, p1, true, true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 87 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-09 finished in 63410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Graph (complete) has 1187 edges and 604 vertex of which 599 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 28 places and 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 231 place count 571 transition count 306
Reduce places removed 230 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 231 rules applied. Total rules applied 462 place count 341 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 463 place count 340 transition count 305
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 474 place count 329 transition count 294
Iterating global reduction 3 with 11 rules applied. Total rules applied 485 place count 329 transition count 294
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 489 place count 329 transition count 290
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 493 place count 325 transition count 290
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 494 place count 324 transition count 289
Iterating global reduction 5 with 1 rules applied. Total rules applied 495 place count 324 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 497 place count 323 transition count 288
Applied a total of 497 rules in 44 ms. Remains 323 /604 variables (removed 281) and now considering 288/564 (removed 276) transitions.
// Phase 1: matrix 288 rows 323 cols
[2024-06-01 12:13:26] [INFO ] Computed 35 invariants in 2 ms
[2024-06-01 12:13:27] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-06-01 12:13:27] [INFO ] Invariant cache hit.
[2024-06-01 12:13:27] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 12:13:28] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
[2024-06-01 12:13:28] [INFO ] Redundant transitions in 1 ms returned []
Running 234 sub problems to find dead transitions.
[2024-06-01 12:13:28] [INFO ] Invariant cache hit.
[2024-06-01 12:13:28] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 3/272 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 237/509 variables, 272/307 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 12/319 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/509 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/611 variables, and 319 constraints, problems are : Problem set: 0 solved, 234 unsolved in 20758 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 272/323 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 3/272 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 237/509 variables, 272/307 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 12/319 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 234/553 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/509 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/611 variables, and 553 constraints, problems are : Problem set: 0 solved, 234 unsolved in 22851 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 272/323 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 43641ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 43646ms
Starting structural reductions in SI_LTL mode, iteration 1 : 323/604 places, 288/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45076 ms. Remains : 323/604 places, 288/564 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-10
Product exploration explored 100000 steps with 315 reset in 243 ms.
Product exploration explored 100000 steps with 315 reset in 282 ms.
Computed a total of 323 stabilizing places and 288 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 323 transition count 288
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 p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 289 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 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 892 steps (0 resets) in 5 ms. (148 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 366 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 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 288/288 transitions.
Applied a total of 0 rules in 9 ms. Remains 323 /323 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-06-01 12:14:13] [INFO ] Invariant cache hit.
[2024-06-01 12:14:14] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-06-01 12:14:14] [INFO ] Invariant cache hit.
[2024-06-01 12:14:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 12:14:15] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2024-06-01 12:14:15] [INFO ] Redundant transitions in 1 ms returned []
Running 234 sub problems to find dead transitions.
[2024-06-01 12:14:15] [INFO ] Invariant cache hit.
[2024-06-01 12:14:15] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 3/272 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 237/509 variables, 272/307 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 12/319 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/509 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/611 variables, and 319 constraints, problems are : Problem set: 0 solved, 234 unsolved in 21006 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 272/323 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 3/272 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 237/509 variables, 272/307 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 12/319 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 234/553 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/509 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/611 variables, and 553 constraints, problems are : Problem set: 0 solved, 234 unsolved in 23916 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 272/323 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 44951ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 44954ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46350 ms. Remains : 323/323 places, 288/288 transitions.
Computed a total of 323 stabilizing places and 288 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 323 transition count 288
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 p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 309 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 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 918 steps (0 resets) in 11 ms. (76 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 370 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 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 315 reset in 249 ms.
Product exploration explored 100000 steps with 315 reset in 286 ms.
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 288/288 transitions.
Applied a total of 0 rules in 15 ms. Remains 323 /323 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-06-01 12:15:01] [INFO ] Invariant cache hit.
[2024-06-01 12:15:02] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-06-01 12:15:02] [INFO ] Invariant cache hit.
[2024-06-01 12:15:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 12:15:03] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
[2024-06-01 12:15:03] [INFO ] Redundant transitions in 2 ms returned []
Running 234 sub problems to find dead transitions.
[2024-06-01 12:15:03] [INFO ] Invariant cache hit.
[2024-06-01 12:15:03] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 3/272 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 237/509 variables, 272/307 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 12/319 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/509 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/611 variables, and 319 constraints, problems are : Problem set: 0 solved, 234 unsolved in 20876 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 272/323 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 3/272 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 237/509 variables, 272/307 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 12/319 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 234/553 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/509 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/611 variables, and 553 constraints, problems are : Problem set: 0 solved, 234 unsolved in 22903 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 272/323 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 43824ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 43828ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45549 ms. Remains : 323/323 places, 288/288 transitions.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-10 finished in 140650 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&&((p1 U p2)||G(p3))))))'
Support contains 7 out of 604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 600 transition count 564
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 15 place count 589 transition count 553
Iterating global reduction 1 with 11 rules applied. Total rules applied 26 place count 589 transition count 553
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 583 transition count 547
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 583 transition count 547
Applied a total of 38 rules in 44 ms. Remains 583 /604 variables (removed 21) and now considering 547/564 (removed 17) transitions.
// Phase 1: matrix 547 rows 583 cols
[2024-06-01 12:15:47] [INFO ] Computed 36 invariants in 9 ms
[2024-06-01 12:15:48] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-06-01 12:15:48] [INFO ] Invariant cache hit.
[2024-06-01 12:15:50] [INFO ] Implicit Places using invariants and state equation in 2404 ms returned []
Implicit Place search using SMT with State Equation took 2969 ms to find 0 implicit places.
Running 517 sub problems to find dead transitions.
[2024-06-01 12:15:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 2/554 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/554 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (OVERLAPS) 29/583 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 547/1130 variables, 583/619 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1130/1130 variables, and 619 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 2/554 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/554 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (OVERLAPS) 29/583 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (OVERLAPS) 547/1130 variables, 583/619 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1130 variables, 517/1136 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1130/1130 variables, and 1136 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in LTL mode, iteration 1 : 583/604 places, 547/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63187 ms. Remains : 583/604 places, 547/564 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-12
Stuttering criterion allowed to conclude after 1630 steps with 15 reset in 8 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-12 finished in 63483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 4 out of 604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 599 transition count 564
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 17 place count 587 transition count 552
Iterating global reduction 1 with 12 rules applied. Total rules applied 29 place count 587 transition count 552
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 580 transition count 545
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 580 transition count 545
Applied a total of 43 rules in 43 ms. Remains 580 /604 variables (removed 24) and now considering 545/564 (removed 19) transitions.
// Phase 1: matrix 545 rows 580 cols
[2024-06-01 12:16:50] [INFO ] Computed 35 invariants in 3 ms
[2024-06-01 12:16:51] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-06-01 12:16:51] [INFO ] Invariant cache hit.
[2024-06-01 12:16:53] [INFO ] Implicit Places using invariants and state equation in 2380 ms returned []
Implicit Place search using SMT with State Equation took 2876 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2024-06-01 12:16:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 580/604 places, 545/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63096 ms. Remains : 580/604 places, 545/564 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-13
Product exploration explored 100000 steps with 4614 reset in 300 ms.
Product exploration explored 100000 steps with 4891 reset in 344 ms.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
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), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 294 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 60 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 350 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Applied a total of 0 rules in 14 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2024-06-01 12:17:56] [INFO ] Invariant cache hit.
[2024-06-01 12:17:56] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-06-01 12:17:56] [INFO ] Invariant cache hit.
[2024-06-01 12:17:58] [INFO ] Implicit Places using invariants and state equation in 2352 ms returned []
Implicit Place search using SMT with State Equation took 2841 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2024-06-01 12:17:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Finished structural reductions in LTL mode , in 1 iterations and 63041 ms. Remains : 580/580 places, 545/545 transitions.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
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), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 302 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 367 steps (0 resets) in 9 ms. (36 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 350 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 4373 reset in 292 ms.
Product exploration explored 100000 steps with 4932 reset in 332 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Performed 222 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 580 transition count 545
Deduced a syphon composed of 222 places in 2 ms
Applied a total of 222 rules in 75 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2024-06-01 12:19:01] [INFO ] Redundant transitions in 3 ms returned []
Running 515 sub problems to find dead transitions.
// Phase 1: matrix 545 rows 580 cols
[2024-06-01 12:19:01] [INFO ] Computed 35 invariants in 3 ms
[2024-06-01 12:19:01] [INFO ] State equation strengthened by 222 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 222 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 222/837 constraints. Problems are: Problem set: 222 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 837 constraints, problems are : Problem set: 222 solved, 293 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 222 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 222 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 252/580 variables, 35/35 constraints. Problems are: Problem set: 222 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 222 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 222 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1125 variables, 222/837 constraints. Problems are: Problem set: 222 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 293/1130 constraints. Problems are: Problem set: 222 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 222 solved, 293 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 293/515 constraints, Known Traps: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 222 solved, 293 unsolved
Search for dead transitions found 222 dead transitions in 60143ms
Found 222 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 222 transitions
Dead transitions reduction (with SMT) removed 222 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 580/580 places, 323/545 transitions.
Graph (complete) has 878 edges and 580 vertex of which 358 are kept as prefixes of interest. Removing 222 places using SCC suffix rule.2 ms
Discarding 222 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 28 ms. Remains 358 /580 variables (removed 222) and now considering 323/323 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 358/580 places, 323/545 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60258 ms. Remains : 358/580 places, 323/545 transitions.
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Applied a total of 0 rules in 15 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
// Phase 1: matrix 545 rows 580 cols
[2024-06-01 12:20:01] [INFO ] Computed 35 invariants in 3 ms
[2024-06-01 12:20:02] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-06-01 12:20:02] [INFO ] Invariant cache hit.
[2024-06-01 12:20:04] [INFO ] Implicit Places using invariants and state equation in 2364 ms returned []
Implicit Place search using SMT with State Equation took 2875 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2024-06-01 12:20:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Finished structural reductions in LTL mode , in 1 iterations and 63066 ms. Remains : 580/580 places, 545/545 transitions.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-13 finished in 253995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Graph (complete) has 1187 edges and 604 vertex of which 599 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 29 places and 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 570 transition count 294
Reduce places removed 241 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 484 place count 329 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 485 place count 328 transition count 293
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 497 place count 316 transition count 281
Iterating global reduction 3 with 12 rules applied. Total rules applied 509 place count 316 transition count 281
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 514 place count 316 transition count 276
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 519 place count 311 transition count 276
Applied a total of 519 rules in 42 ms. Remains 311 /604 variables (removed 293) and now considering 276/564 (removed 288) transitions.
// Phase 1: matrix 276 rows 311 cols
[2024-06-01 12:21:04] [INFO ] Computed 35 invariants in 2 ms
[2024-06-01 12:21:05] [INFO ] Implicit Places using invariants in 584 ms returned []
[2024-06-01 12:21:05] [INFO ] Invariant cache hit.
[2024-06-01 12:21:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 12:21:06] [INFO ] Implicit Places using invariants and state equation in 1392 ms returned []
Implicit Place search using SMT with State Equation took 2001 ms to find 0 implicit places.
[2024-06-01 12:21:06] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2024-06-01 12:21:06] [INFO ] Invariant cache hit.
[2024-06-01 12:21:06] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/481 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/587 variables, and 299 constraints, problems are : Problem set: 0 solved, 220 unsolved in 22525 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 220/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/587 variables, and 519 constraints, problems are : Problem set: 0 solved, 220 unsolved in 18030 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 40591ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 40594ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/604 places, 276/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42652 ms. Remains : 311/604 places, 276/564 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-14
Product exploration explored 100000 steps with 332 reset in 397 ms.
Product exploration explored 100000 steps with 332 reset in 334 ms.
Computed a total of 311 stabilizing places and 276 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 311 transition count 276
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 132 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 102 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1245 steps (0 resets) in 10 ms. (113 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 181 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 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 276/276 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2024-06-01 12:21:49] [INFO ] Invariant cache hit.
[2024-06-01 12:21:49] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-06-01 12:21:49] [INFO ] Invariant cache hit.
[2024-06-01 12:21:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 12:21:51] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned []
Implicit Place search using SMT with State Equation took 2059 ms to find 0 implicit places.
[2024-06-01 12:21:51] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2024-06-01 12:21:51] [INFO ] Invariant cache hit.
[2024-06-01 12:21:51] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/481 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/587 variables, and 299 constraints, problems are : Problem set: 0 solved, 220 unsolved in 22094 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 220/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/587 variables, and 519 constraints, problems are : Problem set: 0 solved, 220 unsolved in 19011 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 41143ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 41147ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43229 ms. Remains : 311/311 places, 276/276 transitions.
Computed a total of 311 stabilizing places and 276 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 311 transition count 276
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 133 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 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1247 steps (0 resets) in 8 ms. (138 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 164 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 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 332 reset in 394 ms.
Product exploration explored 100000 steps with 332 reset in 458 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 276/276 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2024-06-01 12:22:34] [INFO ] Invariant cache hit.
[2024-06-01 12:22:34] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-06-01 12:22:34] [INFO ] Invariant cache hit.
[2024-06-01 12:22:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 12:22:36] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
[2024-06-01 12:22:36] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2024-06-01 12:22:36] [INFO ] Invariant cache hit.
[2024-06-01 12:22:36] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/481 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/587 variables, and 299 constraints, problems are : Problem set: 0 solved, 220 unsolved in 21854 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 220/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/587 variables, and 519 constraints, problems are : Problem set: 0 solved, 220 unsolved in 19178 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 41067ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 41071ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43251 ms. Remains : 311/311 places, 276/276 transitions.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-14 finished in 132552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Graph (complete) has 1187 edges and 604 vertex of which 599 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 569 transition count 297
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 332 transition count 295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 479 place count 330 transition count 295
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 491 place count 318 transition count 283
Iterating global reduction 3 with 12 rules applied. Total rules applied 503 place count 318 transition count 283
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 508 place count 318 transition count 278
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 513 place count 313 transition count 278
Applied a total of 513 rules in 26 ms. Remains 313 /604 variables (removed 291) and now considering 278/564 (removed 286) transitions.
// Phase 1: matrix 278 rows 313 cols
[2024-06-01 12:23:17] [INFO ] Computed 35 invariants in 2 ms
[2024-06-01 12:23:18] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-06-01 12:23:18] [INFO ] Invariant cache hit.
[2024-06-01 12:23:19] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
[2024-06-01 12:23:19] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2024-06-01 12:23:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 3/481 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/591 variables, and 293 constraints, problems are : Problem set: 0 solved, 219 unsolved in 23104 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 211/502 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 3/481 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 8/512 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/591 variables, and 512 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 53161ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 53166ms
Starting structural reductions in SI_LTL mode, iteration 1 : 313/604 places, 278/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55208 ms. Remains : 313/604 places, 278/564 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-15
Product exploration explored 100000 steps with 666 reset in 568 ms.
Product exploration explored 100000 steps with 665 reset in 517 ms.
Computed a total of 313 stabilizing places and 278 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 313 transition count 278
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 127 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 173 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 637 steps (0 resets) in 7 ms. (79 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 168 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 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:24:14] [INFO ] Invariant cache hit.
[2024-06-01 12:24:15] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 174 ms returned sat
[2024-06-01 12:24:16] [INFO ] [Real]Absence check using state equation in 1128 ms returned sat
[2024-06-01 12:24:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:24:16] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 180 ms returned sat
[2024-06-01 12:24:18] [INFO ] [Nat]Absence check using state equation in 1774 ms returned sat
[2024-06-01 12:24:18] [INFO ] Computed and/alt/rep : 219/225/219 causal constraints (skipped 0 transitions) in 20 ms.
[2024-06-01 12:24:19] [INFO ] Added : 62 causal constraints over 13 iterations in 645 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 278/278 transitions.
Applied a total of 0 rules in 8 ms. Remains 313 /313 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2024-06-01 12:24:19] [INFO ] Invariant cache hit.
[2024-06-01 12:24:19] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-06-01 12:24:19] [INFO ] Invariant cache hit.
[2024-06-01 12:24:21] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
[2024-06-01 12:24:21] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2024-06-01 12:24:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 3/481 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/591 variables, and 293 constraints, problems are : Problem set: 0 solved, 219 unsolved in 22149 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 211/502 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 3/481 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 8/512 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/591 variables, and 512 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 52199ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 52203ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54150 ms. Remains : 313/313 places, 278/278 transitions.
Computed a total of 313 stabilizing places and 278 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 313 transition count 278
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 159 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 105 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 656 steps (0 resets) in 6 ms. (93 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 169 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 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:25:14] [INFO ] Invariant cache hit.
[2024-06-01 12:25:15] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 184 ms returned sat
[2024-06-01 12:25:16] [INFO ] [Real]Absence check using state equation in 1245 ms returned sat
[2024-06-01 12:25:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:25:16] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 178 ms returned sat
[2024-06-01 12:25:18] [INFO ] [Nat]Absence check using state equation in 1671 ms returned sat
[2024-06-01 12:25:18] [INFO ] Computed and/alt/rep : 219/225/219 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 12:25:19] [INFO ] Added : 62 causal constraints over 13 iterations in 1027 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 665 reset in 550 ms.
Product exploration explored 100000 steps with 665 reset in 391 ms.
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 278/278 transitions.
Applied a total of 0 rules in 7 ms. Remains 313 /313 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2024-06-01 12:25:20] [INFO ] Invariant cache hit.
[2024-06-01 12:25:21] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-06-01 12:25:21] [INFO ] Invariant cache hit.
[2024-06-01 12:25:22] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 1843 ms to find 0 implicit places.
[2024-06-01 12:25:22] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2024-06-01 12:25:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 3/481 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/591 variables, and 293 constraints, problems are : Problem set: 0 solved, 219 unsolved in 22695 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 211/502 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 3/481 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 8/512 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/591 variables, and 512 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 52739ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 52742ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54600 ms. Remains : 313/313 places, 278/278 transitions.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-15 finished in 177820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
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((X(p1)||p0)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-30-LTLCardinality-03
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 604 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Graph (complete) has 1187 edges and 604 vertex of which 599 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 569 transition count 296
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 477 place count 331 transition count 296
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 488 place count 320 transition count 285
Iterating global reduction 2 with 11 rules applied. Total rules applied 499 place count 320 transition count 285
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 504 place count 320 transition count 280
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 509 place count 315 transition count 280
Applied a total of 509 rules in 36 ms. Remains 315 /604 variables (removed 289) and now considering 280/564 (removed 284) transitions.
// Phase 1: matrix 280 rows 315 cols
[2024-06-01 12:26:15] [INFO ] Computed 35 invariants in 2 ms
[2024-06-01 12:26:16] [INFO ] Implicit Places using invariants in 636 ms returned []
[2024-06-01 12:26:16] [INFO ] Invariant cache hit.
[2024-06-01 12:26:18] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 2055 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-01 12:26:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 2/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/484 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 5/489 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/489 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/595 variables, and 297 constraints, problems are : Problem set: 0 solved, 221 unsolved in 23582 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 262/315 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 2/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/484 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 213/506 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 5/489 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 8/518 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/595 variables, and 518 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 262/315 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 53642ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 53646ms
Starting structural reductions in LI_LTL mode, iteration 1 : 315/604 places, 280/564 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 55741 ms. Remains : 315/604 places, 280/564 transitions.
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-03
Product exploration explored 100000 steps with 2755 reset in 601 ms.
Product exploration explored 100000 steps with 2774 reset in 660 ms.
Computed a total of 315 stabilizing places and 280 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 315 transition count 280
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) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 559 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 2
RANDOM walk for 40002 steps (124 resets) in 218 ms. (182 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
[2024-06-01 12:27:14] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 4/595 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Generalized P Invariants (flows): 0/35 constraints, State Equation: 0/315 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR p0 (NOT p1))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 840 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1)]
[2024-06-01 12:27:15] [INFO ] Invariant cache hit.
[2024-06-01 12:27:15] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 130 ms returned sat
[2024-06-01 12:27:17] [INFO ] [Real]Absence check using state equation in 1888 ms returned sat
[2024-06-01 12:27:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:27:18] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 150 ms returned sat
[2024-06-01 12:27:20] [INFO ] [Nat]Absence check using state equation in 2238 ms returned sat
[2024-06-01 12:27:20] [INFO ] Computed and/alt/rep : 221/227/221 causal constraints (skipped 0 transitions) in 20 ms.
[2024-06-01 12:27:20] [INFO ] Added : 11 causal constraints over 3 iterations in 418 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 280/280 transitions.
Applied a total of 0 rules in 11 ms. Remains 315 /315 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-06-01 12:27:20] [INFO ] Invariant cache hit.
[2024-06-01 12:27:21] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-06-01 12:27:21] [INFO ] Invariant cache hit.
[2024-06-01 12:27:22] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 2174 ms to find 0 implicit places.
[2024-06-01 12:27:22] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-06-01 12:27:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 2/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/484 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 5/489 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/489 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/595 variables, and 297 constraints, problems are : Problem set: 0 solved, 221 unsolved in 20771 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 262/315 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 2/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/484 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 213/506 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 5/489 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 8/518 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 221 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)
(s43 1)
(s44 0)
(s45 0)
(s76 1)
(s77 0)
(s78 0)
(s79 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 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 1)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/595 variables, and 518 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 262/315 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 50843ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 50848ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53046 ms. Remains : 315/315 places, 280/280 transitions.
Computed a total of 315 stabilizing places and 280 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 315 transition count 280
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 p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 253 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 97 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 205 steps (0 resets) in 7 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 276 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 97 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
[2024-06-01 12:28:14] [INFO ] Invariant cache hit.
[2024-06-01 12:28:15] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 118 ms returned sat
[2024-06-01 12:28:17] [INFO ] [Real]Absence check using state equation in 2423 ms returned sat
[2024-06-01 12:28:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:28:18] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 157 ms returned sat
[2024-06-01 12:28:20] [INFO ] [Nat]Absence check using state equation in 2464 ms returned sat
[2024-06-01 12:28:20] [INFO ] Computed and/alt/rep : 221/227/221 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 12:28:21] [INFO ] Added : 11 causal constraints over 3 iterations in 454 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2739 reset in 1000 ms.
Product exploration explored 100000 steps with 2715 reset in 934 ms.
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 280/280 transitions.
Applied a total of 0 rules in 7 ms. Remains 315 /315 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-06-01 12:28:23] [INFO ] Invariant cache hit.
[2024-06-01 12:28:24] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-06-01 12:28:24] [INFO ] Invariant cache hit.
[2024-06-01 12:28:25] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 2079 ms to find 0 implicit places.
[2024-06-01 12:28:25] [INFO ] Redundant transitions in 2 ms returned []
Running 221 sub problems to find dead transitions.
[2024-06-01 12:28:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 2/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/484 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 5/489 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/489 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/595 variables, and 297 constraints, problems are : Problem set: 0 solved, 221 unsolved in 24161 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 262/315 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 2/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/484 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 213/506 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 5/489 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 8/518 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/595 variables, and 518 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 262/315 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 54211ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 54214ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56309 ms. Remains : 315/315 places, 280/280 transitions.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-03 finished in 184051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1))) U 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(X((F(p0) U G((p1&&F(p2)))))))'
Found a Lengthening insensitive property : HirschbergSinclair-PT-30-LTLCardinality-08
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 6 out of 604 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 604/604 places, 564/564 transitions.
Graph (complete) has 1187 edges and 604 vertex of which 600 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 29 places and 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 231 transitions
Trivial Post-agglo rules discarded 231 transitions
Performed 231 trivial Post agglomeration. Transition count delta: 231
Iterating post reduction 0 with 231 rules applied. Total rules applied 232 place count 571 transition count 304
Reduce places removed 231 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 233 rules applied. Total rules applied 465 place count 340 transition count 302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 467 place count 338 transition count 302
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 479 place count 326 transition count 290
Iterating global reduction 3 with 12 rules applied. Total rules applied 491 place count 326 transition count 290
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 496 place count 326 transition count 285
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 501 place count 321 transition count 285
Applied a total of 501 rules in 28 ms. Remains 321 /604 variables (removed 283) and now considering 285/564 (removed 279) transitions.
// Phase 1: matrix 285 rows 321 cols
[2024-06-01 12:29:20] [INFO ] Computed 36 invariants in 2 ms
[2024-06-01 12:29:21] [INFO ] Implicit Places using invariants in 708 ms returned []
[2024-06-01 12:29:21] [INFO ] Invariant cache hit.
[2024-06-01 12:29:22] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-06-01 12:29:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 2/266 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 2/268 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 233/501 variables, 268/305 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 3/504 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 229 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 504/606 variables, and 307 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 270/321 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 2/266 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-06-01 12:29:57] [INFO ] Deduced a trap composed of 2 places in 148 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 2/268 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 233/501 variables, 268/306 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 223/529 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-06-01 12:30:09] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 13 (OVERLAPS) 3/504 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/606 variables, and 538 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 270/321 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 3/3 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LI_LTL mode, iteration 1 : 321/604 places, 285/564 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62128 ms. Remains : 321/604 places, 285/564 transitions.
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-08
Product exploration explored 100000 steps with 1954 reset in 790 ms.
Product exploration explored 100000 steps with 1931 reset in 706 ms.
Computed a total of 321 stabilizing places and 285 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 321 transition count 285
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 p2), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 963 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 848 steps (0 resets) in 9 ms. (84 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1696 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 321 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 : 321/321 places, 285/285 transitions.
Applied a total of 0 rules in 11 ms. Remains 321 /321 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-06-01 12:30:27] [INFO ] Invariant cache hit.
[2024-06-01 12:30:27] [INFO ] Implicit Places using invariants in 720 ms returned []
[2024-06-01 12:30:27] [INFO ] Invariant cache hit.
[2024-06-01 12:30:29] [INFO ] Implicit Places using invariants and state equation in 1528 ms returned []
Implicit Place search using SMT with State Equation took 2250 ms to find 0 implicit places.
[2024-06-01 12:30:29] [INFO ] Redundant transitions in 2 ms returned []
Running 229 sub problems to find dead transitions.
[2024-06-01 12:30:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 2/266 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 2/268 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-06-01 12:30:42] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 233/501 variables, 268/305 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 3/504 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 229 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 0.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 1.0)
(s19 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/606 variables, and 307 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 270/321 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 2/266 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-06-01 12:31:04] [INFO ] Deduced a trap composed of 2 places in 188 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 2/268 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 233/501 variables, 268/306 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 223/529 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-06-01 12:31:14] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 13 (OVERLAPS) 3/504 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 6/538 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/606 variables, and 538 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 270/321 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 3/3 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62342 ms. Remains : 321/321 places, 285/285 transitions.
Computed a total of 321 stabilizing places and 285 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 321 transition count 285
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 p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 686 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 867 steps (0 resets) in 8 ms. (96 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p2), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 5 factoid took 847 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 1970 reset in 896 ms.
Product exploration explored 100000 steps with 1954 reset in 597 ms.
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 285/285 transitions.
Graph (complete) has 840 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 320 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 319 transition count 284
Applied a total of 3 rules in 8 ms. Remains 319 /321 variables (removed 2) and now considering 284/285 (removed 1) transitions.
// Phase 1: matrix 284 rows 319 cols
[2024-06-01 12:31:33] [INFO ] Computed 35 invariants in 2 ms
[2024-06-01 12:31:33] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-01 12:31:33] [INFO ] Invariant cache hit.
[2024-06-01 12:31:34] [INFO ] Implicit Places using invariants and state equation in 1317 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2024-06-01 12:31:34] [INFO ] Redundant transitions in 3 ms returned []
Running 228 sub problems to find dead transitions.
[2024-06-01 12:31:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 3/266 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 231/497 variables, 266/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/497 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/603 variables, and 301 constraints, problems are : Problem set: 0 solved, 228 unsolved in 20838 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 266/319 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 3/266 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 231/497 variables, 266/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 228/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/603 variables, and 529 constraints, problems are : Problem set: 0 solved, 228 unsolved in 25856 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 266/319 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 46731ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 46735ms
Starting structural reductions in SI_LTL mode, iteration 1 : 319/321 places, 284/285 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48463 ms. Remains : 319/321 places, 284/285 transitions.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-08 finished in 181828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
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' '!(G(F(p0)))'
[2024-06-01 12:32:22] [INFO ] Flatten gal took : 72 ms
[2024-06-01 12:32:22] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 12:32:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 604 places, 564 transitions and 1723 arcs took 12 ms.
Total runtime 2120089 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-30"
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-30, 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-171649587400099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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