Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339600267.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 ErlangenMainframeV0-PT-0404, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339600267
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.9K Jun 6 09:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 6 09:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 11:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 09:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 163K Jun 5 20:08 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 ErlangenMainframeV0-PT-0404-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749351696748

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0404
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 03:01:37] [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-06-08 03:01:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 03:01:38] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2025-06-08 03:01:38] [INFO ] Transformed 183 places.
[2025-06-08 03:01:38] [INFO ] Transformed 445 transitions.
[2025-06-08 03:01:38] [INFO ] Found NUPN structural information;
[2025-06-08 03:01:38] [INFO ] Parsed PT model containing 183 places and 445 transitions and 3331 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 445/445 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 151 transition count 413
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 151 transition count 413
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 140 transition count 402
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 140 transition count 402
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 136 transition count 333
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 95 place count 135 transition count 333
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 98 place count 132 transition count 207
Iterating global reduction 0 with 3 rules applied. Total rules applied 101 place count 132 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 102 place count 131 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 103 place count 131 transition count 205
Applied a total of 103 rules in 68 ms. Remains 131 /183 variables (removed 52) and now considering 205/445 (removed 240) transitions.
// Phase 1: matrix 205 rows 131 cols
[2025-06-08 03:01:38] [INFO ] Computed 13 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:01:38] [INFO ] Implicit Places using invariants in 252 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 282 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 130/183 places, 205/445 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 367 ms. Remains : 130/183 places, 205/445 transitions.
Support contains 38 out of 130 places after structural reductions.
[2025-06-08 03:01:38] [INFO ] Flatten gal took : 39 ms
[2025-06-08 03:01:38] [INFO ] Flatten gal took : 19 ms
[2025-06-08 03:01:38] [INFO ] Input system was already deterministic with 205 transitions.
Support contains 36 out of 130 places (down from 38) after GAL structural reductions.
RANDOM walk for 33174 steps (7 resets) in 1047 ms. (31 steps per ms) remains 0/22 properties
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 23 stabilizing places and 23 stable transitions
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)&&F(p1)))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 205/205 transitions.
Graph (trivial) has 105 edges and 130 vertex of which 6 / 130 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 126 transition count 179
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 104 transition count 179
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 45 place count 104 transition count 166
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 71 place count 91 transition count 166
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 85 place count 77 transition count 141
Iterating global reduction 2 with 14 rules applied. Total rules applied 99 place count 77 transition count 141
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 99 place count 77 transition count 137
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 73 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 71 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 71 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 71 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 70 transition count 114
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 70 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 69 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 69 transition count 112
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 164 place count 45 transition count 88
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 168 place count 41 transition count 63
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 173 place count 40 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 175 place count 40 transition count 61
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 177 place count 38 transition count 55
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 38 transition count 55
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 185 place count 35 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 191 place count 35 transition count 56
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 35 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 34 transition count 55
Applied a total of 193 rules in 53 ms. Remains 34 /130 variables (removed 96) and now considering 55/205 (removed 150) transitions.
[2025-06-08 03:01:39] [INFO ] Flow matrix only has 44 transitions (discarded 11 similar events)
// Phase 1: matrix 44 rows 34 cols
[2025-06-08 03:01:39] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:01:39] [INFO ] Implicit Places using invariants in 49 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/130 places, 55/205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 30 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 30 transition count 51
Applied a total of 7 rules in 19 ms. Remains 30 /33 variables (removed 3) and now considering 51/55 (removed 4) transitions.
[2025-06-08 03:01:39] [INFO ] Flow matrix only has 42 transitions (discarded 9 similar events)
// Phase 1: matrix 42 rows 30 cols
[2025-06-08 03:01:39] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:01:39] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-08 03:01:39] [INFO ] Flow matrix only has 42 transitions (discarded 9 similar events)
[2025-06-08 03:01:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:01:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-08 03:01:39] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/130 places, 51/205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 222 ms. Remains : 30/130 places, 51/205 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLCardinality-02 finished in 538 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(X(p1))))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 205/205 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 112 transition count 176
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 112 transition count 176
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 49 place count 99 transition count 160
Iterating global reduction 0 with 13 rules applied. Total rules applied 62 place count 99 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 94 transition count 144
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 92 transition count 144
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 88 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 88 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 87 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 87 transition count 126
Applied a total of 84 rules in 12 ms. Remains 87 /130 variables (removed 43) and now considering 126/205 (removed 79) transitions.
// Phase 1: matrix 126 rows 87 cols
[2025-06-08 03:01:40] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:01:40] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-08 03:01:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:01:40] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2025-06-08 03:01:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:41] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:41] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/213 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 99 constraints, problems are : Problem set: 0 solved, 125 unsolved in 4055 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:44] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/213 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 125/225 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:45] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:45] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:45] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:45] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:46] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:46] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:47] [INFO ] Deduced a trap along path composed of 11 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:47] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:51] [INFO ] Deduced a trap along path composed of 12 places in 32 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/213 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/213 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 234 constraints, problems are : Problem set: 0 solved, 125 unsolved in 13271 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 17383ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 17391ms
Starting structural reductions in LTL mode, iteration 1 : 87/130 places, 126/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17539 ms. Remains : 87/130 places, 126/205 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLCardinality-03
Product exploration explored 100000 steps with 20000 reset in 159 ms.
Product exploration explored 100000 steps with 20000 reset in 118 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 613 steps (0 resets) in 7 ms. (76 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 87 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-08 03:01:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:01:59] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-08 03:01:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:01:59] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2025-06-08 03:01:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:59] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:59] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/213 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 99 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3688 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:03] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/213 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 125/225 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:04] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:04] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:04] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:04] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:04] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:04] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:05] [INFO ] Deduced a trap along path composed of 11 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:06] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:09] [INFO ] Deduced a trap along path composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/213 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/213 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 234 constraints, problems are : Problem set: 0 solved, 125 unsolved in 13322 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 17030ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 17031ms
Finished structural reductions in LTL mode , in 1 iterations and 17158 ms. Remains : 87/87 places, 126/126 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 576 steps (0 resets) in 8 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 68 ms.
Product exploration explored 100000 steps with 20000 reset in 92 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 126/126 transitions.
Graph (trivial) has 69 edges and 87 vertex of which 6 / 87 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 84 transition count 123
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 12 place count 84 transition count 129
Deduced a syphon composed of 18 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 84 transition count 129
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 78 transition count 123
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 78 transition count 123
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 63 place count 78 transition count 125
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 79 place count 62 transition count 89
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 95 place count 62 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 62 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 59 transition count 84
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 59 transition count 84
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 59 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 58 transition count 106
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 58 transition count 106
Deduced a syphon composed of 31 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 127 place count 58 transition count 88
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 131 place count 54 transition count 84
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 54 transition count 84
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 135 rules in 23 ms. Remains 54 /87 variables (removed 33) and now considering 84/126 (removed 42) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:02:17] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-08 03:02:17] [INFO ] Flow matrix only has 72 transitions (discarded 12 similar events)
// Phase 1: matrix 72 rows 54 cols
[2025-06-08 03:02:17] [INFO ] Computed 10 invariants in 1 ms
[2025-06-08 03:02:17] [INFO ] State equation strengthened by 16 read => feed constraints.
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: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:18] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:18] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:18] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:18] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:18] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/20 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/20 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 71/125 variables, 54/74 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 15/89 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/89 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/90 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/90 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/90 constraints. Problems are: Problem set: 36 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 90 constraints, problems are : Problem set: 36 solved, 46 unsolved in 1703 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 28/54 variables, 10/10 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/20 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/20 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 71/125 variables, 54/74 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 15/89 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 46/135 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/135 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/136 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/136 constraints. Problems are: Problem set: 36 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/136 constraints. Problems are: Problem set: 36 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 136 constraints, problems are : Problem set: 36 solved, 46 unsolved in 1815 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 46/82 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3538ms problems are : Problem set: 36 solved, 46 unsolved
Search for dead transitions found 36 dead transitions in 3539ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 54/87 places, 48/126 transitions.
Graph (complete) has 140 edges and 54 vertex of which 27 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 27 /54 variables (removed 27) and now considering 48/48 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/87 places, 48/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3579 ms. Remains : 27/87 places, 48/126 transitions.
Built C files in :
/tmp/ltsmin14787366414905236346
[2025-06-08 03:02:21] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14787366414905236346
Running compilation step : cd /tmp/ltsmin14787366414905236346;'/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 357 ms.
Running link step : cd /tmp/ltsmin14787366414905236346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin14787366414905236346;'/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/stateBased8599633090719274973.hoa' '--buchi-type=spotba'
LTSmin run took 431 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV0-PT-0404-LTLCardinality-03 finished in 42178 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(G(p0))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 205/205 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 110 transition count 174
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 110 transition count 174
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 98 transition count 159
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 98 transition count 159
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 93 transition count 143
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 91 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 87 transition count 127
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 87 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 85 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 85 transition count 123
Applied a total of 88 rules in 13 ms. Remains 85 /130 variables (removed 45) and now considering 123/205 (removed 82) transitions.
// Phase 1: matrix 123 rows 85 cols
[2025-06-08 03:02:22] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:02:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-08 03:02:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:02:22] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-06-08 03:02:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:23] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:23] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/208 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 97 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3608 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:26] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/208 variables, 85/98 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 122/220 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:27] [INFO ] Deduced a trap along path composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:29] [INFO ] Deduced a trap along path composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 222 constraints, problems are : Problem set: 0 solved, 122 unsolved in 9785 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 13427ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 13427ms
Starting structural reductions in LTL mode, iteration 1 : 85/130 places, 123/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13559 ms. Remains : 85/130 places, 123/205 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLCardinality-04 finished in 13683 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(F((G(p0)||(!p1 U (p2||G(!p1))))))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 205/205 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 111 transition count 175
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 111 transition count 175
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 99 transition count 160
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 99 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 94 transition count 144
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 92 transition count 144
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 88 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 88 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 86 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 86 transition count 124
Applied a total of 86 rules in 8 ms. Remains 86 /130 variables (removed 44) and now considering 124/205 (removed 81) transitions.
// Phase 1: matrix 124 rows 86 cols
[2025-06-08 03:02:35] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:02:36] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-08 03:02:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:02:36] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-06-08 03:02:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:36] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:36] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/210 variables, 86/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 98 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3553 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/210 variables, 86/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 123/221 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:40] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:40] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:40] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:40] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:40] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 5/226 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:41] [INFO ] Deduced a trap along path composed of 7 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:41] [INFO ] Deduced a trap along path composed of 13 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:42] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 229 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7666 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 11234ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 11235ms
Starting structural reductions in LTL mode, iteration 1 : 86/130 places, 124/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11472 ms. Remains : 86/130 places, 124/205 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 199 ms.
Stack based approach found an accepted trace after 71 steps with 1 reset with depth 51 and stack size 51 in 1 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLCardinality-05 finished in 11821 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 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 205/205 transitions.
Graph (trivial) has 108 edges and 130 vertex of which 6 / 130 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 126 transition count 176
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 101 transition count 176
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 51 place count 101 transition count 165
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 73 place count 90 transition count 165
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 87 place count 76 transition count 140
Iterating global reduction 2 with 14 rules applied. Total rules applied 101 place count 76 transition count 140
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 101 place count 76 transition count 136
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 109 place count 72 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 70 transition count 122
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 70 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 70 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 69 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 69 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 68 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 68 transition count 111
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 174 place count 40 transition count 83
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 179 place count 35 transition count 57
Ensure Unique test removed 2 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 186 place count 33 transition count 57
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 188 place count 33 transition count 55
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 191 place count 30 transition count 48
Iterating global reduction 4 with 3 rules applied. Total rules applied 194 place count 30 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 29 transition count 47
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 202 place count 26 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 210 place count 26 transition count 46
Applied a total of 210 rules in 27 ms. Remains 26 /130 variables (removed 104) and now considering 46/205 (removed 159) transitions.
[2025-06-08 03:02:47] [INFO ] Flow matrix only has 34 transitions (discarded 12 similar events)
// Phase 1: matrix 34 rows 26 cols
[2025-06-08 03:02:47] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:02:47] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-08 03:02:47] [INFO ] Flow matrix only has 34 transitions (discarded 12 similar events)
[2025-06-08 03:02:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:02:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-08 03:02:47] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:02:47] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-08 03:02:47] [INFO ] Flow matrix only has 34 transitions (discarded 12 similar events)
[2025-06-08 03:02:47] [INFO ] Invariant cache hit.
[2025-06-08 03:02:47] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 33/59 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 1/60 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 46 constraints, problems are : Problem set: 0 solved, 44 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 26/26 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 33/59 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 44/89 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 1/60 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 90 constraints, problems are : Problem set: 0 solved, 44 unsolved in 882 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 26/26 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1632ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1632ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/130 places, 46/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1737 ms. Remains : 26/130 places, 46/205 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLCardinality-06 finished in 1787 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||G(p1)))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 205/205 transitions.
Graph (trivial) has 99 edges and 130 vertex of which 6 / 130 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 126 transition count 181
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 106 transition count 181
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 41 place count 106 transition count 167
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 69 place count 92 transition count 167
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 84 place count 77 transition count 141
Iterating global reduction 2 with 15 rules applied. Total rules applied 99 place count 77 transition count 141
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 99 place count 77 transition count 139
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 75 transition count 139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 73 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 73 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 73 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 72 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 72 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 71 transition count 114
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 71 transition count 114
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 164 place count 45 transition count 88
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 169 place count 40 transition count 62
Ensure Unique test removed 2 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 176 place count 38 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 178 place count 38 transition count 60
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 181 place count 35 transition count 53
Iterating global reduction 4 with 3 rules applied. Total rules applied 184 place count 35 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 34 transition count 52
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 194 place count 30 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 200 place count 30 transition count 62
Applied a total of 200 rules in 32 ms. Remains 30 /130 variables (removed 100) and now considering 62/205 (removed 143) transitions.
[2025-06-08 03:02:49] [INFO ] Flow matrix only has 50 transitions (discarded 12 similar events)
// Phase 1: matrix 50 rows 30 cols
[2025-06-08 03:02:49] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:02:49] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-08 03:02:49] [INFO ] Flow matrix only has 50 transitions (discarded 12 similar events)
[2025-06-08 03:02:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:02:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-08 03:02:49] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:02:49] [INFO ] Redundant transitions in 14 ms returned []
Running 58 sub problems to find dead transitions.
[2025-06-08 03:02:49] [INFO ] Flow matrix only has 50 transitions (discarded 12 similar events)
[2025-06-08 03:02:49] [INFO ] Invariant cache hit.
[2025-06-08 03:02:49] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 49/79 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 1/80 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 60 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 30/30 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 49/79 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 58/117 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:51] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 1/80 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/80 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 119 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1784 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 30/30 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3001ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3001ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/130 places, 62/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3141 ms. Remains : 30/130 places, 62/205 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLCardinality-08
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLCardinality-08 finished in 3220 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(p0))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 205/205 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 109 transition count 173
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 109 transition count 173
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 96 transition count 157
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 96 transition count 157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 92 transition count 142
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 77 place count 91 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 80 place count 88 transition count 128
Iterating global reduction 0 with 3 rules applied. Total rules applied 83 place count 88 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 84 place count 87 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 85 place count 87 transition count 126
Applied a total of 85 rules in 6 ms. Remains 87 /130 variables (removed 43) and now considering 126/205 (removed 79) transitions.
// Phase 1: matrix 126 rows 87 cols
[2025-06-08 03:02:52] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:02:52] [INFO ] Implicit Places using invariants in 49 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/130 places, 126/205 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 86/130 places, 126/205 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0404-LTLCardinality-09 finished in 450 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(F(p0))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 205/205 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 110 transition count 174
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 110 transition count 174
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 97 transition count 158
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 97 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 92 transition count 142
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 90 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 86 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 86 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 84 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 84 transition count 122
Applied a total of 90 rules in 2 ms. Remains 84 /130 variables (removed 46) and now considering 122/205 (removed 83) transitions.
// Phase 1: matrix 122 rows 84 cols
[2025-06-08 03:02:53] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:02:53] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-06-08 03:02:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:02:53] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-08 03:02:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:54] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:54] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/206 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 96 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3520 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:57] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/206 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 121/218 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:58] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:58] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:58] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:58] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:58] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:58] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:58] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:58] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:59] [INFO ] Deduced a trap along path composed of 6 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:59] [INFO ] Deduced a trap along path composed of 11 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:59] [INFO ] Deduced a trap along path composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:01] [INFO ] Deduced a trap along path composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 230 constraints, problems are : Problem set: 0 solved, 121 unsolved in 10808 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 14349ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 14349ms
Starting structural reductions in LTL mode, iteration 1 : 84/130 places, 122/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14662 ms. Remains : 84/130 places, 122/205 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0404-LTLCardinality-10 finished in 15109 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)))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 205/205 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 110 transition count 174
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 110 transition count 174
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 98 transition count 159
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 98 transition count 159
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 93 transition count 143
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 91 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 88 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 88 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 87 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 87 transition count 127
Applied a total of 84 rules in 3 ms. Remains 87 /130 variables (removed 43) and now considering 127/205 (removed 78) transitions.
// Phase 1: matrix 127 rows 87 cols
[2025-06-08 03:03:08] [INFO ] Computed 10 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:03:08] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-08 03:03:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:03:08] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2025-06-08 03:03: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/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:09] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:09] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/214 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/214 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 99 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3685 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:12] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/214 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 126/226 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:13] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:13] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:13] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:13] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:14] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:15] [INFO ] Deduced a trap along path composed of 11 places in 59 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:15] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 0/214 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 233 constraints, problems are : Problem set: 0 solved, 126 unsolved in 9879 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 13578ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 13578ms
Starting structural reductions in LTL mode, iteration 1 : 87/130 places, 127/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13725 ms. Remains : 87/130 places, 127/205 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLCardinality-11 finished in 13845 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 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 205/205 transitions.
Graph (trivial) has 106 edges and 130 vertex of which 6 / 130 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 126 transition count 177
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 102 transition count 177
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 49 place count 102 transition count 165
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 73 place count 90 transition count 165
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 86 place count 77 transition count 152
Iterating global reduction 2 with 13 rules applied. Total rules applied 99 place count 77 transition count 152
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 99 place count 77 transition count 148
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 73 transition count 148
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 71 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 71 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 71 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 70 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 70 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 69 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 69 transition count 119
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 170 place count 42 transition count 92
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 174 place count 38 transition count 63
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 179 place count 37 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 37 transition count 61
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 183 place count 35 transition count 53
Iterating global reduction 4 with 2 rules applied. Total rules applied 185 place count 35 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 191 place count 32 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 196 place count 32 transition count 55
Applied a total of 196 rules in 37 ms. Remains 32 /130 variables (removed 98) and now considering 55/205 (removed 150) transitions.
[2025-06-08 03:03:22] [INFO ] Flow matrix only has 43 transitions (discarded 12 similar events)
// Phase 1: matrix 43 rows 32 cols
[2025-06-08 03:03:22] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:03:22] [INFO ] Implicit Places using invariants in 44 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/130 places, 55/205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 29 transition count 53
Applied a total of 4 rules in 2 ms. Remains 29 /31 variables (removed 2) and now considering 53/55 (removed 2) transitions.
[2025-06-08 03:03:22] [INFO ] Flow matrix only has 41 transitions (discarded 12 similar events)
// Phase 1: matrix 41 rows 29 cols
[2025-06-08 03:03:22] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:03:22] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-08 03:03:22] [INFO ] Flow matrix only has 41 transitions (discarded 12 similar events)
[2025-06-08 03:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:03:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-08 03:03:22] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/130 places, 53/205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 153 ms. Remains : 29/130 places, 53/205 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLCardinality-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLCardinality-12 finished in 193 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 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 205/205 transitions.
Graph (trivial) has 104 edges and 130 vertex of which 6 / 130 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 126 transition count 178
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 103 transition count 178
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 47 place count 103 transition count 167
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 69 place count 92 transition count 167
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 81 place count 80 transition count 144
Iterating global reduction 2 with 12 rules applied. Total rules applied 93 place count 80 transition count 144
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 93 place count 80 transition count 140
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 101 place count 76 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 75 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 75 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 75 transition count 129
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 164 place count 45 transition count 99
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 167 place count 42 transition count 83
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 41 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 172 place count 41 transition count 82
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 39 transition count 64
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 39 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 37 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 186 place count 37 transition count 69
Applied a total of 186 rules in 17 ms. Remains 37 /130 variables (removed 93) and now considering 69/205 (removed 136) transitions.
[2025-06-08 03:03:22] [INFO ] Flow matrix only has 52 transitions (discarded 17 similar events)
// Phase 1: matrix 52 rows 37 cols
[2025-06-08 03:03:22] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:03:22] [INFO ] Implicit Places using invariants in 31 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/130 places, 69/205 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 68
Applied a total of 2 rules in 2 ms. Remains 35 /36 variables (removed 1) and now considering 68/69 (removed 1) transitions.
[2025-06-08 03:03:22] [INFO ] Flow matrix only has 51 transitions (discarded 17 similar events)
// Phase 1: matrix 51 rows 35 cols
[2025-06-08 03:03:22] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:03:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-08 03:03:22] [INFO ] Flow matrix only has 51 transitions (discarded 17 similar events)
[2025-06-08 03:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:03:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-08 03:03:22] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/130 places, 68/205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 35/130 places, 68/205 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLCardinality-13 finished in 204 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(F((X(X(p0))&&(G(p2)||p1))))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 205/205 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 110 transition count 174
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 110 transition count 174
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 97 transition count 158
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 97 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 93 transition count 150
Ensure Unique test removed 2 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 91 transition count 150
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 88 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 88 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 86 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 86 transition count 126
Applied a total of 86 rules in 10 ms. Remains 86 /130 variables (removed 44) and now considering 126/205 (removed 79) transitions.
// Phase 1: matrix 126 rows 86 cols
[2025-06-08 03:03:22] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:03:22] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-08 03:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:03:22] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2025-06-08 03:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:23] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:23] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/212 variables, 86/98 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 98 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3647 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:26] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/212 variables, 86/99 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 125/224 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:27] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:27] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:27] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:27] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:28] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:29] [INFO ] Deduced a trap along path composed of 6 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:29] [INFO ] Deduced a trap along path composed of 11 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:30] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:32] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:32] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:36] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/212 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 14 (OVERLAPS) 0/212 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 235 constraints, problems are : Problem set: 0 solved, 125 unsolved in 17059 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 20732ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 20733ms
Starting structural reductions in LTL mode, iteration 1 : 86/130 places, 126/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20857 ms. Remains : 86/130 places, 126/205 transitions.
Stuttering acceptance computed with spot in 536 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLCardinality-15
Product exploration explored 100000 steps with 4842 reset in 124 ms.
Stack based approach found an accepted trace after 267 steps with 13 reset with depth 37 and stack size 37 in 1 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLCardinality-15 finished in 21548 ms.
All properties solved by simple procedures.
Total runtime 126110 ms.

BK_STOP 1749351824160

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="ErlangenMainframeV0-PT-0404"
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 ErlangenMainframeV0-PT-0404, 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 r254-tall-174931339600267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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