Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028500491.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CO4-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028500491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 255K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CO4-PT-15-LTLCardinality-00
FORMULA_NAME CO4-PT-15-LTLCardinality-01
FORMULA_NAME CO4-PT-15-LTLCardinality-02
FORMULA_NAME CO4-PT-15-LTLCardinality-03
FORMULA_NAME CO4-PT-15-LTLCardinality-04
FORMULA_NAME CO4-PT-15-LTLCardinality-05
FORMULA_NAME CO4-PT-15-LTLCardinality-06
FORMULA_NAME CO4-PT-15-LTLCardinality-07
FORMULA_NAME CO4-PT-15-LTLCardinality-08
FORMULA_NAME CO4-PT-15-LTLCardinality-09
FORMULA_NAME CO4-PT-15-LTLCardinality-10
FORMULA_NAME CO4-PT-15-LTLCardinality-11
FORMULA_NAME CO4-PT-15-LTLCardinality-12
FORMULA_NAME CO4-PT-15-LTLCardinality-13
FORMULA_NAME CO4-PT-15-LTLCardinality-14
FORMULA_NAME CO4-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748607601156

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 12:20:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 12:20:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:20:02] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-05-30 12:20:02] [INFO ] Transformed 833 places.
[2025-05-30 12:20:02] [INFO ] Transformed 1106 transitions.
[2025-05-30 12:20:02] [INFO ] Found NUPN structural information;
[2025-05-30 12:20:02] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 124 places in 11 ms
Reduce places removed 124 places and 197 transitions.
FORMULA CO4-PT-15-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 909/909 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 689 transition count 906
Discarding 161 places :
Symmetric choice reduction at 1 with 161 rule applications. Total rules 184 place count 528 transition count 743
Iterating global reduction 1 with 161 rules applied. Total rules applied 345 place count 528 transition count 743
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 352 place count 528 transition count 736
Discarding 83 places :
Symmetric choice reduction at 2 with 83 rule applications. Total rules 435 place count 445 transition count 643
Iterating global reduction 2 with 83 rules applied. Total rules applied 518 place count 445 transition count 643
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 521 place count 445 transition count 640
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 539 place count 427 transition count 613
Iterating global reduction 3 with 18 rules applied. Total rules applied 557 place count 427 transition count 613
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 559 place count 427 transition count 611
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 568 place count 418 transition count 602
Iterating global reduction 4 with 9 rules applied. Total rules applied 577 place count 418 transition count 602
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 583 place count 412 transition count 596
Iterating global reduction 4 with 6 rules applied. Total rules applied 589 place count 412 transition count 596
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 595 place count 412 transition count 590
Applied a total of 595 rules in 164 ms. Remains 412 /709 variables (removed 297) and now considering 590/909 (removed 319) transitions.
// Phase 1: matrix 590 rows 412 cols
[2025-05-30 12:20:03] [INFO ] Computed 7 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:20:03] [INFO ] Implicit Places using invariants in 294 ms returned [5, 355]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 327 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 410/709 places, 590/909 transitions.
Applied a total of 0 rules in 12 ms. Remains 410 /410 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 516 ms. Remains : 410/709 places, 590/909 transitions.
Support contains 23 out of 410 places after structural reductions.
[2025-05-30 12:20:03] [INFO ] Flatten gal took : 62 ms
[2025-05-30 12:20:03] [INFO ] Flatten gal took : 33 ms
[2025-05-30 12:20:03] [INFO ] Input system was already deterministic with 590 transitions.
RANDOM walk for 40000 steps (698 resets) in 1552 ms. (25 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40004 steps (157 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (146 resets) in 109 ms. (363 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40001 steps (129 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (159 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (158 resets) in 75 ms. (526 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (156 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (153 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
// Phase 1: matrix 590 rows 410 cols
[2025-05-30 12:20:04] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 325/390 variables, 81/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 13/403 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 13/416 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 379/795 variables, 189/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/795 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 179/974 variables, 107/396 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/974 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 25/999 variables, 18/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/999 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/1000 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1000 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1000 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 415 constraints, problems are : Problem set: 0 solved, 6 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 325/390 variables, 81/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 13/403 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 13/416 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 379/795 variables, 189/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/795 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 179/974 variables, 107/402 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/974 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 25/999 variables, 18/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/999 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/1000 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1000 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1000 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 421 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2104 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2871ms problems are : Problem set: 0 solved, 6 unsolved
Finished Parikh walk after 85 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 729 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 867 edges and 410 vertex of which 407 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))||(F(p0)&&F(!p1))) U X((p2&&X(!p2)))))'
Support contains 4 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 590/590 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 403 transition count 583
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 403 transition count 583
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 400 transition count 579
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 400 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 400 transition count 578
Applied a total of 21 rules in 17 ms. Remains 400 /410 variables (removed 10) and now considering 578/590 (removed 12) transitions.
// Phase 1: matrix 578 rows 400 cols
[2025-05-30 12:20:08] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:20:08] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-30 12:20:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:20:08] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 577 sub problems to find dead transitions.
[2025-05-30 12:20:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (OVERLAPS) 578/978 variables, 400/405 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:20:31] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:20:31] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 7 ms to minimize.
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 978/978 variables, and 407 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (OVERLAPS) 578/978 variables, 400/407 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 577/984 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 984 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Starting structural reductions in LTL mode, iteration 1 : 400/410 places, 578/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60577 ms. Remains : 400/410 places, 578/590 transitions.
Stuttering acceptance computed with spot in 697 ms :[true, (NOT p0), true, (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-00
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 4 ms.
FORMULA CO4-PT-15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-00 finished in 61362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 590/590 transitions.
Graph (trivial) has 440 edges and 410 vertex of which 2 / 410 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 866 edges and 409 vertex of which 406 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.17 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 145 rules applied. Total rules applied 147 place count 405 transition count 440
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 147 rules applied. Total rules applied 294 place count 263 transition count 435
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 297 place count 260 transition count 435
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 297 place count 260 transition count 387
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 393 place count 212 transition count 387
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 396 place count 209 transition count 384
Iterating global reduction 3 with 3 rules applied. Total rules applied 399 place count 209 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 401 place count 209 transition count 382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 402 place count 208 transition count 382
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 402 place count 208 transition count 380
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 406 place count 206 transition count 380
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 407 place count 205 transition count 378
Iterating global reduction 5 with 1 rules applied. Total rules applied 408 place count 205 transition count 378
Performed 63 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 534 place count 142 transition count 300
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 18 rules applied. Total rules applied 552 place count 142 transition count 282
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 558 place count 139 transition count 279
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 562 place count 135 transition count 271
Iterating global reduction 7 with 4 rules applied. Total rules applied 566 place count 135 transition count 271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 574 place count 131 transition count 267
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 575 place count 130 transition count 265
Iterating global reduction 7 with 1 rules applied. Total rules applied 576 place count 130 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 577 place count 130 transition count 264
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 659 place count 89 transition count 310
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 679 place count 89 transition count 290
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 707 place count 61 transition count 178
Iterating global reduction 9 with 28 rules applied. Total rules applied 735 place count 61 transition count 178
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 753 place count 61 transition count 160
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 760 place count 54 transition count 122
Iterating global reduction 10 with 7 rules applied. Total rules applied 767 place count 54 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 772 place count 54 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 774 place count 53 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 11 with 18 rules applied. Total rules applied 792 place count 53 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 794 place count 51 transition count 114
Applied a total of 794 rules in 258 ms. Remains 51 /410 variables (removed 359) and now considering 114/590 (removed 476) transitions.
[2025-05-30 12:21:09] [INFO ] Flow matrix only has 93 transitions (discarded 21 similar events)
// Phase 1: matrix 93 rows 51 cols
[2025-05-30 12:21:09] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:21:10] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-05-30 12:21:10] [INFO ] Flow matrix only has 93 transitions (discarded 21 similar events)
[2025-05-30 12:21:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:21:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 12:21:10] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:21:10] [INFO ] Redundant transitions in 3 ms returned []
Running 97 sub problems to find dead transitions.
[2025-05-30 12:21:10] [INFO ] Flow matrix only has 93 transitions (discarded 21 similar events)
[2025-05-30 12:21:10] [INFO ] Invariant cache hit.
[2025-05-30 12:21:10] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 92/142 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 1/143 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/144 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 60 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2837 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 92/142 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 51/109 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/143 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 46/156 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 157 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3849 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6707ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 6709ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/410 places, 114/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7246 ms. Remains : 51/410 places, 114/590 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-02
Product exploration explored 100000 steps with 51 reset in 152 ms.
Product exploration explored 100000 steps with 123 reset in 77 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 31 ms :[(NOT p0)]
RANDOM walk for 1830 steps (138 resets) in 41 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 114/114 transitions.
Applied a total of 0 rules in 11 ms. Remains 51 /51 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-05-30 12:21:17] [INFO ] Flow matrix only has 93 transitions (discarded 21 similar events)
[2025-05-30 12:21:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:21:17] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-30 12:21:17] [INFO ] Flow matrix only has 93 transitions (discarded 21 similar events)
[2025-05-30 12:21:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:21:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 12:21:17] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:21:17] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2025-05-30 12:21:17] [INFO ] Flow matrix only has 93 transitions (discarded 21 similar events)
[2025-05-30 12:21:17] [INFO ] Invariant cache hit.
[2025-05-30 12:21:17] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 92/142 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 1/143 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/144 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 60 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2738 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 92/142 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 51/109 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/143 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 46/156 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 157 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3962 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6720ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 6721ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6836 ms. Remains : 51/51 places, 114/114 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 661 steps (46 resets) in 10 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 154 reset in 54 ms.
Product exploration explored 100000 steps with 63 reset in 78 ms.
Built C files in :
/tmp/ltsmin10103178987837438135
[2025-05-30 12:21:24] [INFO ] Computing symmetric may disable matrix : 114 transitions.
[2025-05-30 12:21:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:21:24] [INFO ] Computing symmetric may enable matrix : 114 transitions.
[2025-05-30 12:21:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:21:24] [INFO ] Computing Do-Not-Accords matrix : 114 transitions.
[2025-05-30 12:21:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:21:24] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10103178987837438135
Running compilation step : cd /tmp/ltsmin10103178987837438135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 339 ms.
Running link step : cd /tmp/ltsmin10103178987837438135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin10103178987837438135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3069634558151263036.hoa' '--buchi-type=spotba'
LTSmin run took 149 ms.
FORMULA CO4-PT-15-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-15-LTLCardinality-02 finished in 15787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U (!p1&&G(!p0)))))'
Support contains 4 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 590/590 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 404 transition count 584
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 404 transition count 584
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 402 transition count 582
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 402 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 402 transition count 581
Applied a total of 17 rules in 26 ms. Remains 402 /410 variables (removed 8) and now considering 581/590 (removed 9) transitions.
// Phase 1: matrix 581 rows 402 cols
[2025-05-30 12:21:25] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:21:25] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-05-30 12:21:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:21:25] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2025-05-30 12:21:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (OVERLAPS) 581/983 variables, 402/407 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:21:49] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:21:49] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 983/983 variables, and 409 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 581/983 variables, 402/409 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/983 variables, 580/989 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 983/983 variables, and 989 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 402/410 places, 581/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60485 ms. Remains : 402/410 places, 581/590 transitions.
Stuttering acceptance computed with spot in 130 ms :[p0, (OR p0 p1), true, (OR p1 p0)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-04 finished in 60631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(G(p1))))))'
Support contains 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 590/590 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 404 transition count 584
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 404 transition count 584
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 402 transition count 581
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 402 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 402 transition count 580
Applied a total of 17 rules in 22 ms. Remains 402 /410 variables (removed 8) and now considering 580/590 (removed 10) transitions.
// Phase 1: matrix 580 rows 402 cols
[2025-05-30 12:22:26] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:22:26] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-05-30 12:22:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:22:26] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 579 sub problems to find dead transitions.
[2025-05-30 12:22:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:22:39] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/982 variables, 402/408 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:22:50] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:22:50] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:22:51] [INFO ] Deduced a trap composed of 18 places in 305 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:22:51] [INFO ] Deduced a trap composed of 154 places in 263 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 982/982 variables, and 412 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/982 variables, 402/412 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 579/991 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/982 variables, and 991 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 402/410 places, 580/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60493 ms. Remains : 402/410 places, 580/590 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-15-LTLCardinality-05
Product exploration explored 100000 steps with 1018 reset in 139 ms.
Product exploration explored 100000 steps with 193 reset in 150 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 853 edges and 402 vertex of which 399 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (837 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (155 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 733914 steps, run visited all 1 properties in 1517 ms. (steps per millisecond=483 )
Probabilistic random walk after 733914 steps, saw 121814 distinct states, run finished after 1521 ms. (steps per millisecond=482 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 402 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 580/580 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 580/580 (removed 0) transitions.
[2025-05-30 12:23:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:23:29] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-30 12:23:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:23:29] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 579 sub problems to find dead transitions.
[2025-05-30 12:23:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:42] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/982 variables, 402/408 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:52] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:52] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:53] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:53] [INFO ] Deduced a trap composed of 154 places in 111 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 982/982 variables, and 412 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/982 variables, 402/412 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 579/991 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/982 variables, and 991 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Finished structural reductions in LTL mode , in 1 iterations and 60574 ms. Remains : 402/402 places, 580/580 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 853 edges and 402 vertex of which 399 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (561 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (160 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 733914 steps, run visited all 1 properties in 1467 ms. (steps per millisecond=500 )
Probabilistic random walk after 733914 steps, saw 121814 distinct states, run finished after 1467 ms. (steps per millisecond=500 ) properties seen :1
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 844 reset in 100 ms.
Product exploration explored 100000 steps with 489 reset in 109 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 580/580 transitions.
Graph (trivial) has 435 edges and 402 vertex of which 2 / 402 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 852 edges and 401 vertex of which 398 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 145 rules applied. Total rules applied 147 place count 398 transition count 573
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 150 place count 398 transition count 570
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 150 place count 398 transition count 616
Deduced a syphon composed of 189 places in 0 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 197 place count 398 transition count 616
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 232 place count 363 transition count 581
Deduced a syphon composed of 154 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 267 place count 363 transition count 581
Performed 49 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 203 places in 0 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 316 place count 363 transition count 622
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 329 place count 363 transition count 609
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 356 place count 336 transition count 578
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 383 place count 336 transition count 578
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 184 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 387 place count 336 transition count 578
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 390 place count 336 transition count 575
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 398 place count 328 transition count 566
Deduced a syphon composed of 177 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 406 place count 328 transition count 566
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 408 place count 326 transition count 563
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 410 place count 326 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 411 place count 326 transition count 562
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 412 place count 325 transition count 561
Deduced a syphon composed of 175 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 413 place count 325 transition count 561
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 177 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 415 place count 325 transition count 561
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 417 place count 323 transition count 559
Deduced a syphon composed of 175 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 419 place count 323 transition count 559
Performed 58 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 233 places in 0 ms
Iterating global reduction 5 with 58 rules applied. Total rules applied 477 place count 323 transition count 838
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 529 place count 323 transition count 786
Discarding 115 places :
Symmetric choice reduction at 6 with 115 rule applications. Total rules 644 place count 208 transition count 471
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 6 with 115 rules applied. Total rules applied 759 place count 208 transition count 471
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 791 place count 208 transition count 439
Discarding 67 places :
Symmetric choice reduction at 7 with 67 rule applications. Total rules 858 place count 141 transition count 302
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 7 with 67 rules applied. Total rules applied 925 place count 141 transition count 302
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 932 place count 141 transition count 295
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 946 place count 127 transition count 267
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 8 with 14 rules applied. Total rules applied 960 place count 127 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 961 place count 127 transition count 292
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 968 place count 127 transition count 285
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 971 place count 124 transition count 267
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 974 place count 124 transition count 267
Deduced a syphon composed of 69 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 9 with 21 rules applied. Total rules applied 995 place count 124 transition count 246
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 996 place count 123 transition count 245
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 997 place count 123 transition count 245
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 998 place count 123 transition count 269
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 999 place count 122 transition count 260
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1000 place count 122 transition count 260
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 1000 rules in 170 ms. Remains 122 /402 variables (removed 280) and now considering 260/580 (removed 320) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:24:32] [INFO ] Redundant transitions in 11 ms returned []
Running 259 sub problems to find dead transitions.
[2025-05-30 12:24:32] [INFO ] Flow matrix only has 248 transitions (discarded 12 similar events)
// Phase 1: matrix 248 rows 122 cols
[2025-05-30 12:24:32] [INFO ] Computed 5 invariants in 1 ms
[2025-05-30 12:24:32] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:24:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:24:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:24:34] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:24:34] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:24:34] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 5/10 constraints. Problems are: Problem set: 13 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 13 solved, 246 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 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 TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 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 TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 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 TDEAD234 is UNSAT
Problem TDEAD235 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
At refinement iteration 4 (OVERLAPS) 247/369 variables, 122/132 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 42/174 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/174 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 1/370 variables, 1/175 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/175 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/175 constraints. Problems are: Problem set: 152 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 175 constraints, problems are : Problem set: 152 solved, 107 unsolved in 9649 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 122/122 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 152 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 14/67 variables, 5/5 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 5/10 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 238/305 variables, 67/77 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 42/119 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 107/226 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/226 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 64/369 variables, 55/281 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/281 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 1/370 variables, 1/282 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/282 constraints. Problems are: Problem set: 152 solved, 107 unsolved
At refinement iteration 12 (OVERLAPS) 0/370 variables, 0/282 constraints. Problems are: Problem set: 152 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 282 constraints, problems are : Problem set: 152 solved, 107 unsolved in 11318 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 122/122 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 107/259 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21008ms problems are : Problem set: 152 solved, 107 unsolved
Search for dead transitions found 152 dead transitions in 21010ms
Found 152 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 152 transitions
Dead transitions reduction (with SMT) removed 152 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 122/402 places, 108/580 transitions.
Graph (complete) has 232 edges and 122 vertex of which 54 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.0 ms
Discarding 68 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 128
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 54 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 9 rules in 10 ms. Remains 54 /122 variables (removed 68) and now considering 121/108 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/402 places, 121/580 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21235 ms. Remains : 54/402 places, 121/580 transitions.
Built C files in :
/tmp/ltsmin12170037096101994857
[2025-05-30 12:24:53] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12170037096101994857
Running compilation step : cd /tmp/ltsmin12170037096101994857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 811 ms.
Running link step : cd /tmp/ltsmin12170037096101994857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12170037096101994857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3310150876593094839.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 580/580 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 580/580 (removed 0) transitions.
// Phase 1: matrix 580 rows 402 cols
[2025-05-30 12:25:09] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:25:09] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-05-30 12:25:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:25:09] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 579 sub problems to find dead transitions.
[2025-05-30 12:25:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:22] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/982 variables, 402/408 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:32] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:32] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:33] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:34] [INFO ] Deduced a trap composed of 154 places in 130 ms of which 5 ms to minimize.
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 982/982 variables, and 412 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/982 variables, 402/412 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 579/991 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/982 variables, and 991 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Finished structural reductions in LTL mode , in 1 iterations and 60673 ms. Remains : 402/402 places, 580/580 transitions.
Built C files in :
/tmp/ltsmin4475443674533506636
[2025-05-30 12:26:09] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4475443674533506636
Running compilation step : cd /tmp/ltsmin4475443674533506636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 796 ms.
Running link step : cd /tmp/ltsmin4475443674533506636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4475443674533506636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14748525385935500378.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 12:26:24] [INFO ] Flatten gal took : 26 ms
[2025-05-30 12:26:24] [INFO ] Flatten gal took : 25 ms
[2025-05-30 12:26:24] [INFO ] Time to serialize gal into /tmp/LTL13844275163947794079.gal : 5 ms
[2025-05-30 12:26:24] [INFO ] Time to serialize properties into /tmp/LTL2825034113026503943.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13844275163947794079.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16156656794337231474.hoa' '-atoms' '/tmp/LTL2825034113026503943.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2825034113026503943.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16156656794337231474.hoa
Detected timeout of ITS tools.
[2025-05-30 12:26:40] [INFO ] Flatten gal took : 22 ms
[2025-05-30 12:26:40] [INFO ] Flatten gal took : 20 ms
[2025-05-30 12:26:40] [INFO ] Time to serialize gal into /tmp/LTL13086936947040428902.gal : 4 ms
[2025-05-30 12:26:40] [INFO ] Time to serialize properties into /tmp/LTL17447361623815751171.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13086936947040428902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17447361623815751171.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p573==0)")&&(X(G("((p499==0)||(p717==1))")))))))
Formula 0 simplified : XX(!"(p573==0)" | XF!"((p499==0)||(p717==1))")
Detected timeout of ITS tools.
[2025-05-30 12:26:55] [INFO ] Flatten gal took : 20 ms
[2025-05-30 12:26:55] [INFO ] Applying decomposition
[2025-05-30 12:26:55] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2876958586160954176.txt' '-o' '/tmp/graph2876958586160954176.bin' '-w' '/tmp/graph2876958586160954176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2876958586160954176.bin' '-l' '-1' '-v' '-w' '/tmp/graph2876958586160954176.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:26:55] [INFO ] Decomposing Gal with order
[2025-05-30 12:26:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:26:55] [INFO ] Removed a total of 362 redundant transitions.
[2025-05-30 12:26:55] [INFO ] Flatten gal took : 72 ms
[2025-05-30 12:26:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 13 ms.
[2025-05-30 12:26:55] [INFO ] Time to serialize gal into /tmp/LTL10012570826052919136.gal : 7 ms
[2025-05-30 12:26:55] [INFO ] Time to serialize properties into /tmp/LTL1771301413506021290.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10012570826052919136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1771301413506021290.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(("(i11.u93.p573==0)")&&(X(G("((i9.u78.p499==0)||(i16.u121.p717==1))")))))))
Formula 0 simplified : XX(!"(i11.u93.p573==0)" | XF!"((i9.u78.p499==0)||(i16.u121.p717==1))")
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t47, t75, t133, t143, t161, t188, t216, t234, t244, t284, t312, t371, t441, t47...862
Computing Next relation with stutter on 391679 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
699 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.04464,269504,1,0,323736,1159,6255,2.1966e+06,400,4910,440957
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-15-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CO4-PT-15-LTLCardinality-05 finished in 278330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(p1&&X((p2&&X(X(!p0)))))))))'
Support contains 4 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 590/590 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 405 transition count 585
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 405 transition count 585
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 402 transition count 581
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 402 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 402 transition count 580
Applied a total of 17 rules in 21 ms. Remains 402 /410 variables (removed 8) and now considering 580/590 (removed 10) transitions.
// Phase 1: matrix 580 rows 402 cols
[2025-05-30 12:27:04] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:04] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-05-30 12:27:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:04] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 579 sub problems to find dead transitions.
[2025-05-30 12:27:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:27:18] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/982 variables, 402/408 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:27:29] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:27:29] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 7 ms to minimize.
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 982/982 variables, and 410 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/982 variables, 402/410 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 579/989 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/982 variables, and 989 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 402/410 places, 580/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60554 ms. Remains : 402/410 places, 580/590 transitions.
Stuttering acceptance computed with spot in 441 ms :[p0, p0, p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : CO4-PT-15-LTLCardinality-06
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA CO4-PT-15-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-06 finished in 61023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 590/590 transitions.
Graph (trivial) has 445 edges and 410 vertex of which 2 / 410 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 866 edges and 409 vertex of which 406 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 405 transition count 436
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 149 rules applied. Total rules applied 300 place count 259 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 301 place count 258 transition count 433
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 301 place count 258 transition count 385
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 397 place count 210 transition count 385
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 400 place count 207 transition count 382
Iterating global reduction 3 with 3 rules applied. Total rules applied 403 place count 207 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 405 place count 207 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 406 place count 206 transition count 380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 406 place count 206 transition count 378
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 410 place count 204 transition count 378
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 411 place count 203 transition count 376
Iterating global reduction 5 with 1 rules applied. Total rules applied 412 place count 203 transition count 376
Performed 63 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 538 place count 140 transition count 298
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 18 rules applied. Total rules applied 556 place count 140 transition count 280
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 562 place count 137 transition count 277
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 566 place count 133 transition count 269
Iterating global reduction 7 with 4 rules applied. Total rules applied 570 place count 133 transition count 269
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 578 place count 129 transition count 265
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 579 place count 128 transition count 263
Iterating global reduction 7 with 1 rules applied. Total rules applied 580 place count 128 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 581 place count 128 transition count 262
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 661 place count 88 transition count 307
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 681 place count 88 transition count 287
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 708 place count 61 transition count 179
Iterating global reduction 9 with 27 rules applied. Total rules applied 735 place count 61 transition count 179
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 753 place count 61 transition count 161
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 760 place count 54 transition count 123
Iterating global reduction 10 with 7 rules applied. Total rules applied 767 place count 54 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 772 place count 54 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 11 with 12 rules applied. Total rules applied 784 place count 54 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 786 place count 52 transition count 104
Applied a total of 786 rules in 51 ms. Remains 52 /410 variables (removed 358) and now considering 104/590 (removed 486) transitions.
[2025-05-30 12:28:05] [INFO ] Flow matrix only has 86 transitions (discarded 18 similar events)
// Phase 1: matrix 86 rows 52 cols
[2025-05-30 12:28:05] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:05] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-30 12:28:05] [INFO ] Flow matrix only has 86 transitions (discarded 18 similar events)
[2025-05-30 12:28:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:28:05] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:28:05] [INFO ] Redundant transitions in 1 ms returned []
Running 84 sub problems to find dead transitions.
[2025-05-30 12:28:05] [INFO ] Flow matrix only has 86 transitions (discarded 18 similar events)
[2025-05-30 12:28:05] [INFO ] Invariant cache hit.
[2025-05-30 12:28:05] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 85/137 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 1/138 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 59 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1855 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 85/137 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 84/142 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 143 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2606 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4474ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 4474ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/410 places, 104/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4631 ms. Remains : 52/410 places, 104/590 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-09
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-09 finished in 4693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 590/590 transitions.
Graph (trivial) has 445 edges and 410 vertex of which 2 / 410 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 866 edges and 409 vertex of which 406 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 405 transition count 436
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 149 rules applied. Total rules applied 300 place count 259 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 301 place count 258 transition count 433
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 301 place count 258 transition count 385
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 397 place count 210 transition count 385
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 400 place count 207 transition count 382
Iterating global reduction 3 with 3 rules applied. Total rules applied 403 place count 207 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 405 place count 207 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 406 place count 206 transition count 380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 406 place count 206 transition count 378
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 410 place count 204 transition count 378
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 411 place count 203 transition count 376
Iterating global reduction 5 with 1 rules applied. Total rules applied 412 place count 203 transition count 376
Performed 63 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 538 place count 140 transition count 298
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 18 rules applied. Total rules applied 556 place count 140 transition count 280
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 562 place count 137 transition count 277
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 566 place count 133 transition count 269
Iterating global reduction 7 with 4 rules applied. Total rules applied 570 place count 133 transition count 269
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 578 place count 129 transition count 265
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 579 place count 128 transition count 263
Iterating global reduction 7 with 1 rules applied. Total rules applied 580 place count 128 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 581 place count 128 transition count 262
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 661 place count 88 transition count 307
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 681 place count 88 transition count 287
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 708 place count 61 transition count 179
Iterating global reduction 9 with 27 rules applied. Total rules applied 735 place count 61 transition count 179
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 753 place count 61 transition count 161
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 760 place count 54 transition count 123
Iterating global reduction 10 with 7 rules applied. Total rules applied 767 place count 54 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 772 place count 54 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 774 place count 53 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 793 place count 53 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 795 place count 51 transition count 114
Applied a total of 795 rules in 55 ms. Remains 51 /410 variables (removed 359) and now considering 114/590 (removed 476) transitions.
[2025-05-30 12:28:10] [INFO ] Flow matrix only has 85 transitions (discarded 29 similar events)
// Phase 1: matrix 85 rows 51 cols
[2025-05-30 12:28:10] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:10] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-30 12:28:10] [INFO ] Flow matrix only has 85 transitions (discarded 29 similar events)
[2025-05-30 12:28:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 12:28:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:28:10] [INFO ] Redundant transitions in 0 ms returned []
Running 94 sub problems to find dead transitions.
[2025-05-30 12:28:10] [INFO ] Flow matrix only has 85 transitions (discarded 29 similar events)
[2025-05-30 12:28:10] [INFO ] Invariant cache hit.
[2025-05-30 12:28:10] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 84/135 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 1/136 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 59 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1910 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 84/135 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 94/152 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 1/136 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 153 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2894 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4819ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 4819ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/410 places, 114/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4968 ms. Remains : 51/410 places, 114/590 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-11
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA CO4-PT-15-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-11 finished in 5070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 590/590 transitions.
Graph (trivial) has 441 edges and 410 vertex of which 2 / 410 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 866 edges and 409 vertex of which 406 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 147 rules applied. Total rules applied 149 place count 405 transition count 438
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 147 rules applied. Total rules applied 296 place count 261 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 260 transition count 435
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 297 place count 260 transition count 387
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 393 place count 212 transition count 387
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 394 place count 211 transition count 386
Iterating global reduction 3 with 1 rules applied. Total rules applied 395 place count 211 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 395 place count 211 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 397 place count 210 transition count 385
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 398 place count 209 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 399 place count 209 transition count 383
Performed 65 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 529 place count 144 transition count 303
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 17 rules applied. Total rules applied 546 place count 144 transition count 286
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 552 place count 141 transition count 283
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 556 place count 137 transition count 275
Iterating global reduction 5 with 4 rules applied. Total rules applied 560 place count 137 transition count 275
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 566 place count 134 transition count 272
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 567 place count 133 transition count 270
Iterating global reduction 5 with 1 rules applied. Total rules applied 568 place count 133 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 569 place count 133 transition count 269
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 649 place count 93 transition count 315
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 669 place count 93 transition count 295
Discarding 26 places :
Symmetric choice reduction at 7 with 26 rule applications. Total rules 695 place count 67 transition count 191
Iterating global reduction 7 with 26 rules applied. Total rules applied 721 place count 67 transition count 191
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 739 place count 67 transition count 173
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 745 place count 61 transition count 137
Iterating global reduction 8 with 6 rules applied. Total rules applied 751 place count 61 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 755 place count 61 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 757 place count 60 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 775 place count 60 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 777 place count 58 transition count 130
Applied a total of 777 rules in 44 ms. Remains 58 /410 variables (removed 352) and now considering 130/590 (removed 460) transitions.
[2025-05-30 12:28:15] [INFO ] Flow matrix only has 109 transitions (discarded 21 similar events)
// Phase 1: matrix 109 rows 58 cols
[2025-05-30 12:28:15] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:15] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-30 12:28:15] [INFO ] Flow matrix only has 109 transitions (discarded 21 similar events)
[2025-05-30 12:28:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 12:28:15] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:28:15] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2025-05-30 12:28:15] [INFO ] Flow matrix only has 109 transitions (discarded 21 similar events)
[2025-05-30 12:28:15] [INFO ] Invariant cache hit.
[2025-05-30 12:28:15] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 108/166 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 1/167 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/167 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 67 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2722 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 108/166 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 110/176 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/167 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 177 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4155 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6895ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6896ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/410 places, 130/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7046 ms. Remains : 58/410 places, 130/590 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-15-LTLCardinality-13
Stuttering criterion allowed to conclude after 165 steps with 12 reset in 2 ms.
FORMULA CO4-PT-15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLCardinality-13 finished in 7188 ms.
All properties solved by simple procedures.
Total runtime 499993 ms.

BK_STOP 1748608102439

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-15, 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 r044-tall-174854028500491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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