Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 6.1K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 09:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 6 09:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 12:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 12:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 14K Jun 6 09:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Jun 6 09:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Jun 6 09:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 12:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 12:01 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 38M 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-1104-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV0-PT-1104-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749366924274

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-1104
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 07:15:25] [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 07:15:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 07:15:27] [INFO ] Load time of PNML (sax parser for PT used): 1441 ms
[2025-06-08 07:15:27] [INFO ] Transformed 281 places.
[2025-06-08 07:15:27] [INFO ] Transformed 31390 transitions.
[2025-06-08 07:15:27] [INFO ] Found NUPN structural information;
[2025-06-08 07:15:27] [INFO ] Parsed PT model containing 281 places and 31390 transitions and 788748 arcs in 1850 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 31390/31390 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 219 transition count 31328
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 219 transition count 31328
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 157 place count 186 transition count 31295
Iterating global reduction 0 with 33 rules applied. Total rules applied 190 place count 186 transition count 31295
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 202 place count 174 transition count 20942
Ensure Unique test removed 7 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 221 place count 167 transition count 20942
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 231 place count 157 transition count 254
Iterating global reduction 0 with 10 rules applied. Total rules applied 241 place count 157 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 242 place count 156 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 243 place count 156 transition count 252
Applied a total of 243 rules in 4802 ms. Remains 156 /281 variables (removed 125) and now considering 252/31390 (removed 31138) transitions.
// Phase 1: matrix 252 rows 156 cols
[2025-06-08 07:15:32] [INFO ] Computed 21 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:15:32] [INFO ] Implicit Places using invariants in 306 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 336 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/281 places, 252/31390 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5154 ms. Remains : 155/281 places, 252/31390 transitions.
Support contains 16 out of 155 places after structural reductions.
[2025-06-08 07:15:33] [INFO ] Flatten gal took : 58 ms
[2025-06-08 07:15:33] [INFO ] Flatten gal took : 31 ms
[2025-06-08 07:15:33] [INFO ] Input system was already deterministic with 252 transitions.
RANDOM walk for 28284 steps (6 resets) in 1017 ms. (27 steps per ms) remains 0/11 properties
Computed a total of 25 stabilizing places and 25 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' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 252/252 transitions.
Graph (trivial) has 121 edges and 155 vertex of which 6 / 155 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 151 transition count 232
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 135 transition count 232
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 33 place count 135 transition count 216
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 65 place count 119 transition count 216
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 111 transition count 162
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 111 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 111 transition count 161
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 82 place count 111 transition count 158
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 108 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 107 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 107 transition count 150
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 188 place count 58 transition count 101
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 191 place count 55 transition count 88
Ensure Unique test removed 2 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 196 place count 53 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 197 place count 53 transition count 87
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 199 place count 51 transition count 81
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 51 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 205 place count 49 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 219 place count 49 transition count 78
Applied a total of 219 rules in 59 ms. Remains 49 /155 variables (removed 106) and now considering 78/252 (removed 174) transitions.
[2025-06-08 07:15:33] [INFO ] Flow matrix only has 56 transitions (discarded 22 similar events)
// Phase 1: matrix 56 rows 49 cols
[2025-06-08 07:15:33] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:15:33] [INFO ] Implicit Places using invariants in 63 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/155 places, 78/252 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 77
Applied a total of 2 rules in 6 ms. Remains 47 /48 variables (removed 1) and now considering 77/78 (removed 1) transitions.
[2025-06-08 07:15:33] [INFO ] Flow matrix only has 55 transitions (discarded 22 similar events)
// Phase 1: matrix 55 rows 47 cols
[2025-06-08 07:15:33] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:15:33] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-08 07:15:33] [INFO ] Flow matrix only has 55 transitions (discarded 22 similar events)
[2025-06-08 07:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:15:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-08 07:15:34] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/155 places, 77/252 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 247 ms. Remains : 47/155 places, 77/252 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLCardinality-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLCardinality-01 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((G((p2 U p3))||p1)))))'
Support contains 5 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 145 transition count 220
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 145 transition count 220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 141 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 141 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 140 transition count 197
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 139 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 138 transition count 189
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 138 transition count 189
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 34 place count 137 transition count 187
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 137 transition count 187
Applied a total of 35 rules in 19 ms. Remains 137 /155 variables (removed 18) and now considering 187/252 (removed 65) transitions.
// Phase 1: matrix 187 rows 137 cols
[2025-06-08 07:15:34] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:15:34] [INFO ] Implicit Places using invariants in 71 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/155 places, 187/252 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 136/155 places, 187/252 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/136 stabilizing places and 23/187 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)))), (X (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT p0)), (X p1), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 237 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1104-LTLCardinality-03 finished in 880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)||p0))))'
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 252/252 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 144 transition count 216
Ensure Unique test removed 1 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 23 place count 143 transition count 216
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 29 place count 137 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 35 place count 137 transition count 187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 36 place count 136 transition count 185
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 135 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 134 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 134 transition count 181
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 133 transition count 179
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 133 transition count 179
Applied a total of 42 rules in 11 ms. Remains 133 /155 variables (removed 22) and now considering 179/252 (removed 73) transitions.
// Phase 1: matrix 179 rows 133 cols
[2025-06-08 07:15:35] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:15:35] [INFO ] Implicit Places using invariants in 74 ms returned [73]
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 : 132/155 places, 179/252 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 132/155 places, 179/252 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 71 ms.
Product exploration explored 100000 steps with 33333 reset in 71 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/132 stabilizing places and 24/179 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1104-LTLCardinality-04 finished in 445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 252/252 transitions.
Graph (trivial) has 124 edges and 155 vertex of which 6 / 155 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 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 151 transition count 231
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 134 transition count 231
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 35 place count 134 transition count 215
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 67 place count 118 transition count 215
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 78 place count 107 transition count 155
Ensure Unique test removed 1 places
Iterating global reduction 2 with 12 rules applied. Total rules applied 90 place count 106 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 106 transition count 154
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 91 place count 106 transition count 151
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 103 transition count 151
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 101 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 101 transition count 139
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 3 with 94 rules applied. Total rules applied 195 place count 54 transition count 92
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 198 place count 51 transition count 82
Ensure Unique test removed 2 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 203 place count 49 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 204 place count 49 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 206 place count 47 transition count 78
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 47 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 4 with 2 rules applied. Total rules applied 210 place count 46 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 214 place count 44 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 229 place count 44 transition count 79
Applied a total of 229 rules in 43 ms. Remains 44 /155 variables (removed 111) and now considering 79/252 (removed 173) transitions.
[2025-06-08 07:15:35] [INFO ] Flow matrix only has 59 transitions (discarded 20 similar events)
// Phase 1: matrix 59 rows 44 cols
[2025-06-08 07:15:35] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:15:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-08 07:15:35] [INFO ] Flow matrix only has 59 transitions (discarded 20 similar events)
[2025-06-08 07:15:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:15:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-08 07:15:35] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 07:15:35] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2025-06-08 07:15:35] [INFO ] Flow matrix only has 59 transitions (discarded 20 similar events)
[2025-06-08 07:15:35] [INFO ] Invariant cache hit.
[2025-06-08 07:15:35] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 58/102 variables, 44/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 71 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1818 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 58/102 variables, 44/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 76/146 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:38] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:39] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/103 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/103 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 149 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3796 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 44/44 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5667ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 5673ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/155 places, 79/252 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5820 ms. Remains : 44/155 places, 79/252 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLCardinality-06 finished in 5881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(X(G(!p0))) U (p0&&X(X(G(!p0)))))))))'
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 252/252 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 142 transition count 214
Ensure Unique test removed 1 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 27 place count 141 transition count 214
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 34 place count 134 transition count 184
Iterating global reduction 0 with 7 rules applied. Total rules applied 41 place count 134 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 43 place count 132 transition count 181
Ensure Unique test removed 2 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 47 place count 130 transition count 181
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 49 place count 128 transition count 175
Iterating global reduction 0 with 2 rules applied. Total rules applied 51 place count 128 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 53 place count 126 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 126 transition count 171
Applied a total of 55 rules in 17 ms. Remains 126 /155 variables (removed 29) and now considering 171/252 (removed 81) transitions.
// Phase 1: matrix 171 rows 126 cols
[2025-06-08 07:15:41] [INFO ] Computed 17 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:15:41] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-08 07:15:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:15:41] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-06-08 07:15:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:42] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:42] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:43] [INFO ] Deduced a trap composed of 16 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 07:15:43] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/297 variables, 126/147 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 147 constraints, problems are : Problem set: 0 solved, 170 unsolved in 6909 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:49] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/297 variables, 126/148 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 170/318 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:50] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:50] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:50] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:51] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 17/335 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:54] [INFO ] Deduced a trap along path composed of 6 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:54] [INFO ] Deduced a trap along path composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:15:57] [INFO ] Deduced a trap along path composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 0/297 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 338 constraints, problems are : Problem set: 0 solved, 170 unsolved in 22112 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 29051ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 29052ms
Starting structural reductions in LTL mode, iteration 1 : 126/155 places, 171/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29239 ms. Remains : 126/155 places, 171/252 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), true, p0, p0, true]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLCardinality-09 finished in 29466 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(p0))))'
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 252/252 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 142 transition count 229
Ensure Unique test removed 1 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 27 place count 141 transition count 229
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 34 place count 134 transition count 187
Iterating global reduction 0 with 7 rules applied. Total rules applied 41 place count 134 transition count 187
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 43 place count 132 transition count 184
Ensure Unique test removed 2 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 47 place count 130 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 49 place count 128 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 51 place count 128 transition count 176
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 53 place count 126 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 126 transition count 172
Applied a total of 55 rules in 10 ms. Remains 126 /155 variables (removed 29) and now considering 172/252 (removed 80) transitions.
// Phase 1: matrix 172 rows 126 cols
[2025-06-08 07:16:10] [INFO ] Computed 17 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:16:11] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-08 07:16:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:16:11] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2025-06-08 07:16:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:16:12] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:16:12] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 172/298 variables, 126/145 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 145 constraints, problems are : Problem set: 0 solved, 171 unsolved in 6665 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:16:18] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/298 variables, 126/146 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 171/317 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:16:20] [INFO ] Deduced a trap composed of 12 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 07:16:20] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:16:22] [INFO ] Deduced a trap along path composed of 11 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:16:23] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 321 constraints, problems are : Problem set: 0 solved, 171 unsolved in 17636 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 24336ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 24338ms
Starting structural reductions in LTL mode, iteration 1 : 126/155 places, 172/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24518 ms. Remains : 126/155 places, 172/252 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ErlangenMainframeV0-PT-1104-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1104-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1104-LTLCardinality-15 finished in 24690 ms.
All properties solved by simple procedures.
Total runtime 70151 ms.

BK_STOP 1749366995670

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

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