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-171640602900228.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-b004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602900228
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717188135105

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:42:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:42:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:42:16] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-31 20:42:16] [INFO ] Transformed 306 places.
[2024-05-31 20:42:16] [INFO ] Transformed 840 transitions.
[2024-05-31 20:42:16] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b004-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 37 place count 185 transition count 516
Iterating global reduction 1 with 27 rules applied. Total rules applied 64 place count 185 transition count 516
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 114 place count 185 transition count 466
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 127 place count 172 transition count 440
Iterating global reduction 2 with 13 rules applied. Total rules applied 140 place count 172 transition count 440
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 152 place count 172 transition count 428
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 157 place count 167 transition count 418
Iterating global reduction 3 with 5 rules applied. Total rules applied 162 place count 167 transition count 418
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 166 place count 163 transition count 402
Iterating global reduction 3 with 4 rules applied. Total rules applied 170 place count 163 transition count 402
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 173 place count 160 transition count 396
Iterating global reduction 3 with 3 rules applied. Total rules applied 176 place count 160 transition count 396
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 159 transition count 392
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 159 transition count 392
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 158 transition count 388
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 158 transition count 388
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 157 transition count 386
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 157 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 156 transition count 384
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 156 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 155 transition count 382
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 155 transition count 382
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 154 transition count 380
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 154 transition count 380
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 189 place count 153 transition count 378
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 153 transition count 378
Applied a total of 190 rules in 113 ms. Remains 153 /222 variables (removed 69) and now considering 378/648 (removed 270) transitions.
[2024-05-31 20:42:16] [INFO ] Flow matrix only has 259 transitions (discarded 119 similar events)
// Phase 1: matrix 259 rows 153 cols
[2024-05-31 20:42:16] [INFO ] Computed 2 invariants in 18 ms
[2024-05-31 20:42:17] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-31 20:42:17] [INFO ] Flow matrix only has 259 transitions (discarded 119 similar events)
[2024-05-31 20:42:17] [INFO ] Invariant cache hit.
[2024-05-31 20:42:17] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-31 20:42:17] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2024-05-31 20:42:17] [INFO ] Flow matrix only has 259 transitions (discarded 119 similar events)
[2024-05-31 20:42:17] [INFO ] Invariant cache hit.
[2024-05-31 20:42:17] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (OVERLAPS) 259/412 variables, 153/155 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 376 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/412 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 376 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 211 constraints, problems are : Problem set: 0 solved, 376 unsolved in 12382 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 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/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (OVERLAPS) 259/412 variables, 153/155 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 376/587 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (OVERLAPS) 0/412 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 376 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 587 constraints, problems are : Problem set: 0 solved, 376 unsolved in 14889 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
After SMT, in 27882ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 27904ms
Starting structural reductions in LTL mode, iteration 1 : 153/222 places, 378/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28627 ms. Remains : 153/222 places, 378/648 transitions.
Support contains 23 out of 153 places after structural reductions.
[2024-05-31 20:42:45] [INFO ] Flatten gal took : 50 ms
[2024-05-31 20:42:45] [INFO ] Flatten gal took : 25 ms
[2024-05-31 20:42:45] [INFO ] Input system was already deterministic with 378 transitions.
Support contains 21 out of 153 places (down from 23) after GAL structural reductions.
RANDOM walk for 40005 steps (65 resets) in 997 ms. (40 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40002 steps (17 resets) in 120 ms. (330 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (15 resets) in 122 ms. (325 steps per ms) remains 1/2 properties
BEST_FIRST walk for 23328 steps (10 resets) in 49 ms. (466 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-b004-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 64 stable transitions
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)||X(((G(p1)||X(p3))&&p2)))))'
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 378/378 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 148 transition count 366
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 148 transition count 366
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 143 transition count 354
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 143 transition count 354
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 138 transition count 334
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 138 transition count 334
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 133 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 133 transition count 318
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 128 transition count 306
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 128 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 123 transition count 294
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 118 transition count 284
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 118 transition count 284
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 113 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 113 transition count 274
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 109 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 108 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 107 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 107 transition count 262
Applied a total of 92 rules in 28 ms. Remains 107 /153 variables (removed 46) and now considering 262/378 (removed 116) transitions.
[2024-05-31 20:42:46] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
// Phase 1: matrix 178 rows 107 cols
[2024-05-31 20:42:46] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:42:46] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-31 20:42:46] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2024-05-31 20:42:46] [INFO ] Invariant cache hit.
[2024-05-31 20:42:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:42:46] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-31 20:42:46] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2024-05-31 20:42:46] [INFO ] Invariant cache hit.
[2024-05-31 20:42:46] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 149 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6322 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 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/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 260/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 409 constraints, problems are : Problem set: 0 solved, 260 unsolved in 7489 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 14057ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 14060ms
Starting structural reductions in LTL mode, iteration 1 : 107/153 places, 262/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14347 ms. Remains : 107/153 places, 262/378 transitions.
Stuttering acceptance computed with spot in 426 ms :[true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-01 finished in 14846 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((G(p0)||G(F(p1))))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 378/378 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 147 transition count 364
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 147 transition count 364
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 141 transition count 348
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 141 transition count 348
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 135 transition count 326
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 135 transition count 326
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 129 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 129 transition count 306
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 123 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 123 transition count 290
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 117 transition count 276
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 117 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 111 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 111 transition count 264
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 105 transition count 252
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 105 transition count 252
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 100 place count 101 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 104 place count 101 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 100 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 100 transition count 242
Applied a total of 106 rules in 19 ms. Remains 100 /153 variables (removed 53) and now considering 242/378 (removed 136) transitions.
[2024-05-31 20:43:01] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
// Phase 1: matrix 165 rows 100 cols
[2024-05-31 20:43:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:43:01] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 20:43:01] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
[2024-05-31 20:43:01] [INFO ] Invariant cache hit.
[2024-05-31 20:43:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 20:43:01] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-31 20:43:01] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
[2024-05-31 20:43:01] [INFO ] Invariant cache hit.
[2024-05-31 20:43:01] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 165/265 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 39/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 141 constraints, problems are : Problem set: 0 solved, 240 unsolved in 5447 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 165/265 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 39/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 240/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 381 constraints, problems are : Problem set: 0 solved, 240 unsolved in 6457 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
After SMT, in 12114ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 12117ms
Starting structural reductions in LTL mode, iteration 1 : 100/153 places, 242/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12371 ms. Remains : 100/153 places, 242/378 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-04
Stuttering criterion allowed to conclude after 474 steps with 1 reset in 7 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-04 finished in 12599 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 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 378/378 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 148 transition count 366
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 148 transition count 366
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 143 transition count 352
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 143 transition count 352
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 138 transition count 334
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 138 transition count 334
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 133 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 133 transition count 316
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 128 transition count 304
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 128 transition count 304
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 123 transition count 294
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 118 transition count 284
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 118 transition count 284
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 113 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 113 transition count 274
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 109 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 108 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 108 transition count 264
Applied a total of 90 rules in 28 ms. Remains 108 /153 variables (removed 45) and now considering 264/378 (removed 114) transitions.
[2024-05-31 20:43:13] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
// Phase 1: matrix 179 rows 108 cols
[2024-05-31 20:43:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:43:14] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-31 20:43:14] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2024-05-31 20:43:14] [INFO ] Invariant cache hit.
[2024-05-31 20:43:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 20:43:14] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-31 20:43:14] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2024-05-31 20:43:14] [INFO ] Invariant cache hit.
[2024-05-31 20:43:14] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 179/287 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 151 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6528 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 179/287 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 262/413 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 413 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 15349ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 15351ms
Starting structural reductions in LTL mode, iteration 1 : 108/153 places, 264/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15978 ms. Remains : 108/153 places, 264/378 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-06
Stuttering criterion allowed to conclude after 886 steps with 1 reset in 11 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-06 finished in 16068 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 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 378/378 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 147 transition count 364
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 147 transition count 364
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 141 transition count 348
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 141 transition count 348
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 135 transition count 326
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 135 transition count 326
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 129 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 129 transition count 306
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 123 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 123 transition count 290
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 117 transition count 276
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 117 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 111 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 111 transition count 264
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 105 transition count 252
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 105 transition count 252
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 101 place count 100 transition count 242
Iterating global reduction 0 with 5 rules applied. Total rules applied 106 place count 100 transition count 242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 97 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 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 0 with 2 rules applied. Total rules applied 114 place count 97 transition count 234
Applied a total of 114 rules in 103 ms. Remains 97 /153 variables (removed 56) and now considering 234/378 (removed 144) transitions.
[2024-05-31 20:43:29] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-31 20:43:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:43:30] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-31 20:43:30] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:43:30] [INFO ] Invariant cache hit.
[2024-05-31 20:43:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:43:30] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-05-31 20:43:30] [INFO ] Redundant transitions in 8 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 20:43:30] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:43:30] [INFO ] Invariant cache hit.
[2024-05-31 20:43:30] [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 5097 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 6444 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 11717ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 11720ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/153 places, 234/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12350 ms. Remains : 97/153 places, 234/378 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-07
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-07 finished in 12407 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||F(G(p0)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 378/378 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 147 transition count 364
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 147 transition count 364
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 141 transition count 348
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 141 transition count 348
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 135 transition count 326
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 135 transition count 326
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 129 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 129 transition count 306
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 123 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 123 transition count 290
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 117 transition count 276
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 117 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 111 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 111 transition count 264
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 105 transition count 252
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 105 transition count 252
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 101 place count 100 transition count 242
Iterating global reduction 0 with 5 rules applied. Total rules applied 106 place count 100 transition count 242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 97 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 97 transition count 236
Applied a total of 112 rules in 19 ms. Remains 97 /153 variables (removed 56) and now considering 236/378 (removed 142) transitions.
[2024-05-31 20:43:42] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-31 20:43:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:43:42] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-31 20:43:42] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 20:43:42] [INFO ] Invariant cache hit.
[2024-05-31 20:43:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:43:42] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-31 20:43:42] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 20:43:42] [INFO ] Invariant cache hit.
[2024-05-31 20:43:42] [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
All remaining problems are real, not stopping.
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 5251 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 6128 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 11561ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 11563ms
Starting structural reductions in LTL mode, iteration 1 : 97/153 places, 236/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11962 ms. Remains : 97/153 places, 236/378 transitions.
Stuttering acceptance computed with spot in 104 ms :[false, (NOT p0), false]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-08
Product exploration explored 100000 steps with 300 reset in 243 ms.
Product exploration explored 100000 steps with 283 reset in 227 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 19827 steps (26 resets) in 113 ms. (173 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 236/236 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 97 transition count 234
Applied a total of 2 rules in 31 ms. Remains 97 /97 variables (removed 0) and now considering 234/236 (removed 2) transitions.
[2024-05-31 20:43:55] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-31 20:43:55] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:43:55] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 20:43:55] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:43:55] [INFO ] Invariant cache hit.
[2024-05-31 20:43:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:43:55] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-31 20:43:55] [INFO ] Redundant transitions in 12 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 20:43:55] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:43:55] [INFO ] Invariant cache hit.
[2024-05-31 20:43:55] [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 4930 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 5889 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 11000ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 11003ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/97 places, 234/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11255 ms. Remains : 97/97 places, 234/236 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 8145 steps (10 resets) in 27 ms. (290 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 493 reset in 172 ms.
Product exploration explored 100000 steps with 476 reset in 297 ms.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 234/234 transitions.
Applied a total of 0 rules in 8 ms. Remains 97 /97 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-05-31 20:44:07] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:44:07] [INFO ] Invariant cache hit.
[2024-05-31 20:44:07] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 20:44:07] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:44:07] [INFO ] Invariant cache hit.
[2024-05-31 20:44:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:44:07] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-31 20:44:07] [INFO ] Redundant transitions in 15 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 20:44:07] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:44:07] [INFO ] Invariant cache hit.
[2024-05-31 20:44:07] [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 4974 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 5999 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 11114ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 11116ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11345 ms. Remains : 97/97 places, 234/234 transitions.
Treatment of property FunctionPointer-PT-b004-LTLFireability-08 finished in 36499 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))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 378/378 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 148 transition count 368
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 148 transition count 368
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 143 transition count 354
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 143 transition count 354
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 138 transition count 336
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 138 transition count 336
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 133 transition count 320
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 133 transition count 320
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 128 transition count 306
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 128 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 123 transition count 294
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 118 transition count 284
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 118 transition count 284
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 113 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 113 transition count 274
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 109 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 109 transition count 266
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 107 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 106 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 106 transition count 260
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 98 place count 106 transition count 256
Applied a total of 98 rules in 38 ms. Remains 106 /153 variables (removed 47) and now considering 256/378 (removed 122) transitions.
[2024-05-31 20:44:18] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2024-05-31 20:44:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:44:18] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 20:44:18] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 20:44:18] [INFO ] Invariant cache hit.
[2024-05-31 20:44:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:44:18] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-31 20:44:18] [INFO ] Redundant transitions in 2 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-31 20:44:18] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 20:44:18] [INFO ] Invariant cache hit.
[2024-05-31 20:44:18] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 6003 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 402 constraints, problems are : Problem set: 0 solved, 254 unsolved in 7140 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 13324ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 13326ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/153 places, 256/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13565 ms. Remains : 106/153 places, 256/378 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-09
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-09 finished in 13636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G((p1||F(p2))))))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 378/378 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 148 transition count 366
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 148 transition count 366
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 143 transition count 352
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 143 transition count 352
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 139 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 139 transition count 338
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 135 transition count 326
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 135 transition count 326
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 132 transition count 318
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 132 transition count 318
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 129 transition count 310
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 129 transition count 310
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 126 transition count 304
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 126 transition count 304
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 123 transition count 298
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 123 transition count 298
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 121 transition count 294
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 121 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 120 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 120 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 119 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 119 transition count 290
Applied a total of 68 rules in 19 ms. Remains 119 /153 variables (removed 34) and now considering 290/378 (removed 88) transitions.
[2024-05-31 20:44:32] [INFO ] Flow matrix only has 198 transitions (discarded 92 similar events)
// Phase 1: matrix 198 rows 119 cols
[2024-05-31 20:44:32] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:44:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 20:44:32] [INFO ] Flow matrix only has 198 transitions (discarded 92 similar events)
[2024-05-31 20:44:32] [INFO ] Invariant cache hit.
[2024-05-31 20:44:32] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-31 20:44:32] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-31 20:44:32] [INFO ] Flow matrix only has 198 transitions (discarded 92 similar events)
[2024-05-31 20:44:32] [INFO ] Invariant cache hit.
[2024-05-31 20:44:32] [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) 198/317 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 46/167 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 288 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/317 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 167 constraints, problems are : Problem set: 0 solved, 288 unsolved in 7346 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 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) 198/317 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 46/167 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 288/455 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 455 constraints, problems are : Problem set: 0 solved, 288 unsolved in 9241 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 16834ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 16837ms
Starting structural reductions in LTL mode, iteration 1 : 119/153 places, 290/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17085 ms. Remains : 119/153 places, 290/378 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-10
Stuttering criterion allowed to conclude after 202 steps with 0 reset in 5 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-10 finished in 17260 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((X(F(p1))||p0))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 378/378 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 148 transition count 366
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 148 transition count 366
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 143 transition count 354
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 143 transition count 354
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 138 transition count 336
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 138 transition count 336
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 133 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 133 transition count 318
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 128 transition count 304
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 128 transition count 304
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 123 transition count 292
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 123 transition count 292
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 118 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 113 transition count 272
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 113 transition count 272
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 108 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 108 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 106 transition count 258
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 105 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 105 transition count 256
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 100 place count 105 transition count 252
Applied a total of 100 rules in 28 ms. Remains 105 /153 variables (removed 48) and now considering 252/378 (removed 126) transitions.
[2024-05-31 20:44:49] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2024-05-31 20:44:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:44:49] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 20:44:49] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 20:44:49] [INFO ] Invariant cache hit.
[2024-05-31 20:44:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:44:49] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-31 20:44:49] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 20:44:49] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 20:44:49] [INFO ] Invariant cache hit.
[2024-05-31 20:44:49] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 147 constraints, problems are : Problem set: 0 solved, 250 unsolved in 5755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 250/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 397 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6827 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 12746ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 12748ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/153 places, 252/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13031 ms. Remains : 105/153 places, 252/378 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-11
Product exploration explored 100000 steps with 490 reset in 234 ms.
Product exploration explored 100000 steps with 507 reset in 230 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40002 steps (87 resets) in 113 ms. (350 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
[2024-05-31 20:45:03] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 20:45:03] [INFO ] Invariant cache hit.
[2024-05-31 20:45:03] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/171 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 252/276 variables, and 108 constraints, problems are : Problem set: 1 solved, 0 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 87/105 constraints, ReadFeed: 20/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 12 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b004-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b004-LTLFireability-11 finished in 14009 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 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 378/378 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 147 transition count 364
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 147 transition count 364
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 141 transition count 348
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 141 transition count 348
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 135 transition count 326
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 135 transition count 326
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 129 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 129 transition count 306
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 123 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 123 transition count 290
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 117 transition count 276
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 117 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 111 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 111 transition count 264
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 105 transition count 252
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 105 transition count 252
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 101 place count 100 transition count 242
Iterating global reduction 0 with 5 rules applied. Total rules applied 106 place count 100 transition count 242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 97 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 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 0 with 2 rules applied. Total rules applied 114 place count 97 transition count 234
Applied a total of 114 rules in 30 ms. Remains 97 /153 variables (removed 56) and now considering 234/378 (removed 144) transitions.
[2024-05-31 20:45:03] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-31 20:45:03] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:45:03] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 20:45:03] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:45:03] [INFO ] Invariant cache hit.
[2024-05-31 20:45:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:45:03] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-31 20:45:03] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 20:45:03] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:45:03] [INFO ] Invariant cache hit.
[2024-05-31 20:45:03] [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 4884 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 5779 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 10820ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 10822ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/153 places, 234/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11049 ms. Remains : 97/153 places, 234/378 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-14
Product exploration explored 100000 steps with 477 reset in 175 ms.
Stack based approach found an accepted trace after 28129 steps with 146 reset with depth 18 and stack size 18 in 50 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-14 finished in 11334 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||F(G(p0)))))'
[2024-05-31 20:45:15] [INFO ] Flatten gal took : 49 ms
[2024-05-31 20:45:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 20:45:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 153 places, 378 transitions and 1526 arcs took 10 ms.
Total runtime 178994 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-b004-LTLFireability-08

BK_STOP 1717188326662

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-b004-LTLFireability-08
ltl formula formula --ltl=/tmp/913/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 153 places, 378 transitions and 1526 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/913/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/913/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/913/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/913/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 154 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 154, there are 387 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~59772 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~119772 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~315236 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~630812 transitions
pnml2lts-mc( 2/ 4): ~40000 levels ~160000 states ~1261932 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~1919772 transitions
pnml2lts-mc( 0/ 4): ~160000 levels ~640000 states ~3839772 transitions
pnml2lts-mc( 0/ 4): ~320000 levels ~1280000 states ~7679772 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1861704
pnml2lts-mc( 0/ 4): unique transitions count: 14218427
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 458644
pnml2lts-mc( 0/ 4): - claim success count: 1861709
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1861709
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1861709 states 14218443 transitions, fanout: 7.637
pnml2lts-mc( 0/ 4): Total exploration time 10.500 sec (10.460 sec minimum, 10.485 sec on average)
pnml2lts-mc( 0/ 4): States per second: 177306, Transitions per second: 1354137
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 115.3MB, 18.0 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 115.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b004"
export BK_EXAMINATION="LTLFireability"
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-b004, examination is LTLFireability"
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-171640602900228"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;