Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 83M
-rw-r--r-- 1 mcc users 7.6K Jun 6 09:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 6 09:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 09:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 6 09:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 12:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 12:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 12:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 14K Jun 6 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Jun 6 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 6 09:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 6 09:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 12:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 12:05 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 83M 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-1204-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV0-PT-1204-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749378247420

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-1204
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 10:24:08] [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 10:24:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 10:24:11] [INFO ] Load time of PNML (sax parser for PT used): 2827 ms
[2025-06-08 10:24:11] [INFO ] Transformed 295 places.
[2025-06-08 10:24:12] [INFO ] Transformed 62506 transitions.
[2025-06-08 10:24:12] [INFO ] Found NUPN structural information;
[2025-06-08 10:24:12] [INFO ] Parsed PT model containing 295 places and 62506 transitions and 1701161 arcs in 3404 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 62506/62506 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 231 transition count 62442
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 231 transition count 62442
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 152 place count 207 transition count 62418
Iterating global reduction 0 with 24 rules applied. Total rules applied 176 place count 207 transition count 62418
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 186 place count 197 transition count 41777
Ensure Unique test removed 6 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 202 place count 191 transition count 41777
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 208 place count 185 transition count 1841
Iterating global reduction 0 with 6 rules applied. Total rules applied 214 place count 185 transition count 1841
Applied a total of 214 rules in 8830 ms. Remains 185 /295 variables (removed 110) and now considering 1841/62506 (removed 60665) transitions.
// Phase 1: matrix 1841 rows 185 cols
[2025-06-08 10:24:21] [INFO ] Computed 24 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:24:23] [INFO ] Implicit Places using invariants in 1386 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1426 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/295 places, 1841/62506 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10284 ms. Remains : 184/295 places, 1841/62506 transitions.
Support contains 37 out of 184 places after structural reductions.
[2025-06-08 10:24:23] [INFO ] Flatten gal took : 434 ms
[2025-06-08 10:24:24] [INFO ] Flatten gal took : 247 ms
[2025-06-08 10:24:24] [INFO ] Input system was already deterministic with 1841 transitions.
Support contains 36 out of 184 places (down from 37) after GAL structural reductions.
RANDOM walk for 30150 steps (6 resets) in 2247 ms. (13 steps per ms) remains 0/19 properties
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 33 stabilizing places and 33 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' '!((X((F(!p0)||(X(X(!p1)) U ((p2&&X(X(!p1)))||X(X(G(!p1))))))) U G(!p2)))'
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1841/1841 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 164 transition count 410
Ensure Unique test removed 1 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 41 place count 163 transition count 410
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 52 place count 152 transition count 238
Ensure Unique test removed 3 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 66 place count 149 transition count 238
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 145 transition count 194
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 145 transition count 194
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 143 transition count 190
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 143 transition count 190
Applied a total of 78 rules in 21 ms. Remains 143 /184 variables (removed 41) and now considering 190/1841 (removed 1651) transitions.
// Phase 1: matrix 190 rows 143 cols
[2025-06-08 10:24:25] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:24:25] [INFO ] Implicit Places using invariants in 73 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/184 places, 190/1841 transitions.
Applied a total of 0 rules in 1 ms. Remains 142 /142 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 142/184 places, 190/1841 transitions.
Stuttering acceptance computed with spot in 497 ms :[p2, (AND p0 p1 p2), (AND p0 p1), (AND p0 p1 p2), (AND p0 p1), (AND p0 p1), (AND p0 p2 p1), p0, (AND p0 p2 (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1204-LTLCardinality-01
Product exploration explored 100000 steps with 198 reset in 274 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 67 in 0 ms.
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1204-LTLCardinality-01 finished in 957 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 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 1841/1841 transitions.
Graph (trivial) has 138 edges and 184 vertex of which 6 / 184 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 181 transition count 1823
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 166 transition count 1822
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 165 transition count 1822
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 33 place count 165 transition count 1802
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 73 place count 145 transition count 1802
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 96 place count 122 transition count 359
Ensure Unique test removed 1 places
Iterating global reduction 3 with 24 rules applied. Total rules applied 120 place count 121 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 121 transition count 358
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 121 place count 121 transition count 352
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 133 place count 115 transition count 352
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 141 place count 107 transition count 177
Ensure Unique test removed 3 places
Iterating global reduction 4 with 11 rules applied. Total rules applied 152 place count 104 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 153 place count 104 transition count 176
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 157 place count 100 transition count 132
Iterating global reduction 5 with 4 rules applied. Total rules applied 161 place count 100 transition count 132
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 163 place count 98 transition count 128
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 98 transition count 128
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 247 place count 57 transition count 87
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 249 place count 55 transition count 80
Ensure Unique test removed 1 places
Iterating global reduction 5 with 3 rules applied. Total rules applied 252 place count 54 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 253 place count 54 transition count 79
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 53 transition count 78
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 53 transition count 78
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 6 with 2 rules applied. Total rules applied 257 place count 52 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 265 place count 48 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 281 place count 48 transition count 68
Applied a total of 281 rules in 219 ms. Remains 48 /184 variables (removed 136) and now considering 68/1841 (removed 1773) transitions.
[2025-06-08 10:24:26] [INFO ] Flow matrix only has 49 transitions (discarded 19 similar events)
// Phase 1: matrix 49 rows 48 cols
[2025-06-08 10:24:26] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:24:26] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-08 10:24:26] [INFO ] Flow matrix only has 49 transitions (discarded 19 similar events)
[2025-06-08 10:24:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:24:26] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-08 10:24:26] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 10:24:26] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2025-06-08 10:24:27] [INFO ] Flow matrix only has 49 transitions (discarded 19 similar events)
[2025-06-08 10:24:27] [INFO ] Invariant cache hit.
[2025-06-08 10:24:27] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 48/96 variables, 48/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/97 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/97 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 48/48 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 48/96 variables, 48/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 66/142 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/97 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 143 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2008 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 48/48 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3722ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3730ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/184 places, 68/1841 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4080 ms. Remains : 48/184 places, 68/1841 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1204-LTLCardinality-02
Stuttering criterion allowed to conclude after 263 steps with 0 reset in 4 ms.
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1204-LTLCardinality-02 finished in 4199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 1841/1841 transitions.
Graph (trivial) has 139 edges and 184 vertex of which 6 / 184 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 180 transition count 1821
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 164 transition count 1821
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 33 place count 164 transition count 1802
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 71 place count 145 transition count 1802
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 94 place count 122 transition count 359
Ensure Unique test removed 1 places
Iterating global reduction 2 with 24 rules applied. Total rules applied 118 place count 121 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 121 transition count 358
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 119 place count 121 transition count 353
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 129 place count 116 transition count 353
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 134 place count 111 transition count 230
Ensure Unique test removed 2 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 141 place count 109 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 109 transition count 229
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 144 place count 107 transition count 157
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 107 transition count 157
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 106 transition count 155
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 106 transition count 155
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 242 place count 59 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 244 place count 57 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 246 place count 57 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 247 place count 57 transition count 89
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 248 place count 56 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 56 transition count 85
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 5 with 6 rules applied. Total rules applied 255 place count 53 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 267 place count 53 transition count 80
Applied a total of 267 rules in 131 ms. Remains 53 /184 variables (removed 131) and now considering 80/1841 (removed 1761) transitions.
[2025-06-08 10:24:30] [INFO ] Flow matrix only has 61 transitions (discarded 19 similar events)
// Phase 1: matrix 61 rows 53 cols
[2025-06-08 10:24:30] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:24:31] [INFO ] Implicit Places using invariants in 47 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/184 places, 80/1841 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 184 ms. Remains : 52/184 places, 80/1841 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1204-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 219 ms.
Product exploration explored 100000 steps with 0 reset in 211 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 186 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 276 ms. (144 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 1/1 properties
[2025-06-08 10:24:31] [INFO ] Flow matrix only has 61 transitions (discarded 19 similar events)
// Phase 1: matrix 61 rows 52 cols
[2025-06-08 10:24:31] [INFO ] Computed 19 invariants in 1 ms
[2025-06-08 10:24:31] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/26 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/52 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/112 variables, 52/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/113 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 52/52 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 12/113 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 2/7 constraints, Generalized P Invariants (flows): 0/12 constraints, State Equation: 0/52 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1204-LTLCardinality-03 finished in 1227 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||X(X(X(X(F(p1)))))))))'
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1841/1841 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 162 transition count 599
Ensure Unique test removed 1 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 45 place count 161 transition count 599
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 57 place count 149 transition count 283
Ensure Unique test removed 2 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 71 place count 147 transition count 283
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 76 place count 142 transition count 200
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 141 transition count 200
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 138 transition count 188
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 138 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 137 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 137 transition count 186
Applied a total of 90 rules in 28 ms. Remains 137 /184 variables (removed 47) and now considering 186/1841 (removed 1655) transitions.
// Phase 1: matrix 186 rows 137 cols
[2025-06-08 10:24:32] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:24:32] [INFO ] Implicit Places using invariants in 73 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/184 places, 186/1841 transitions.
Applied a total of 0 rules in 1 ms. Remains 136 /136 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 136/184 places, 186/1841 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1204-LTLCardinality-04
Product exploration explored 100000 steps with 14270 reset in 75 ms.
Stack based approach found an accepted trace after 32556 steps with 4639 reset with depth 87 and stack size 87 in 62 ms.
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1204-LTLCardinality-04 finished in 504 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(F(G((X(F(p0)) U p1)))))'
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 1841/1841 transitions.
Graph (trivial) has 140 edges and 184 vertex of which 4 / 184 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 181 transition count 1821
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 164 transition count 1821
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 35 place count 164 transition count 1802
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 73 place count 145 transition count 1802
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 95 place count 123 transition count 360
Ensure Unique test removed 1 places
Iterating global reduction 2 with 23 rules applied. Total rules applied 118 place count 122 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 122 transition count 359
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 119 place count 122 transition count 354
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 129 place count 117 transition count 354
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 137 place count 109 transition count 179
Ensure Unique test removed 3 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 148 place count 106 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 106 transition count 178
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 153 place count 102 transition count 134
Iterating global reduction 4 with 4 rules applied. Total rules applied 157 place count 102 transition count 134
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 159 place count 100 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 100 transition count 130
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 251 place count 55 transition count 85
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 253 place count 53 transition count 78
Ensure Unique test removed 1 places
Iterating global reduction 4 with 3 rules applied. Total rules applied 256 place count 52 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 257 place count 52 transition count 77
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 258 place count 51 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 259 place count 51 transition count 76
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 5 with 2 rules applied. Total rules applied 261 place count 50 transition count 75
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 271 place count 45 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 287 place count 45 transition count 70
Applied a total of 287 rules in 108 ms. Remains 45 /184 variables (removed 139) and now considering 70/1841 (removed 1771) transitions.
[2025-06-08 10:24:32] [INFO ] Flow matrix only has 55 transitions (discarded 15 similar events)
// Phase 1: matrix 55 rows 45 cols
[2025-06-08 10:24:32] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:24:32] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-08 10:24:32] [INFO ] Flow matrix only has 55 transitions (discarded 15 similar events)
[2025-06-08 10:24:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:24:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-08 10:24:32] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 10:24:32] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2025-06-08 10:24:32] [INFO ] Flow matrix only has 55 transitions (discarded 15 similar events)
[2025-06-08 10:24:32] [INFO ] Invariant cache hit.
[2025-06-08 10:24:32] [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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 54/99 variables, 45/63 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 15/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/100 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 79 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1376 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 45/45 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 54/99 variables, 45/63 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 15/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 66/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:24:34] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/100 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/100 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 146 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2367 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 45/45 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3761ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3761ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/184 places, 70/1841 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3976 ms. Remains : 45/184 places, 70/1841 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1204-LTLCardinality-06
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1204-LTLCardinality-06 finished in 4126 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))&&F(p1))))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1841/1841 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 161 transition count 430
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 161 transition count 430
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 149 transition count 282
Ensure Unique test removed 3 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 73 place count 146 transition count 282
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 79 place count 140 transition count 191
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 86 place count 139 transition count 191
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 136 transition count 183
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 136 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 135 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 135 transition count 181
Applied a total of 94 rules in 26 ms. Remains 135 /184 variables (removed 49) and now considering 181/1841 (removed 1660) transitions.
// Phase 1: matrix 181 rows 135 cols
[2025-06-08 10:24:36] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:24:36] [INFO ] Implicit Places using invariants in 70 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/184 places, 181/1841 transitions.
Applied a total of 0 rules in 1 ms. Remains 134 /134 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 134/184 places, 181/1841 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1204-LTLCardinality-09
Product exploration explored 100000 steps with 582 reset in 139 ms.
Stack based approach found an accepted trace after 103 steps with 0 reset with depth 104 and stack size 104 in 1 ms.
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1204-LTLCardinality-09 finished in 437 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(X(F(p1)))||p0)))'
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1841/1841 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 161 transition count 598
Ensure Unique test removed 1 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 47 place count 160 transition count 598
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 60 place count 147 transition count 280
Ensure Unique test removed 3 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 76 place count 144 transition count 280
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 138 transition count 190
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 89 place count 137 transition count 190
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 92 place count 134 transition count 182
Iterating global reduction 0 with 3 rules applied. Total rules applied 95 place count 134 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 96 place count 133 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 97 place count 133 transition count 180
Applied a total of 97 rules in 23 ms. Remains 133 /184 variables (removed 51) and now considering 180/1841 (removed 1661) transitions.
// Phase 1: matrix 180 rows 133 cols
[2025-06-08 10:24:37] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:24:37] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-08 10:24:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:24:37] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2025-06-08 10:24:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:24:38] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:24:38] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/313 variables, 133/153 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 0/313 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 153 constraints, problems are : Problem set: 0 solved, 179 unsolved in 7542 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:24:45] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/313 variables, 133/154 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 179/333 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:24:48] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:24:50] [INFO ] Deduced a trap along path composed of 6 places in 77 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:24:50] [INFO ] Deduced a trap along path composed of 13 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:24:50] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:24:53] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/313 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 338 constraints, problems are : Problem set: 0 solved, 179 unsolved in 22662 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 30244ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 30246ms
Starting structural reductions in LTL mode, iteration 1 : 133/184 places, 180/1841 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30453 ms. Remains : 133/184 places, 180/1841 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1204-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1204-LTLCardinality-10 finished in 30867 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(X(X(X(G(((p1||G(p2))&&p0))))))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1841/1841 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 162 transition count 599
Ensure Unique test removed 1 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 45 place count 161 transition count 599
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 55 place count 151 transition count 285
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 148 transition count 285
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 143 transition count 203
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 79 place count 142 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 81 place count 140 transition count 193
Iterating global reduction 0 with 2 rules applied. Total rules applied 83 place count 140 transition count 193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 84 place count 139 transition count 191
Iterating global reduction 0 with 1 rules applied. Total rules applied 85 place count 139 transition count 191
Applied a total of 85 rules in 25 ms. Remains 139 /184 variables (removed 45) and now considering 191/1841 (removed 1650) transitions.
// Phase 1: matrix 191 rows 139 cols
[2025-06-08 10:25:08] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:25:08] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-06-08 10:25:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:25:08] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2025-06-08 10:25: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/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:09] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:09] [INFO ] Deduced a trap composed of 32 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 10:25:09] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/330 variables, 139/160 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:11] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:12] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 162 constraints, problems are : Problem set: 0 solved, 190 unsolved in 9511 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/330 variables, 139/162 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 190/352 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:20] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:20] [INFO ] Deduced a trap composed of 13 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 10:25:20] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:20] [INFO ] Deduced a trap composed of 15 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 10:25:20] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:20] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:20] [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 10:25:20] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 8/360 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:22] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:22] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:25] [INFO ] Deduced a trap along path composed of 6 places in 60 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:26] [INFO ] Deduced a trap along path composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:25:32] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 365 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 39569ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 39570ms
Starting structural reductions in LTL mode, iteration 1 : 139/184 places, 191/1841 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39938 ms. Remains : 139/184 places, 191/1841 transitions.
Stuttering acceptance computed with spot in 340 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ErlangenMainframeV0-PT-1204-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1204-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1204-LTLCardinality-14 finished in 40302 ms.
All properties solved by simple procedures.
Total runtime 99653 ms.

BK_STOP 1749378348350

--------------------
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-1204"
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-1204, 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-174931339800395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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