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.r179-tall-171640601100227.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 greatspnxred
Input is FunctionPointer-PT-b004, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601100227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 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-b004-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b004-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716431673189

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:34:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:34:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:34:34] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-23 02:34:34] [INFO ] Transformed 306 places.
[2024-05-23 02:34:34] [INFO ] Transformed 840 transitions.
[2024-05-23 02:34:34] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 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 508
Iterating global reduction 1 with 24 rules applied. Total rules applied 56 place count 190 transition count 508
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 92 place count 190 transition count 472
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 104 place count 178 transition count 448
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 178 transition count 448
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 124 place count 178 transition count 440
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 128 place count 174 transition count 432
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 174 transition count 432
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 136 place count 170 transition count 416
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 170 transition count 416
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 144 place count 166 transition count 408
Iterating global reduction 3 with 4 rules applied. Total rules applied 148 place count 166 transition count 408
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 151 place count 163 transition count 396
Iterating global reduction 3 with 3 rules applied. Total rules applied 154 place count 163 transition count 396
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 156 place count 161 transition count 388
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 161 transition count 388
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 160 transition count 386
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 160 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 159 transition count 384
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 159 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 158 transition count 382
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 158 transition count 382
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 157 transition count 380
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 157 transition count 380
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 156 transition count 378
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 156 transition count 378
Applied a total of 168 rules in 112 ms. Remains 156 /222 variables (removed 66) and now considering 378/648 (removed 270) transitions.
[2024-05-23 02:34:34] [INFO ] Flow matrix only has 263 transitions (discarded 115 similar events)
// Phase 1: matrix 263 rows 156 cols
[2024-05-23 02:34:34] [INFO ] Computed 2 invariants in 19 ms
[2024-05-23 02:34:35] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-23 02:34:35] [INFO ] Flow matrix only has 263 transitions (discarded 115 similar events)
[2024-05-23 02:34:35] [INFO ] Invariant cache hit.
[2024-05-23 02:34:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-23 02:34:35] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2024-05-23 02:34:35] [INFO ] Flow matrix only has 263 transitions (discarded 115 similar events)
[2024-05-23 02:34:35] [INFO ] Invariant cache hit.
[2024-05-23 02:34:35] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (OVERLAPS) 263/417 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 58/214 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 376 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/419 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 8 (OVERLAPS) 0/419 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 376 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 216 constraints, problems are : Problem set: 0 solved, 376 unsolved in 13671 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (OVERLAPS) 263/417 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 58/214 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 32/246 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (OVERLAPS) 2/419 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 344/592 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 10 (OVERLAPS) 0/419 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 376 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 592 constraints, problems are : Problem set: 0 solved, 376 unsolved in 18568 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
After SMT, in 32785ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 32804ms
Starting structural reductions in LTL mode, iteration 1 : 156/222 places, 378/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33558 ms. Remains : 156/222 places, 378/648 transitions.
Support contains 18 out of 156 places after structural reductions.
[2024-05-23 02:35:08] [INFO ] Flatten gal took : 74 ms
[2024-05-23 02:35:08] [INFO ] Flatten gal took : 24 ms
[2024-05-23 02:35:08] [INFO ] Input system was already deterministic with 378 transitions.
RANDOM walk for 27629 steps (33 resets) in 895 ms. (30 steps per ms) remains 0/10 properties
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 829 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 378/378 transitions.
Graph (complete) has 829 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 147 transition count 360
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 147 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 147 transition count 358
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 141 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 141 transition count 346
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 135 transition count 332
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 135 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 129 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 129 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 123 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 123 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 118 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 118 transition count 284
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 115 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 115 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 112 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 112 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 109 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 109 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 107 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 107 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 105 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 105 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 103 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 103 transition count 250
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 109 place count 103 transition count 246
Applied a total of 109 rules in 85 ms. Remains 103 /156 variables (removed 53) and now considering 246/378 (removed 132) transitions.
[2024-05-23 02:35:09] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 103 cols
[2024-05-23 02:35:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:35:09] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-23 02:35:09] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2024-05-23 02:35:09] [INFO ] Invariant cache hit.
[2024-05-23 02:35:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 02:35:09] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-23 02:35:09] [INFO ] Redundant transitions in 10 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-23 02:35:09] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2024-05-23 02:35:09] [INFO ] Invariant cache hit.
[2024-05-23 02:35:09] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/271 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 145 constraints, problems are : Problem set: 0 solved, 244 unsolved in 5570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/271 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 244/389 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 389 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6605 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 12395ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 12399ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/156 places, 246/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12760 ms. Remains : 103/156 places, 246/378 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-00
Stuttering criterion allowed to conclude after 3237 steps with 21 reset in 20 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLCardinality-00 finished in 13003 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 U p1))))'
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 378/378 transitions.
Graph (complete) has 829 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 149 transition count 368
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 149 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 15 place count 149 transition count 364
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 145 transition count 356
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 145 transition count 356
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 141 transition count 348
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 141 transition count 348
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 137 transition count 334
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 137 transition count 334
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 133 transition count 326
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 133 transition count 326
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 130 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 130 transition count 314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 127 transition count 302
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 127 transition count 302
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 125 transition count 298
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 125 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 123 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 123 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 121 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 121 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 119 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 119 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 117 transition count 282
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 117 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 117 transition count 276
Applied a total of 85 rules in 53 ms. Remains 117 /156 variables (removed 39) and now considering 276/378 (removed 102) transitions.
[2024-05-23 02:35:22] [INFO ] Flow matrix only has 191 transitions (discarded 85 similar events)
// Phase 1: matrix 191 rows 117 cols
[2024-05-23 02:35:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:35:22] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-23 02:35:22] [INFO ] Flow matrix only has 191 transitions (discarded 85 similar events)
[2024-05-23 02:35:22] [INFO ] Invariant cache hit.
[2024-05-23 02:35:22] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-23 02:35:22] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-23 02:35:22] [INFO ] Redundant transitions in 6 ms returned []
Running 274 sub problems to find dead transitions.
[2024-05-23 02:35:22] [INFO ] Flow matrix only has 191 transitions (discarded 85 similar events)
[2024-05-23 02:35:22] [INFO ] Invariant cache hit.
[2024-05-23 02:35:22] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 191/308 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 46/165 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 274 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/308 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 165 constraints, problems are : Problem set: 0 solved, 274 unsolved in 6852 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 191/308 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 46/165 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 274/439 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 439 constraints, problems are : Problem set: 0 solved, 274 unsolved in 7954 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
After SMT, in 15044ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 15048ms
Starting structural reductions in SI_LTL mode, iteration 1 : 117/156 places, 276/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15376 ms. Remains : 117/156 places, 276/378 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-02
Stuttering criterion allowed to conclude after 16619 steps with 98 reset in 70 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLCardinality-02 finished in 15565 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)))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 378/378 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 154 transition count 378
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 148 transition count 362
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 148 transition count 362
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 148 transition count 360
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 143 transition count 350
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 143 transition count 350
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 138 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 138 transition count 338
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 133 transition count 320
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 133 transition count 320
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 128 transition count 310
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 128 transition count 310
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 123 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 123 transition count 294
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 119 transition count 280
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 119 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 115 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 115 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 111 transition count 264
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 111 transition count 264
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 108 transition count 258
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 108 transition count 258
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 105 transition count 252
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 105 transition count 252
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 102 transition count 246
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 102 transition count 246
Applied a total of 108 rules in 19 ms. Remains 102 /156 variables (removed 54) and now considering 246/378 (removed 132) transitions.
[2024-05-23 02:35:37] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 102 cols
[2024-05-23 02:35:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:35:37] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 02:35:37] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2024-05-23 02:35:37] [INFO ] Invariant cache hit.
[2024-05-23 02:35:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 02:35:37] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 244 sub problems to find dead transitions.
[2024-05-23 02:35:37] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2024-05-23 02:35:37] [INFO ] Invariant cache hit.
[2024-05-23 02:35:37] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/270 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 144 constraints, problems are : Problem set: 0 solved, 244 unsolved in 5358 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/270 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 244/388 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/270 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 388 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 11861ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 11865ms
Starting structural reductions in LTL mode, iteration 1 : 102/156 places, 246/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12116 ms. Remains : 102/156 places, 246/378 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLCardinality-06 finished in 12214 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)))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 378/378 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 155 transition count 378
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 150 transition count 364
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 150 transition count 364
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 145 transition count 354
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 145 transition count 354
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 140 transition count 342
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 140 transition count 342
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 135 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 135 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 130 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 130 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 127 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 127 transition count 306
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 124 transition count 296
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 124 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 121 transition count 290
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 121 transition count 290
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 118 transition count 284
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 118 transition count 284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 116 transition count 280
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 116 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 114 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 114 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 112 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 112 transition count 272
Applied a total of 87 rules in 18 ms. Remains 112 /156 variables (removed 44) and now considering 272/378 (removed 106) transitions.
[2024-05-23 02:35:49] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
// Phase 1: matrix 186 rows 112 cols
[2024-05-23 02:35:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:35:49] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-23 02:35:49] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-23 02:35:49] [INFO ] Invariant cache hit.
[2024-05-23 02:35:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 02:35:50] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-23 02:35:50] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-23 02:35:50] [INFO ] Invariant cache hit.
[2024-05-23 02:35:50] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/298 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 0/298 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 157 constraints, problems are : Problem set: 0 solved, 270 unsolved in 7065 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 32/188 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 238/427 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 427 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 17387ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 17391ms
Starting structural reductions in LTL mode, iteration 1 : 112/156 places, 272/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17645 ms. Remains : 112/156 places, 272/378 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 605 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b004-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b004-LTLCardinality-09 finished in 18217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&G((p1 U X(p1)))))))))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 378/378 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 155 transition count 378
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 149 transition count 362
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 149 transition count 362
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 149 transition count 360
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 20 place count 144 transition count 350
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 144 transition count 350
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 139 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 139 transition count 338
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 40 place count 134 transition count 322
Iterating global reduction 2 with 5 rules applied. Total rules applied 45 place count 134 transition count 322
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 129 transition count 312
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 129 transition count 312
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 125 transition count 300
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 125 transition count 300
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 122 transition count 290
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 122 transition count 290
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 119 transition count 284
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 119 transition count 284
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 116 transition count 278
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 116 transition count 278
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 115 transition count 276
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 115 transition count 276
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 114 transition count 274
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 114 transition count 274
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 113 transition count 272
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 113 transition count 272
Applied a total of 87 rules in 19 ms. Remains 113 /156 variables (removed 43) and now considering 272/378 (removed 106) transitions.
[2024-05-23 02:36:08] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
// Phase 1: matrix 187 rows 113 cols
[2024-05-23 02:36:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:36:08] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 02:36:08] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
[2024-05-23 02:36:08] [INFO ] Invariant cache hit.
[2024-05-23 02:36:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 02:36:08] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-23 02:36:08] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
[2024-05-23 02:36:08] [INFO ] Invariant cache hit.
[2024-05-23 02:36:08] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 187/299 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 43/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/300 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 158 constraints, problems are : Problem set: 0 solved, 270 unsolved in 7143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 187/299 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 43/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 32/189 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/300 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 238/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/300 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 428 constraints, problems are : Problem set: 0 solved, 270 unsolved in 9999 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 17327ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 17330ms
Starting structural reductions in LTL mode, iteration 1 : 113/156 places, 272/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17594 ms. Remains : 113/156 places, 272/378 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-10
Stuttering criterion allowed to conclude after 408 steps with 0 reset in 8 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLCardinality-10 finished in 17837 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||G(p1))))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 378/378 transitions.
Graph (complete) has 829 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 150 transition count 364
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 150 transition count 364
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 150 transition count 362
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 146 transition count 354
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 146 transition count 354
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 142 transition count 344
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 142 transition count 344
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 138 transition count 332
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 138 transition count 332
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 134 transition count 324
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 134 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 131 transition count 316
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 131 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 129 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 129 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 127 transition count 306
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 127 transition count 306
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 125 transition count 302
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 125 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 124 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 124 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 123 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 123 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 122 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 122 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 122 transition count 290
Applied a total of 75 rules in 53 ms. Remains 122 /156 variables (removed 34) and now considering 290/378 (removed 88) transitions.
[2024-05-23 02:36:25] [INFO ] Flow matrix only has 200 transitions (discarded 90 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-23 02:36:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:36:26] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-23 02:36:26] [INFO ] Flow matrix only has 200 transitions (discarded 90 similar events)
[2024-05-23 02:36:26] [INFO ] Invariant cache hit.
[2024-05-23 02:36:26] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 02:36:26] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-23 02:36:26] [INFO ] Redundant transitions in 4 ms returned []
Running 288 sub problems to find dead transitions.
[2024-05-23 02:36:26] [INFO ] Flow matrix only has 200 transitions (discarded 90 similar events)
[2024-05-23 02:36:26] [INFO ] Invariant cache hit.
[2024-05-23 02:36:26] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 200/321 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 45/168 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 288 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/322 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 0/322 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 169 constraints, problems are : Problem set: 0 solved, 288 unsolved in 7959 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 45/45 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/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 200/321 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 45/168 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 32/200 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 256/457 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 457 constraints, problems are : Problem set: 0 solved, 288 unsolved in 12479 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 20670ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 20673ms
Starting structural reductions in SI_LTL mode, iteration 1 : 122/156 places, 290/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21036 ms. Remains : 122/156 places, 290/378 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-11
Stuttering criterion allowed to conclude after 42 steps with 1 reset in 4 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLCardinality-11 finished in 21101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 378/378 transitions.
Graph (complete) has 829 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 147 transition count 360
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 147 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 147 transition count 358
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 141 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 141 transition count 346
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 135 transition count 332
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 135 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 129 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 129 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 123 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 123 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 118 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 118 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 114 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 114 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 110 transition count 262
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 110 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 95 place count 106 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 99 place count 106 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 103 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 103 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 100 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 97 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 97 transition count 234
Applied a total of 119 rules in 34 ms. Remains 97 /156 variables (removed 59) and now considering 234/378 (removed 144) transitions.
[2024-05-23 02:36:47] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-23 02:36:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:36:47] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 02:36:47] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 02:36:47] [INFO ] Invariant cache hit.
[2024-05-23 02:36:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 02:36:47] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-23 02:36:47] [INFO ] Redundant transitions in 2 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-23 02:36:47] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 02:36:47] [INFO ] Invariant cache hit.
[2024-05-23 02:36:47] [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, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 232 unsolved in 4947 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: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 232/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 368 constraints, problems are : Problem set: 0 solved, 232 unsolved in 5901 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: 232/232 constraints, Known Traps: 0/0 constraints]
After SMT, in 11007ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 11009ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/156 places, 234/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11236 ms. Remains : 97/156 places, 234/378 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-14
Stuttering criterion allowed to conclude after 4982 steps with 39 reset in 19 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLCardinality-14 finished in 11365 ms.
All properties solved by simple procedures.
Total runtime 144053 ms.
ITS solved all properties within timeout

BK_STOP 1716431818411

--------------------
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-b004"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FunctionPointer-PT-b004, 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 r179-tall-171640601100227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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