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.r496-tall-171640603000267.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 FunctionPointer-PT-b128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603000267
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.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 3.3K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 11 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b128-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717189970129

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:12:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:12:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:12:51] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-31 21:12:51] [INFO ] Transformed 306 places.
[2024-05-31 21:12:51] [INFO ] Transformed 840 transitions.
[2024-05-31 21:12:51] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b128-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 214 transition count 648
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 32 place count 190 transition count 522
Iterating global reduction 1 with 24 rules applied. Total rules applied 56 place count 190 transition count 522
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 100 place count 190 transition count 478
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 110 place count 180 transition count 458
Iterating global reduction 2 with 10 rules applied. Total rules applied 120 place count 180 transition count 458
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 132 place count 180 transition count 446
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 177 transition count 440
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 177 transition count 440
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 175 transition count 432
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 175 transition count 432
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 173 transition count 428
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 173 transition count 428
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 172 transition count 424
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 172 transition count 424
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 171 transition count 420
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 171 transition count 420
Applied a total of 150 rules in 161 ms. Remains 171 /222 variables (removed 51) and now considering 420/648 (removed 228) transitions.
[2024-05-31 21:12:51] [INFO ] Flow matrix only has 290 transitions (discarded 130 similar events)
// Phase 1: matrix 290 rows 171 cols
[2024-05-31 21:12:51] [INFO ] Computed 2 invariants in 18 ms
[2024-05-31 21:12:52] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-31 21:12:52] [INFO ] Flow matrix only has 290 transitions (discarded 130 similar events)
[2024-05-31 21:12:52] [INFO ] Invariant cache hit.
[2024-05-31 21:12:52] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-31 21:12:53] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2024-05-31 21:12:53] [INFO ] Flow matrix only has 290 transitions (discarded 130 similar events)
[2024-05-31 21:12:53] [INFO ] Invariant cache hit.
[2024-05-31 21:12:53] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 290/459 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 61/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/461 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 234 constraints, problems are : Problem set: 0 solved, 418 unsolved in 17211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 171/171 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 290/459 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 61/232 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (OVERLAPS) 2/461 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 386/652 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 10 (OVERLAPS) 0/461 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 652 constraints, problems are : Problem set: 0 solved, 418 unsolved in 22983 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 171/171 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 0/0 constraints]
After SMT, in 40832ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 40849ms
Starting structural reductions in LTL mode, iteration 1 : 171/222 places, 420/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42838 ms. Remains : 171/222 places, 420/648 transitions.
Support contains 26 out of 171 places after structural reductions.
[2024-05-31 21:13:34] [INFO ] Flatten gal took : 56 ms
[2024-05-31 21:13:34] [INFO ] Flatten gal took : 25 ms
[2024-05-31 21:13:34] [INFO ] Input system was already deterministic with 420 transitions.
RANDOM walk for 40145 steps (25 resets) in 858 ms. (46 steps per ms) remains 2/19 properties
BEST_FIRST walk for 40004 steps (25 resets) in 228 ms. (174 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (29 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
[2024-05-31 21:13:35] [INFO ] Flow matrix only has 290 transitions (discarded 130 similar events)
[2024-05-31 21:13:35] [INFO ] Invariant cache hit.
[2024-05-31 21:13:35] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/85 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 148/233 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 421/461 variables, and 157 constraints, problems are : Problem set: 1 solved, 0 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/171 constraints, ReadFeed: 12/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA FunctionPointer-PT-b128-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA FunctionPointer-PT-b128-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 909 edges and 171 vertex of which 169 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 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(F(p1))))))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 420
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 159 transition count 394
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 159 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 159 transition count 392
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 151 transition count 374
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 151 transition count 374
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 47 place count 144 transition count 354
Iterating global reduction 2 with 7 rules applied. Total rules applied 54 place count 144 transition count 354
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 137 transition count 330
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 137 transition count 330
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 130 transition count 312
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 130 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 124 transition count 294
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 118 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 118 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 112 transition count 266
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 112 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 106 transition count 254
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 134 place count 102 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 102 transition count 246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 99 transition count 240
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 97 transition count 236
Applied a total of 148 rules in 30 ms. Remains 97 /171 variables (removed 74) and now considering 236/420 (removed 184) transitions.
[2024-05-31 21:13:35] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-31 21:13:35] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:13:35] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 21:13:35] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 21:13:35] [INFO ] Invariant cache hit.
[2024-05-31 21:13:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:13:35] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-31 21:13:35] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 21:13:35] [INFO ] Invariant cache hit.
[2024-05-31 21:13:35] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5541 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 370 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6474 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 12229ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 12232ms
Starting structural reductions in LTL mode, iteration 1 : 97/171 places, 236/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12487 ms. Remains : 97/171 places, 236/420 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-00
Stuttering criterion allowed to conclude after 1091 steps with 42 reset in 19 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-00 finished in 12795 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((G(F(p0)) U p1))))'
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Graph (complete) has 909 edges and 171 vertex of which 170 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 162 transition count 398
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 162 transition count 398
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 24 place count 155 transition count 382
Iterating global reduction 0 with 7 rules applied. Total rules applied 31 place count 155 transition count 382
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 37 place count 149 transition count 364
Iterating global reduction 0 with 6 rules applied. Total rules applied 43 place count 149 transition count 364
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 49 place count 143 transition count 344
Iterating global reduction 0 with 6 rules applied. Total rules applied 55 place count 143 transition count 344
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 61 place count 137 transition count 328
Iterating global reduction 0 with 6 rules applied. Total rules applied 67 place count 137 transition count 328
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 72 place count 132 transition count 314
Iterating global reduction 0 with 5 rules applied. Total rules applied 77 place count 132 transition count 314
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 82 place count 127 transition count 302
Iterating global reduction 0 with 5 rules applied. Total rules applied 87 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 92 place count 122 transition count 292
Iterating global reduction 0 with 5 rules applied. Total rules applied 97 place count 122 transition count 292
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 102 place count 117 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 107 place count 117 transition count 282
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 110 place count 114 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 113 place count 114 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 115 place count 112 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 118 place count 111 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 119 place count 111 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 123 place count 111 transition count 266
Applied a total of 123 rules in 87 ms. Remains 111 /171 variables (removed 60) and now considering 266/420 (removed 154) transitions.
[2024-05-31 21:13:48] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
// Phase 1: matrix 181 rows 111 cols
[2024-05-31 21:13:48] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:13:48] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 21:13:48] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2024-05-31 21:13:48] [INFO ] Invariant cache hit.
[2024-05-31 21:13:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:13:48] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-31 21:13:48] [INFO ] Redundant transitions in 12 ms returned []
Running 264 sub problems to find dead transitions.
[2024-05-31 21:13:48] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2024-05-31 21:13:48] [INFO ] Invariant cache hit.
[2024-05-31 21:13:48] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 181/291 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/292 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/292 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 154 constraints, problems are : Problem set: 0 solved, 264 unsolved in 7955 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 181/291 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 32/185 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/292 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 232/418 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 418 constraints, problems are : Problem set: 0 solved, 264 unsolved in 9804 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
After SMT, in 17989ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 17993ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/171 places, 266/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18348 ms. Remains : 111/171 places, 266/420 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-01
Stuttering criterion allowed to conclude after 773 steps with 8 reset in 5 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-01 finished in 18533 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 G((p1&&(p2||X(F(p3)))))))'
Support contains 7 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Graph (complete) has 909 edges and 171 vertex of which 169 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 163 transition count 406
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 163 transition count 406
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 17 place count 163 transition count 402
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 159 transition count 392
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 159 transition count 392
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 155 transition count 384
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 155 transition count 384
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 152 transition count 374
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 152 transition count 374
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 150 transition count 370
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 150 transition count 370
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 148 transition count 362
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 148 transition count 362
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 146 transition count 354
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 146 transition count 354
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 144 transition count 350
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 144 transition count 350
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 142 transition count 346
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 142 transition count 346
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 140 transition count 342
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 140 transition count 342
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 138 transition count 338
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 138 transition count 338
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 136 transition count 334
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 136 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 136 transition count 324
Applied a total of 81 rules in 69 ms. Remains 136 /171 variables (removed 35) and now considering 324/420 (removed 96) transitions.
[2024-05-31 21:14:07] [INFO ] Flow matrix only has 224 transitions (discarded 100 similar events)
// Phase 1: matrix 224 rows 136 cols
[2024-05-31 21:14:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:14:07] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-31 21:14:07] [INFO ] Flow matrix only has 224 transitions (discarded 100 similar events)
[2024-05-31 21:14:07] [INFO ] Invariant cache hit.
[2024-05-31 21:14:07] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-31 21:14:07] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-31 21:14:07] [INFO ] Redundant transitions in 6 ms returned []
Running 322 sub problems to find dead transitions.
[2024-05-31 21:14:07] [INFO ] Flow matrix only has 224 transitions (discarded 100 similar events)
[2024-05-31 21:14:07] [INFO ] Invariant cache hit.
[2024-05-31 21:14:07] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 224/360 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 52/190 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 322 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/360 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 190 constraints, problems are : Problem set: 0 solved, 322 unsolved in 9896 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 224/360 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 52/190 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 322/512 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 512 constraints, problems are : Problem set: 0 solved, 322 unsolved in 11417 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints]
After SMT, in 21658ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 21664ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/171 places, 324/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22031 ms. Remains : 136/171 places, 324/420 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p3), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 5725 steps with 54 reset in 37 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-02 finished in 22364 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(p0) U X(X((X(p1) U G(p2))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 170 transition count 420
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 162 transition count 400
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 162 transition count 400
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 162 transition count 396
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 27 place count 156 transition count 382
Iterating global reduction 2 with 6 rules applied. Total rules applied 33 place count 156 transition count 382
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 151 transition count 368
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 151 transition count 368
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 146 transition count 352
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 146 transition count 352
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 141 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 141 transition count 338
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 137 transition count 326
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 137 transition count 326
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 133 transition count 316
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 133 transition count 316
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 129 transition count 308
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 129 transition count 308
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 91 place count 125 transition count 300
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 125 transition count 300
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 123 transition count 296
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 123 transition count 296
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 121 transition count 292
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 121 transition count 292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 120 transition count 290
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 120 transition count 290
Applied a total of 105 rules in 24 ms. Remains 120 /171 variables (removed 51) and now considering 290/420 (removed 130) transitions.
[2024-05-31 21:14:29] [INFO ] Flow matrix only has 199 transitions (discarded 91 similar events)
// Phase 1: matrix 199 rows 120 cols
[2024-05-31 21:14:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:14:29] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 21:14:29] [INFO ] Flow matrix only has 199 transitions (discarded 91 similar events)
[2024-05-31 21:14:29] [INFO ] Invariant cache hit.
[2024-05-31 21:14:29] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-31 21:14:29] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-31 21:14:29] [INFO ] Flow matrix only has 199 transitions (discarded 91 similar events)
[2024-05-31 21:14:29] [INFO ] Invariant cache hit.
[2024-05-31 21:14:29] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 199/318 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 46/167 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 288 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/319 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 168 constraints, problems are : Problem set: 0 solved, 288 unsolved in 8957 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 120/120 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 199/318 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 46/167 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 32/199 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/319 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 256/456 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 456 constraints, problems are : Problem set: 0 solved, 288 unsolved in 11555 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 120/120 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 20791ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 20795ms
Starting structural reductions in LTL mode, iteration 1 : 120/171 places, 290/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21075 ms. Remains : 120/171 places, 290/420 transitions.
Stuttering acceptance computed with spot in 403 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-03
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-03 finished in 21509 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 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Graph (complete) has 909 edges and 171 vertex of which 169 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 159 transition count 394
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 159 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 23 place count 159 transition count 392
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 152 transition count 376
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 152 transition count 376
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 145 transition count 356
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 145 transition count 356
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 138 transition count 332
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 138 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 71 place count 132 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 132 transition count 318
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 128 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 128 transition count 306
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 124 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 124 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 120 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 120 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 105 place count 116 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 109 place count 116 transition count 278
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 114 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 114 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 112 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 112 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 110 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 110 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 110 transition count 262
Applied a total of 125 rules in 44 ms. Remains 110 /171 variables (removed 61) and now considering 262/420 (removed 158) transitions.
[2024-05-31 21:14:50] [INFO ] Flow matrix only has 180 transitions (discarded 82 similar events)
// Phase 1: matrix 180 rows 110 cols
[2024-05-31 21:14:50] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 21:14:50] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 21:14:50] [INFO ] Flow matrix only has 180 transitions (discarded 82 similar events)
[2024-05-31 21:14:50] [INFO ] Invariant cache hit.
[2024-05-31 21:14:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:14:51] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-31 21:14:51] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-31 21:14:51] [INFO ] Flow matrix only has 180 transitions (discarded 82 similar events)
[2024-05-31 21:14:51] [INFO ] Invariant cache hit.
[2024-05-31 21:14:51] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 180/290 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 43/155 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 155 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 180/290 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 43/155 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 260/415 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 415 constraints, problems are : Problem set: 0 solved, 260 unsolved in 7896 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 14732ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 14736ms
Starting structural reductions in SI_LTL mode, iteration 1 : 110/171 places, 262/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15007 ms. Remains : 110/171 places, 262/420 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-05
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-05 finished in 15066 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((p0||G(p1))))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 420
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 159 transition count 394
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 159 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 159 transition count 392
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 151 transition count 374
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 151 transition count 374
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 47 place count 144 transition count 354
Iterating global reduction 2 with 7 rules applied. Total rules applied 54 place count 144 transition count 354
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 137 transition count 330
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 137 transition count 330
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 130 transition count 312
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 130 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 124 transition count 294
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 118 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 118 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 112 transition count 266
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 112 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 106 transition count 254
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 134 place count 102 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 102 transition count 246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 99 transition count 240
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 97 transition count 236
Applied a total of 148 rules in 20 ms. Remains 97 /171 variables (removed 74) and now considering 236/420 (removed 184) transitions.
[2024-05-31 21:15:05] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-31 21:15:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:15:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 21:15:05] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 21:15:05] [INFO ] Invariant cache hit.
[2024-05-31 21:15:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:15:06] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-31 21:15:06] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 21:15:06] [INFO ] Invariant cache hit.
[2024-05-31 21:15:06] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5418 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 370 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6445 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 12008ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 12011ms
Starting structural reductions in LTL mode, iteration 1 : 97/171 places, 236/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12223 ms. Remains : 97/171 places, 236/420 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b128-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b128-LTLCardinality-09 finished in 12770 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(p0)||G(p1))))'
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 420
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 159 transition count 394
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 159 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 159 transition count 392
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 151 transition count 374
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 151 transition count 374
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 47 place count 144 transition count 354
Iterating global reduction 2 with 7 rules applied. Total rules applied 54 place count 144 transition count 354
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 137 transition count 330
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 137 transition count 330
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 130 transition count 312
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 130 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 124 transition count 294
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 118 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 118 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 112 transition count 266
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 112 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 106 transition count 254
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 134 place count 102 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 102 transition count 246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 99 transition count 240
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 97 transition count 236
Applied a total of 148 rules in 21 ms. Remains 97 /171 variables (removed 74) and now considering 236/420 (removed 184) transitions.
[2024-05-31 21:15:18] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 21:15:18] [INFO ] Invariant cache hit.
[2024-05-31 21:15:18] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 21:15:18] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 21:15:18] [INFO ] Invariant cache hit.
[2024-05-31 21:15:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:15:18] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-31 21:15:18] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 21:15:18] [INFO ] Invariant cache hit.
[2024-05-31 21:15:18] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5576 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 370 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6499 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 12244ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 12251ms
Starting structural reductions in LTL mode, iteration 1 : 97/171 places, 236/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12472 ms. Remains : 97/171 places, 236/420 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-12 finished in 12649 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))))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 420
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 160 transition count 396
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 160 transition count 396
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 160 transition count 394
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 153 transition count 380
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 153 transition count 380
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 147 transition count 362
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 147 transition count 362
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 141 transition count 342
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 141 transition count 342
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 135 transition count 328
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 135 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 130 transition count 312
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 130 transition count 312
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 126 transition count 300
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 126 transition count 300
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 122 transition count 292
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 102 place count 118 transition count 284
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 118 transition count 284
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 115 transition count 278
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 115 transition count 278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 112 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 112 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 110 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 110 transition count 268
Applied a total of 122 rules in 19 ms. Remains 110 /171 variables (removed 61) and now considering 268/420 (removed 152) transitions.
[2024-05-31 21:15:31] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 110 cols
[2024-05-31 21:15:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:15:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 21:15:31] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
[2024-05-31 21:15:31] [INFO ] Invariant cache hit.
[2024-05-31 21:15:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:15:31] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-05-31 21:15:31] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
[2024-05-31 21:15:31] [INFO ] Invariant cache hit.
[2024-05-31 21:15:31] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 184/294 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 42/154 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 154 constraints, problems are : Problem set: 0 solved, 266 unsolved in 6690 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 184/294 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 42/154 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 266/420 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 420 constraints, problems are : Problem set: 0 solved, 266 unsolved in 8054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
After SMT, in 14927ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 14929ms
Starting structural reductions in LTL mode, iteration 1 : 110/171 places, 268/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15202 ms. Remains : 110/171 places, 268/420 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-15
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-15 finished in 15318 ms.
All properties solved by simple procedures.
Total runtime 175369 ms.
ITS solved all properties within timeout

BK_STOP 1717190146667

--------------------
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

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="FunctionPointer-PT-b128"
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 FunctionPointer-PT-b128, 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 r496-tall-171640603000267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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