Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r504-tall-171649612600371.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is LeafsetExtension-PT-S32C3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612600371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 12 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717228612215

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:56:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:56:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:56:53] [INFO ] Load time of PNML (sax parser for PT used): 284 ms
[2024-06-01 07:56:53] [INFO ] Transformed 5622 places.
[2024-06-01 07:56:53] [INFO ] Transformed 5449 transitions.
[2024-06-01 07:56:53] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 5622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Reduce places removed 1085 places and 0 transitions.
Iterating post reduction 0 with 1085 rules applied. Total rules applied 1085 place count 4537 transition count 5449
Discarding 1038 places :
Symmetric choice reduction at 1 with 1038 rule applications. Total rules 2123 place count 3499 transition count 4411
Iterating global reduction 1 with 1038 rules applied. Total rules applied 3161 place count 3499 transition count 4411
Discarding 965 places :
Symmetric choice reduction at 1 with 965 rule applications. Total rules 4126 place count 2534 transition count 3446
Iterating global reduction 1 with 965 rules applied. Total rules applied 5091 place count 2534 transition count 3446
Discarding 955 places :
Symmetric choice reduction at 1 with 955 rule applications. Total rules 6046 place count 1579 transition count 2491
Iterating global reduction 1 with 955 rules applied. Total rules applied 7001 place count 1579 transition count 2491
Discarding 41 places :
Implicit places reduction removed 41 places
Iterating post reduction 1 with 41 rules applied. Total rules applied 7042 place count 1538 transition count 2491
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 7081 place count 1499 transition count 2452
Iterating global reduction 2 with 39 rules applied. Total rules applied 7120 place count 1499 transition count 2452
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 7158 place count 1461 transition count 2414
Iterating global reduction 2 with 38 rules applied. Total rules applied 7196 place count 1461 transition count 2414
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 7234 place count 1423 transition count 2376
Iterating global reduction 2 with 38 rules applied. Total rules applied 7272 place count 1423 transition count 2376
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 7310 place count 1385 transition count 2338
Iterating global reduction 2 with 38 rules applied. Total rules applied 7348 place count 1385 transition count 2338
Discarding 571 places :
Symmetric choice reduction at 2 with 571 rule applications. Total rules 7919 place count 814 transition count 1767
Iterating global reduction 2 with 571 rules applied. Total rules applied 8490 place count 814 transition count 1767
Applied a total of 8490 rules in 1527 ms. Remains 814 /5622 variables (removed 4808) and now considering 1767/5449 (removed 3682) transitions.
[2024-06-01 07:56:55] [INFO ] Flow matrix only has 1198 transitions (discarded 569 similar events)
// Phase 1: matrix 1198 rows 814 cols
[2024-06-01 07:56:55] [INFO ] Computed 61 invariants in 43 ms
[2024-06-01 07:56:56] [INFO ] Implicit Places using invariants in 864 ms returned [43, 48, 68, 93, 116, 120, 142, 193, 200, 228, 253, 275, 281, 308, 313, 344, 350, 354, 381, 385, 387, 430, 461, 489, 519, 545, 572, 577, 581, 602, 606, 633, 661, 665, 693, 698, 747, 753, 780]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 1019 ms to find 39 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 775/5622 places, 1767/5449 transitions.
Discarding 419 places :
Symmetric choice reduction at 0 with 419 rule applications. Total rules 419 place count 356 transition count 1348
Iterating global reduction 0 with 419 rules applied. Total rules applied 838 place count 356 transition count 1348
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 843 place count 351 transition count 1343
Iterating global reduction 0 with 5 rules applied. Total rules applied 848 place count 351 transition count 1343
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 853 place count 346 transition count 1338
Iterating global reduction 0 with 5 rules applied. Total rules applied 858 place count 346 transition count 1338
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 863 place count 341 transition count 1333
Iterating global reduction 0 with 5 rules applied. Total rules applied 868 place count 341 transition count 1333
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 873 place count 336 transition count 1328
Iterating global reduction 0 with 5 rules applied. Total rules applied 878 place count 336 transition count 1328
Applied a total of 878 rules in 58 ms. Remains 336 /775 variables (removed 439) and now considering 1328/1767 (removed 439) transitions.
[2024-06-01 07:56:56] [INFO ] Flow matrix only has 657 transitions (discarded 671 similar events)
// Phase 1: matrix 657 rows 336 cols
[2024-06-01 07:56:56] [INFO ] Computed 22 invariants in 8 ms
[2024-06-01 07:56:56] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 07:56:56] [INFO ] Flow matrix only has 657 transitions (discarded 671 similar events)
[2024-06-01 07:56:56] [INFO ] Invariant cache hit.
[2024-06-01 07:56:57] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 336/5622 places, 1328/5449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3412 ms. Remains : 336/5622 places, 1328/5449 transitions.
Support contains 47 out of 336 places after structural reductions.
[2024-06-01 07:56:57] [INFO ] Flatten gal took : 103 ms
[2024-06-01 07:56:57] [INFO ] Flatten gal took : 66 ms
[2024-06-01 07:56:57] [INFO ] Input system was already deterministic with 1328 transitions.
Support contains 45 out of 336 places (down from 47) after GAL structural reductions.
RANDOM walk for 40000 steps (1491 resets) in 1945 ms. (20 steps per ms) remains 6/27 properties
BEST_FIRST walk for 40004 steps (143 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (143 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (142 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (144 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (143 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (144 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
[2024-06-01 07:56:58] [INFO ] Flow matrix only has 657 transitions (discarded 671 similar events)
[2024-06-01 07:56:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 276/282 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 45/327 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 983/993 variables, and 349 constraints, problems are : Problem set: 6 solved, 0 unsolved in 447 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 327/336 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 478ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 336 stabilizing places and 1328 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 336 transition count 1328
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U p2)))))'
Support contains 4 out of 336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 336/336 places, 1328/1328 transitions.
Graph (complete) has 2056 edges and 336 vertex of which 328 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 328 transition count 1258
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 259 transition count 1258
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 139 place count 259 transition count 1230
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 195 place count 231 transition count 1230
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 219 place count 207 transition count 1206
Iterating global reduction 2 with 24 rules applied. Total rules applied 243 place count 207 transition count 1206
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 251 place count 199 transition count 1198
Iterating global reduction 2 with 8 rules applied. Total rules applied 259 place count 199 transition count 1198
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 262 place count 196 transition count 1198
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 262 place count 196 transition count 1195
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 268 place count 193 transition count 1195
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 271 place count 190 transition count 1192
Iterating global reduction 3 with 3 rules applied. Total rules applied 274 place count 190 transition count 1192
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 277 place count 187 transition count 1189
Iterating global reduction 3 with 3 rules applied. Total rules applied 280 place count 187 transition count 1189
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 356 place count 149 transition count 1151
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 372 place count 133 transition count 1135
Iterating global reduction 3 with 16 rules applied. Total rules applied 388 place count 133 transition count 1135
Applied a total of 388 rules in 147 ms. Remains 133 /336 variables (removed 203) and now considering 1135/1328 (removed 193) transitions.
[2024-06-01 07:56:59] [INFO ] Flow matrix only has 385 transitions (discarded 750 similar events)
// Phase 1: matrix 385 rows 133 cols
[2024-06-01 07:56:59] [INFO ] Computed 19 invariants in 6 ms
[2024-06-01 07:56:59] [INFO ] Implicit Places using invariants in 140 ms returned [8, 14, 15, 24, 30, 47, 53, 57, 61, 65, 83, 87, 93, 102, 109]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 144 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/336 places, 1135/1328 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 105 transition count 1122
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 105 transition count 1122
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 92 transition count 1109
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 92 transition count 1109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 90 transition count 1107
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 88 transition count 1105
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 88 transition count 1105
Applied a total of 60 rules in 41 ms. Remains 88 /118 variables (removed 30) and now considering 1105/1135 (removed 30) transitions.
[2024-06-01 07:56:59] [INFO ] Flow matrix only has 117 transitions (discarded 988 similar events)
// Phase 1: matrix 117 rows 88 cols
[2024-06-01 07:56:59] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 07:57:00] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 07:57:00] [INFO ] Flow matrix only has 117 transitions (discarded 988 similar events)
[2024-06-01 07:57:00] [INFO ] Invariant cache hit.
[2024-06-01 07:57:00] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/336 places, 1105/1328 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 608 ms. Remains : 88/336 places, 1105/1328 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLCardinality-01
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLCardinality-01 finished in 1036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p0)))))'
Support contains 2 out of 336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 1328/1328 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 329 transition count 1328
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 49 place count 287 transition count 1286
Iterating global reduction 1 with 42 rules applied. Total rules applied 91 place count 287 transition count 1286
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 126 place count 252 transition count 1251
Iterating global reduction 1 with 35 rules applied. Total rules applied 161 place count 252 transition count 1251
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 165 place count 248 transition count 1251
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 194 place count 219 transition count 1222
Iterating global reduction 2 with 29 rules applied. Total rules applied 223 place count 219 transition count 1222
Discarding 15 places :
Implicit places reduction removed 15 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 238 place count 204 transition count 1222
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 274 place count 168 transition count 1186
Iterating global reduction 3 with 36 rules applied. Total rules applied 310 place count 168 transition count 1186
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 329 place count 149 transition count 1167
Iterating global reduction 3 with 19 rules applied. Total rules applied 348 place count 149 transition count 1167
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 367 place count 130 transition count 1148
Iterating global reduction 3 with 19 rules applied. Total rules applied 386 place count 130 transition count 1148
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 405 place count 111 transition count 1129
Iterating global reduction 3 with 19 rules applied. Total rules applied 424 place count 111 transition count 1129
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 439 place count 96 transition count 1114
Iterating global reduction 3 with 15 rules applied. Total rules applied 454 place count 96 transition count 1114
Applied a total of 454 rules in 48 ms. Remains 96 /336 variables (removed 240) and now considering 1114/1328 (removed 214) transitions.
[2024-06-01 07:57:00] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
// Phase 1: matrix 111 rows 96 cols
[2024-06-01 07:57:00] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 07:57:00] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 07:57:00] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
[2024-06-01 07:57:00] [INFO ] Invariant cache hit.
[2024-06-01 07:57:00] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 1081 sub problems to find dead transitions.
[2024-06-01 07:57:00] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
[2024-06-01 07:57:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 4 (OVERLAPS) 111/206 variables, 95/98 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 6 (OVERLAPS) 1/207 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 99 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 27250 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 1081/1081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1081 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 4 (OVERLAPS) 111/206 variables, 95/98 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 1079/1177 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 7 (OVERLAPS) 1/207 variables, 1/1178 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 2/1180 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 207/207 variables, and 1180 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 1081/1081 constraints, Known Traps: 0/0 constraints]
After SMT, in 57642ms problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 57660ms
Starting structural reductions in LTL mode, iteration 1 : 96/336 places, 1114/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57983 ms. Remains : 96/336 places, 1114/1328 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 366 ms.
Product exploration explored 100000 steps with 33333 reset in 287 ms.
Computed a total of 96 stabilizing places and 1114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 96 transition count 1114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLCardinality-04 finished in 59058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 3 out of 336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 1328/1328 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 329 transition count 1328
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 48 place count 288 transition count 1287
Iterating global reduction 1 with 41 rules applied. Total rules applied 89 place count 288 transition count 1287
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 122 place count 255 transition count 1254
Iterating global reduction 1 with 33 rules applied. Total rules applied 155 place count 255 transition count 1254
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 159 place count 251 transition count 1254
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 186 place count 224 transition count 1227
Iterating global reduction 2 with 27 rules applied. Total rules applied 213 place count 224 transition count 1227
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 227 place count 210 transition count 1227
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 261 place count 176 transition count 1193
Iterating global reduction 3 with 34 rules applied. Total rules applied 295 place count 176 transition count 1193
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 313 place count 158 transition count 1175
Iterating global reduction 3 with 18 rules applied. Total rules applied 331 place count 158 transition count 1175
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 349 place count 140 transition count 1157
Iterating global reduction 3 with 18 rules applied. Total rules applied 367 place count 140 transition count 1157
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 385 place count 122 transition count 1139
Iterating global reduction 3 with 18 rules applied. Total rules applied 403 place count 122 transition count 1139
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 417 place count 108 transition count 1125
Iterating global reduction 3 with 14 rules applied. Total rules applied 431 place count 108 transition count 1125
Applied a total of 431 rules in 39 ms. Remains 108 /336 variables (removed 228) and now considering 1125/1328 (removed 203) transitions.
[2024-06-01 07:57:59] [INFO ] Flow matrix only has 153 transitions (discarded 972 similar events)
// Phase 1: matrix 153 rows 108 cols
[2024-06-01 07:57:59] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 07:57:59] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 07:57:59] [INFO ] Flow matrix only has 153 transitions (discarded 972 similar events)
[2024-06-01 07:57:59] [INFO ] Invariant cache hit.
[2024-06-01 07:57:59] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 1092 sub problems to find dead transitions.
[2024-06-01 07:57:59] [INFO ] Flow matrix only has 153 transitions (discarded 972 similar events)
[2024-06-01 07:57:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 4 (OVERLAPS) 153/260 variables, 107/111 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 6 (OVERLAPS) 1/261 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 261/261 variables, and 112 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 4 (OVERLAPS) 153/260 variables, 107/111 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 1090/1201 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 7 (OVERLAPS) 1/261 variables, 1/1202 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 2/1204 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/261 variables, and 1204 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 0/0 constraints]
After SMT, in 60337ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 60348ms
Starting structural reductions in LTL mode, iteration 1 : 108/336 places, 1125/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60671 ms. Remains : 108/336 places, 1125/1328 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLCardinality-05 finished in 60809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 1328/1328 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 328 transition count 1328
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 51 place count 285 transition count 1285
Iterating global reduction 1 with 43 rules applied. Total rules applied 94 place count 285 transition count 1285
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 128 place count 251 transition count 1251
Iterating global reduction 1 with 34 rules applied. Total rules applied 162 place count 251 transition count 1251
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 166 place count 247 transition count 1251
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 196 place count 217 transition count 1221
Iterating global reduction 2 with 30 rules applied. Total rules applied 226 place count 217 transition count 1221
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 2 with 16 rules applied. Total rules applied 242 place count 201 transition count 1221
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 280 place count 163 transition count 1183
Iterating global reduction 3 with 38 rules applied. Total rules applied 318 place count 163 transition count 1183
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 338 place count 143 transition count 1163
Iterating global reduction 3 with 20 rules applied. Total rules applied 358 place count 143 transition count 1163
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 378 place count 123 transition count 1143
Iterating global reduction 3 with 20 rules applied. Total rules applied 398 place count 123 transition count 1143
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 418 place count 103 transition count 1123
Iterating global reduction 3 with 20 rules applied. Total rules applied 438 place count 103 transition count 1123
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 454 place count 87 transition count 1107
Iterating global reduction 3 with 16 rules applied. Total rules applied 470 place count 87 transition count 1107
Applied a total of 470 rules in 43 ms. Remains 87 /336 variables (removed 249) and now considering 1107/1328 (removed 221) transitions.
[2024-06-01 07:59:00] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
// Phase 1: matrix 89 rows 87 cols
[2024-06-01 07:59:00] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 07:59:00] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 07:59:00] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
[2024-06-01 07:59:00] [INFO ] Invariant cache hit.
[2024-06-01 07:59:00] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 1074 sub problems to find dead transitions.
[2024-06-01 07:59:00] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
[2024-06-01 07:59:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 4 (OVERLAPS) 89/176 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 6 (OVERLAPS) 0/176 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 89 constraints, problems are : Problem set: 0 solved, 1074 unsolved in 20474 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 1074/1074 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1074 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 4 (OVERLAPS) 89/176 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 1074/1163 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 7 (OVERLAPS) 0/176 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 1163 constraints, problems are : Problem set: 0 solved, 1074 unsolved in 24120 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 1074/1074 constraints, Known Traps: 0/0 constraints]
After SMT, in 44812ms problems are : Problem set: 0 solved, 1074 unsolved
Search for dead transitions found 0 dead transitions in 44822ms
Starting structural reductions in LTL mode, iteration 1 : 87/336 places, 1107/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45112 ms. Remains : 87/336 places, 1107/1328 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLCardinality-07 finished in 45331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(G(p1)))) U !p1)))'
Support contains 4 out of 336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 1328/1328 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 331 transition count 1328
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 45 place count 291 transition count 1288
Iterating global reduction 1 with 40 rules applied. Total rules applied 85 place count 291 transition count 1288
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 117 place count 259 transition count 1256
Iterating global reduction 1 with 32 rules applied. Total rules applied 149 place count 259 transition count 1256
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 153 place count 255 transition count 1256
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 180 place count 228 transition count 1229
Iterating global reduction 2 with 27 rules applied. Total rules applied 207 place count 228 transition count 1229
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 220 place count 215 transition count 1229
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 252 place count 183 transition count 1197
Iterating global reduction 3 with 32 rules applied. Total rules applied 284 place count 183 transition count 1197
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 301 place count 166 transition count 1180
Iterating global reduction 3 with 17 rules applied. Total rules applied 318 place count 166 transition count 1180
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 335 place count 149 transition count 1163
Iterating global reduction 3 with 17 rules applied. Total rules applied 352 place count 149 transition count 1163
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 369 place count 132 transition count 1146
Iterating global reduction 3 with 17 rules applied. Total rules applied 386 place count 132 transition count 1146
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 399 place count 119 transition count 1133
Iterating global reduction 3 with 13 rules applied. Total rules applied 412 place count 119 transition count 1133
Applied a total of 412 rules in 36 ms. Remains 119 /336 variables (removed 217) and now considering 1133/1328 (removed 195) transitions.
[2024-06-01 07:59:45] [INFO ] Flow matrix only has 162 transitions (discarded 971 similar events)
// Phase 1: matrix 162 rows 119 cols
[2024-06-01 07:59:45] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 07:59:45] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 07:59:45] [INFO ] Flow matrix only has 162 transitions (discarded 971 similar events)
[2024-06-01 07:59:45] [INFO ] Invariant cache hit.
[2024-06-01 07:59:46] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 1100 sub problems to find dead transitions.
[2024-06-01 07:59:46] [INFO ] Flow matrix only has 162 transitions (discarded 971 similar events)
[2024-06-01 07:59:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 4 (OVERLAPS) 162/278 variables, 116/121 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 6 (OVERLAPS) 3/281 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 281/281 variables, and 124 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 4 (OVERLAPS) 162/278 variables, 116/121 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 1095/1216 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 7 (OVERLAPS) 3/281 variables, 3/1219 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 5/1224 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 281/281 variables, and 1224 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 0/0 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 60301ms
Starting structural reductions in LTL mode, iteration 1 : 119/336 places, 1133/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60617 ms. Remains : 119/336 places, 1133/1328 transitions.
Stuttering acceptance computed with spot in 185 ms :[p1, p1, (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Computed a total of 119 stabilizing places and 1133 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 119 transition count 1133
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLCardinality-08 finished in 61408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 336/336 places, 1328/1328 transitions.
Graph (complete) has 2056 edges and 336 vertex of which 327 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 327 transition count 1256
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 256 transition count 1256
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 143 place count 256 transition count 1229
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 197 place count 229 transition count 1229
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 225 place count 201 transition count 1201
Iterating global reduction 2 with 28 rules applied. Total rules applied 253 place count 201 transition count 1201
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 263 place count 191 transition count 1191
Iterating global reduction 2 with 10 rules applied. Total rules applied 273 place count 191 transition count 1191
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 277 place count 187 transition count 1191
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 277 place count 187 transition count 1187
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 285 place count 183 transition count 1187
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 289 place count 179 transition count 1183
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 179 transition count 1183
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 297 place count 175 transition count 1179
Iterating global reduction 3 with 4 rules applied. Total rules applied 301 place count 175 transition count 1179
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 373 place count 139 transition count 1143
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 387 place count 125 transition count 1129
Iterating global reduction 3 with 14 rules applied. Total rules applied 401 place count 125 transition count 1129
Applied a total of 401 rules in 63 ms. Remains 125 /336 variables (removed 211) and now considering 1129/1328 (removed 199) transitions.
[2024-06-01 08:00:47] [INFO ] Flow matrix only has 363 transitions (discarded 766 similar events)
// Phase 1: matrix 363 rows 125 cols
[2024-06-01 08:00:47] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 08:00:47] [INFO ] Implicit Places using invariants in 110 ms returned [8, 14, 15, 32, 38, 46, 52, 56, 60, 64, 78, 90, 96, 102]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 111 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/336 places, 1129/1328 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 99 transition count 1117
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 99 transition count 1117
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 87 transition count 1105
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 87 transition count 1105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 85 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 83 transition count 1101
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 83 transition count 1101
Applied a total of 56 rules in 29 ms. Remains 83 /111 variables (removed 28) and now considering 1101/1129 (removed 28) transitions.
[2024-06-01 08:00:47] [INFO ] Flow matrix only has 111 transitions (discarded 990 similar events)
// Phase 1: matrix 111 rows 83 cols
[2024-06-01 08:00:47] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 08:00:47] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 08:00:47] [INFO ] Flow matrix only has 111 transitions (discarded 990 similar events)
[2024-06-01 08:00:47] [INFO ] Invariant cache hit.
[2024-06-01 08:00:47] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/336 places, 1101/1328 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 468 ms. Remains : 83/336 places, 1101/1328 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLCardinality-09
Product exploration explored 100000 steps with 8383 reset in 334 ms.
Product exploration explored 100000 steps with 8356 reset in 380 ms.
Computed a total of 83 stabilizing places and 1101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 83 transition count 1101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLCardinality-09 finished in 1480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 336/336 places, 1328/1328 transitions.
Graph (complete) has 2056 edges and 336 vertex of which 328 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 328 transition count 1258
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 259 transition count 1258
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 139 place count 259 transition count 1231
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 193 place count 232 transition count 1231
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 218 place count 207 transition count 1206
Iterating global reduction 2 with 25 rules applied. Total rules applied 243 place count 207 transition count 1206
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 251 place count 199 transition count 1198
Iterating global reduction 2 with 8 rules applied. Total rules applied 259 place count 199 transition count 1198
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 263 place count 195 transition count 1198
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 263 place count 195 transition count 1194
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 271 place count 191 transition count 1194
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 275 place count 187 transition count 1190
Iterating global reduction 3 with 4 rules applied. Total rules applied 279 place count 187 transition count 1190
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 283 place count 183 transition count 1186
Iterating global reduction 3 with 4 rules applied. Total rules applied 287 place count 183 transition count 1186
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 363 place count 145 transition count 1148
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 378 place count 130 transition count 1133
Iterating global reduction 3 with 15 rules applied. Total rules applied 393 place count 130 transition count 1133
Applied a total of 393 rules in 56 ms. Remains 130 /336 variables (removed 206) and now considering 1133/1328 (removed 195) transitions.
[2024-06-01 08:00:48] [INFO ] Flow matrix only has 368 transitions (discarded 765 similar events)
// Phase 1: matrix 368 rows 130 cols
[2024-06-01 08:00:48] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 08:00:48] [INFO ] Implicit Places using invariants in 110 ms returned [8, 16, 17, 26, 32, 49, 55, 67, 71, 85, 89, 95, 101, 107]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 112 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/336 places, 1133/1328 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 104 transition count 1121
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 104 transition count 1121
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 92 transition count 1109
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 92 transition count 1109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 90 transition count 1107
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 88 transition count 1105
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 88 transition count 1105
Applied a total of 56 rules in 30 ms. Remains 88 /116 variables (removed 28) and now considering 1105/1133 (removed 28) transitions.
[2024-06-01 08:00:48] [INFO ] Flow matrix only has 116 transitions (discarded 989 similar events)
// Phase 1: matrix 116 rows 88 cols
[2024-06-01 08:00:48] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 08:00:48] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 08:00:48] [INFO ] Flow matrix only has 116 transitions (discarded 989 similar events)
[2024-06-01 08:00:48] [INFO ] Invariant cache hit.
[2024-06-01 08:00:49] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/336 places, 1105/1328 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 470 ms. Remains : 88/336 places, 1105/1328 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLCardinality-10
Stuttering criterion allowed to conclude after 162 steps with 13 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLCardinality-10 finished in 525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 4 out of 336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 1328/1328 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 328 transition count 1328
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 49 place count 287 transition count 1287
Iterating global reduction 1 with 41 rules applied. Total rules applied 90 place count 287 transition count 1287
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 123 place count 254 transition count 1254
Iterating global reduction 1 with 33 rules applied. Total rules applied 156 place count 254 transition count 1254
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 160 place count 250 transition count 1254
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 190 place count 220 transition count 1224
Iterating global reduction 2 with 30 rules applied. Total rules applied 220 place count 220 transition count 1224
Discarding 15 places :
Implicit places reduction removed 15 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 235 place count 205 transition count 1224
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 272 place count 168 transition count 1187
Iterating global reduction 3 with 37 rules applied. Total rules applied 309 place count 168 transition count 1187
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 328 place count 149 transition count 1168
Iterating global reduction 3 with 19 rules applied. Total rules applied 347 place count 149 transition count 1168
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 366 place count 130 transition count 1149
Iterating global reduction 3 with 19 rules applied. Total rules applied 385 place count 130 transition count 1149
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 404 place count 111 transition count 1130
Iterating global reduction 3 with 19 rules applied. Total rules applied 423 place count 111 transition count 1130
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 438 place count 96 transition count 1115
Iterating global reduction 3 with 15 rules applied. Total rules applied 453 place count 96 transition count 1115
Applied a total of 453 rules in 28 ms. Remains 96 /336 variables (removed 240) and now considering 1115/1328 (removed 213) transitions.
[2024-06-01 08:00:49] [INFO ] Flow matrix only has 113 transitions (discarded 1002 similar events)
// Phase 1: matrix 113 rows 96 cols
[2024-06-01 08:00:49] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 08:00:49] [INFO ] Implicit Places using invariants in 103 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/336 places, 1115/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 94 transition count 1114
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 1114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 93 transition count 1113
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 93 transition count 1113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 92 transition count 1112
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 92 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 91 transition count 1111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 91 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 90 transition count 1110
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 90 transition count 1110
Applied a total of 10 rules in 14 ms. Remains 90 /95 variables (removed 5) and now considering 1110/1115 (removed 5) transitions.
[2024-06-01 08:00:49] [INFO ] Flow matrix only has 93 transitions (discarded 1017 similar events)
// Phase 1: matrix 93 rows 90 cols
[2024-06-01 08:00:49] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:00:49] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 08:00:49] [INFO ] Flow matrix only has 93 transitions (discarded 1017 similar events)
[2024-06-01 08:00:49] [INFO ] Invariant cache hit.
[2024-06-01 08:00:49] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 90/336 places, 1110/1328 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 369 ms. Remains : 90/336 places, 1110/1328 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLCardinality-11
Product exploration explored 100000 steps with 30900 reset in 251 ms.
Product exploration explored 100000 steps with 30914 reset in 282 ms.
Computed a total of 90 stabilizing places and 1110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 1110
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 249 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 504 steps (16 resets) in 5 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 295 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 1110/1110 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2024-06-01 08:00:51] [INFO ] Flow matrix only has 93 transitions (discarded 1017 similar events)
[2024-06-01 08:00:51] [INFO ] Invariant cache hit.
[2024-06-01 08:00:51] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 08:00:51] [INFO ] Flow matrix only has 93 transitions (discarded 1017 similar events)
[2024-06-01 08:00:51] [INFO ] Invariant cache hit.
[2024-06-01 08:00:51] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 1077 sub problems to find dead transitions.
[2024-06-01 08:00:51] [INFO ] Flow matrix only has 93 transitions (discarded 1017 similar events)
[2024-06-01 08:00:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 4 (OVERLAPS) 93/183 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 92 constraints, problems are : Problem set: 0 solved, 1077 unsolved in 20323 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 1077/1077 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1077 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 4 (OVERLAPS) 93/183 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1077/1169 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 1169 constraints, problems are : Problem set: 0 solved, 1077 unsolved in 22809 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 1077/1077 constraints, Known Traps: 0/0 constraints]
After SMT, in 43361ms problems are : Problem set: 0 solved, 1077 unsolved
Search for dead transitions found 0 dead transitions in 43372ms
Finished structural reductions in LTL mode , in 1 iterations and 43612 ms. Remains : 90/90 places, 1110/1110 transitions.
Computed a total of 90 stabilizing places and 1110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 1110
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 596 steps (20 resets) in 9 ms. (59 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 30947 reset in 496 ms.
Product exploration explored 100000 steps with 30996 reset in 292 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 1110/1110 transitions.
Graph (complete) has 1316 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 89 transition count 1109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 9 place count 89 transition count 1109
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 89 transition count 1109
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 19 place count 82 transition count 1102
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 26 place count 82 transition count 1102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 82 transition count 1102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 81 transition count 1101
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 81 transition count 1101
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 29 rules in 38 ms. Remains 81 /90 variables (removed 9) and now considering 1101/1110 (removed 9) transitions.
[2024-06-01 08:01:37] [INFO ] Redundant transitions in 56 ms returned []
Running 1068 sub problems to find dead transitions.
[2024-06-01 08:01:37] [INFO ] Flow matrix only has 80 transitions (discarded 1021 similar events)
// Phase 1: matrix 80 rows 81 cols
[2024-06-01 08:01:37] [INFO ] Computed 2 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD572 is UNSAT
At refinement iteration 4 (OVERLAPS) 80/161 variables, 81/83 constraints. Problems are: Problem set: 6 solved, 1062 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/83 constraints. Problems are: Problem set: 6 solved, 1062 unsolved
At refinement iteration 6 (OVERLAPS) 0/161 variables, 0/83 constraints. Problems are: Problem set: 6 solved, 1062 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 83 constraints, problems are : Problem set: 6 solved, 1062 unsolved in 18480 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 1068/1068 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1062 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1062 unsolved
At refinement iteration 1 (OVERLAPS) 7/81 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 1062 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 1062 unsolved
At refinement iteration 3 (OVERLAPS) 80/161 variables, 81/83 constraints. Problems are: Problem set: 6 solved, 1062 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1062/1145 constraints. Problems are: Problem set: 6 solved, 1062 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/1145 constraints. Problems are: Problem set: 6 solved, 1062 unsolved
At refinement iteration 6 (OVERLAPS) 0/161 variables, 0/1145 constraints. Problems are: Problem set: 6 solved, 1062 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 1145 constraints, problems are : Problem set: 6 solved, 1062 unsolved in 20066 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 1062/1068 constraints, Known Traps: 0/0 constraints]
After SMT, in 38795ms problems are : Problem set: 6 solved, 1062 unsolved
Search for dead transitions found 6 dead transitions in 38805ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 81/90 places, 1095/1110 transitions.
Graph (complete) has 1267 edges and 81 vertex of which 75 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 75 /81 variables (removed 6) and now considering 1095/1095 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/90 places, 1095/1110 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38920 ms. Remains : 75/90 places, 1095/1110 transitions.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 1110/1110 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 88 transition count 1108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 88 transition count 1108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 86 transition count 1106
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 86 transition count 1106
Applied a total of 8 rules in 9 ms. Remains 86 /90 variables (removed 4) and now considering 1106/1110 (removed 4) transitions.
[2024-06-01 08:02:16] [INFO ] Flow matrix only has 87 transitions (discarded 1019 similar events)
// Phase 1: matrix 87 rows 86 cols
[2024-06-01 08:02:16] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:02:16] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 08:02:16] [INFO ] Flow matrix only has 87 transitions (discarded 1019 similar events)
[2024-06-01 08:02:16] [INFO ] Invariant cache hit.
[2024-06-01 08:02:16] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 1073 sub problems to find dead transitions.
[2024-06-01 08:02:16] [INFO ] Flow matrix only has 87 transitions (discarded 1019 similar events)
[2024-06-01 08:02:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 4 (OVERLAPS) 87/173 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 6 (OVERLAPS) 0/173 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 88 constraints, problems are : Problem set: 0 solved, 1073 unsolved in 20597 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 1073/1073 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1073 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 4 (OVERLAPS) 87/173 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 1073/1161 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 7 (OVERLAPS) 0/173 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 1161 constraints, problems are : Problem set: 0 solved, 1073 unsolved in 22868 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 1073/1073 constraints, Known Traps: 0/0 constraints]
After SMT, in 43686ms problems are : Problem set: 0 solved, 1073 unsolved
Search for dead transitions found 0 dead transitions in 43695ms
Starting structural reductions in LTL mode, iteration 1 : 86/90 places, 1106/1110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43952 ms. Remains : 86/90 places, 1106/1110 transitions.
Treatment of property LeafsetExtension-PT-S32C3-LTLCardinality-11 finished in 131008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 336/336 places, 1328/1328 transitions.
Graph (complete) has 2056 edges and 336 vertex of which 327 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 327 transition count 1254
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 254 transition count 1254
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 147 place count 254 transition count 1229
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 197 place count 229 transition count 1229
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 223 place count 203 transition count 1203
Iterating global reduction 2 with 26 rules applied. Total rules applied 249 place count 203 transition count 1203
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 259 place count 193 transition count 1193
Iterating global reduction 2 with 10 rules applied. Total rules applied 269 place count 193 transition count 1193
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 273 place count 189 transition count 1193
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 273 place count 189 transition count 1189
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 281 place count 185 transition count 1189
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 285 place count 181 transition count 1185
Iterating global reduction 3 with 4 rules applied. Total rules applied 289 place count 181 transition count 1185
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 293 place count 177 transition count 1181
Iterating global reduction 3 with 4 rules applied. Total rules applied 297 place count 177 transition count 1181
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 373 place count 139 transition count 1143
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 389 place count 123 transition count 1127
Iterating global reduction 3 with 16 rules applied. Total rules applied 405 place count 123 transition count 1127
Applied a total of 405 rules in 61 ms. Remains 123 /336 variables (removed 213) and now considering 1127/1328 (removed 201) transitions.
[2024-06-01 08:03:00] [INFO ] Flow matrix only has 363 transitions (discarded 764 similar events)
// Phase 1: matrix 363 rows 123 cols
[2024-06-01 08:03:00] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 08:03:00] [INFO ] Implicit Places using invariants in 228 ms returned [8, 14, 15, 24, 31, 37, 45, 51, 55, 59, 63, 77, 81, 87, 93, 100]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 229 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/336 places, 1127/1328 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 93 transition count 1113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 93 transition count 1113
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 79 transition count 1099
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 79 transition count 1099
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 77 transition count 1097
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 75 transition count 1095
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 75 transition count 1095
Applied a total of 64 rules in 24 ms. Remains 75 /107 variables (removed 32) and now considering 1095/1127 (removed 32) transitions.
[2024-06-01 08:03:00] [INFO ] Flow matrix only has 75 transitions (discarded 1020 similar events)
// Phase 1: matrix 75 rows 75 cols
[2024-06-01 08:03:00] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:03:00] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 08:03:00] [INFO ] Flow matrix only has 75 transitions (discarded 1020 similar events)
[2024-06-01 08:03:00] [INFO ] Invariant cache hit.
[2024-06-01 08:03:00] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/336 places, 1095/1328 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 555 ms. Remains : 75/336 places, 1095/1328 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLCardinality-13
Product exploration explored 100000 steps with 9121 reset in 247 ms.
Product exploration explored 100000 steps with 9116 reset in 252 ms.
Computed a total of 75 stabilizing places and 1095 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 1095
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLCardinality-13 finished in 1261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 336/336 places, 1328/1328 transitions.
Graph (complete) has 2056 edges and 336 vertex of which 328 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 328 transition count 1256
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 257 transition count 1256
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 143 place count 257 transition count 1229
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 197 place count 230 transition count 1229
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 225 place count 202 transition count 1201
Iterating global reduction 2 with 28 rules applied. Total rules applied 253 place count 202 transition count 1201
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 263 place count 192 transition count 1191
Iterating global reduction 2 with 10 rules applied. Total rules applied 273 place count 192 transition count 1191
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 277 place count 188 transition count 1191
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 277 place count 188 transition count 1187
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 285 place count 184 transition count 1187
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 289 place count 180 transition count 1183
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 180 transition count 1183
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 297 place count 176 transition count 1179
Iterating global reduction 3 with 4 rules applied. Total rules applied 301 place count 176 transition count 1179
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 373 place count 140 transition count 1143
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 387 place count 126 transition count 1129
Iterating global reduction 3 with 14 rules applied. Total rules applied 401 place count 126 transition count 1129
Applied a total of 401 rules in 50 ms. Remains 126 /336 variables (removed 210) and now considering 1129/1328 (removed 199) transitions.
[2024-06-01 08:03:01] [INFO ] Flow matrix only has 363 transitions (discarded 766 similar events)
// Phase 1: matrix 363 rows 126 cols
[2024-06-01 08:03:01] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 08:03:01] [INFO ] Implicit Places using invariants in 202 ms returned [8, 18, 27, 33, 39, 47, 53, 57, 61, 65, 79, 83, 89, 103]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 203 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/336 places, 1129/1328 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 100 transition count 1117
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 100 transition count 1117
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 88 transition count 1105
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 88 transition count 1105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 86 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 84 transition count 1101
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 84 transition count 1101
Applied a total of 56 rules in 22 ms. Remains 84 /112 variables (removed 28) and now considering 1101/1129 (removed 28) transitions.
[2024-06-01 08:03:01] [INFO ] Flow matrix only has 111 transitions (discarded 990 similar events)
// Phase 1: matrix 111 rows 84 cols
[2024-06-01 08:03:01] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 08:03:01] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 08:03:01] [INFO ] Flow matrix only has 111 transitions (discarded 990 similar events)
[2024-06-01 08:03:01] [INFO ] Invariant cache hit.
[2024-06-01 08:03:02] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/336 places, 1101/1328 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 544 ms. Remains : 84/336 places, 1101/1328 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLCardinality-14
Stuttering criterion allowed to conclude after 55 steps with 3 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLCardinality-14 finished in 587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&G(p1))||((X(p2) U p3)&&X(!p2)))))'
Support contains 7 out of 336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 1328/1328 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 328 transition count 1328
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 45 place count 291 transition count 1291
Iterating global reduction 1 with 37 rules applied. Total rules applied 82 place count 291 transition count 1291
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 111 place count 262 transition count 1262
Iterating global reduction 1 with 29 rules applied. Total rules applied 140 place count 262 transition count 1262
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 142 place count 260 transition count 1262
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 164 place count 238 transition count 1240
Iterating global reduction 2 with 22 rules applied. Total rules applied 186 place count 238 transition count 1240
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 198 place count 226 transition count 1240
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 227 place count 197 transition count 1211
Iterating global reduction 3 with 29 rules applied. Total rules applied 256 place count 197 transition count 1211
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 270 place count 183 transition count 1197
Iterating global reduction 3 with 14 rules applied. Total rules applied 284 place count 183 transition count 1197
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 298 place count 169 transition count 1183
Iterating global reduction 3 with 14 rules applied. Total rules applied 312 place count 169 transition count 1183
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 326 place count 155 transition count 1169
Iterating global reduction 3 with 14 rules applied. Total rules applied 340 place count 155 transition count 1169
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 352 place count 143 transition count 1157
Iterating global reduction 3 with 12 rules applied. Total rules applied 364 place count 143 transition count 1157
Applied a total of 364 rules in 37 ms. Remains 143 /336 variables (removed 193) and now considering 1157/1328 (removed 171) transitions.
[2024-06-01 08:03:02] [INFO ] Flow matrix only has 233 transitions (discarded 924 similar events)
// Phase 1: matrix 233 rows 143 cols
[2024-06-01 08:03:02] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 08:03:02] [INFO ] Implicit Places using invariants in 112 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/336 places, 1157/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 1156
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 1156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 140 transition count 1155
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 140 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 139 transition count 1154
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 139 transition count 1154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 138 transition count 1153
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 138 transition count 1153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 137 transition count 1152
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 137 transition count 1152
Applied a total of 10 rules in 17 ms. Remains 137 /142 variables (removed 5) and now considering 1152/1157 (removed 5) transitions.
[2024-06-01 08:03:02] [INFO ] Flow matrix only has 213 transitions (discarded 939 similar events)
// Phase 1: matrix 213 rows 137 cols
[2024-06-01 08:03:02] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 08:03:02] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 08:03:02] [INFO ] Flow matrix only has 213 transitions (discarded 939 similar events)
[2024-06-01 08:03:02] [INFO ] Invariant cache hit.
[2024-06-01 08:03:02] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/336 places, 1152/1328 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 489 ms. Remains : 137/336 places, 1152/1328 transitions.
Stuttering acceptance computed with spot in 272 ms :[p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2) (AND (NOT p1) p2)), true, (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 279 ms.
Product exploration explored 100000 steps with 33333 reset in 299 ms.
Computed a total of 137 stabilizing places and 1152 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 137 transition count 1152
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1 p0 p3), (X p3), (X (AND p0 p1 p3)), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p0), (X p1), (X (NOT (AND (NOT p0) p1 p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X p0)), (X (X p1)), (F (G (NOT p2))), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 18 ms. Reduced automaton from 8 states, 19 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLCardinality-15 finished in 1516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
[2024-06-01 08:03:03] [INFO ] Flatten gal took : 64 ms
[2024-06-01 08:03:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 08:03:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 336 places, 1328 transitions and 4978 arcs took 12 ms.
Total runtime 370403 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA LeafsetExtension-PT-S32C3-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717229348588

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name LeafsetExtension-PT-S32C3-LTLCardinality-11
ltl formula formula --ltl=/tmp/1095/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 336 places, 1328 transitions and 4978 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1095/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1095/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1095/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.030 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1095/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 330 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 337, there are 1334 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~21 levels ~10000 states ~27180 transitions
pnml2lts-mc( 0/ 4): ~21 levels ~20000 states ~53500 transitions
pnml2lts-mc( 0/ 4): ~21 levels ~40000 states ~104312 transitions
pnml2lts-mc( 0/ 4): ~21 levels ~80000 states ~205124 transitions
pnml2lts-mc( 1/ 4): ~21 levels ~160000 states ~429972 transitions
pnml2lts-mc( 1/ 4): ~22 levels ~320000 states ~858772 transitions
pnml2lts-mc( 1/ 4): ~22 levels ~640000 states ~1691336 transitions
pnml2lts-mc( 1/ 4): ~22 levels ~1280000 states ~3542160 transitions
pnml2lts-mc( 1/ 4): ~22 levels ~2560000 states ~7164576 transitions
pnml2lts-mc( 1/ 4): ~22 levels ~5120000 states ~14290720 transitions
pnml2lts-mc( 1/ 4): ~22 levels ~10240000 states ~27872460 transitions
pnml2lts-mc( 1/ 4): ~22 levels ~20480000 states ~55681696 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 21076386
pnml2lts-mc( 0/ 4): unique states count: 21076386
pnml2lts-mc( 0/ 4): unique transitions count: 55353837
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 34306795
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 21079767
pnml2lts-mc( 0/ 4): - cum. max stack depth: 88
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21079767 states 55411833 transitions, fanout: 2.629
pnml2lts-mc( 0/ 4): Total exploration time 363.470 sec (363.450 sec minimum, 363.462 sec on average)
pnml2lts-mc( 0/ 4): States per second: 57996, Transitions per second: 152452
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 192.0MB, 9.6 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 62.0%/48.0%
pnml2lts-mc( 0/ 4): Stored 1358 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 192.0MB (~256.0MB paged-in)

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="LeafsetExtension-PT-S32C3"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is LeafsetExtension-PT-S32C3, 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 r504-tall-171649612600371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S32C3.tgz
mv LeafsetExtension-PT-S32C3 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;