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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K 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-b002-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717187719193

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-b002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:35:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:35:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:35:20] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-31 20:35:20] [INFO ] Transformed 306 places.
[2024-05-31 20:35:20] [INFO ] Transformed 840 transitions.
[2024-05-31 20:35:20] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 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.
FORMULA FunctionPointer-PT-b002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-10 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 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 34 place count 188 transition count 538
Iterating global reduction 1 with 24 rules applied. Total rules applied 58 place count 188 transition count 538
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 112 place count 188 transition count 484
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 122 place count 178 transition count 464
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 178 transition count 464
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 148 place count 178 transition count 448
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 152 place count 174 transition count 440
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 174 transition count 440
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 160 place count 170 transition count 424
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 170 transition count 424
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 167 place count 167 transition count 418
Iterating global reduction 3 with 3 rules applied. Total rules applied 170 place count 167 transition count 418
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 166 transition count 414
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 166 transition count 414
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 165 transition count 410
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 165 transition count 410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 164 transition count 408
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 164 transition count 408
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 163 transition count 406
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 163 transition count 406
Applied a total of 178 rules in 109 ms. Remains 163 /222 variables (removed 59) and now considering 406/648 (removed 242) transitions.
[2024-05-31 20:35:20] [INFO ] Flow matrix only has 278 transitions (discarded 128 similar events)
// Phase 1: matrix 278 rows 163 cols
[2024-05-31 20:35:20] [INFO ] Computed 2 invariants in 18 ms
[2024-05-31 20:35:21] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-31 20:35:21] [INFO ] Flow matrix only has 278 transitions (discarded 128 similar events)
[2024-05-31 20:35:21] [INFO ] Invariant cache hit.
[2024-05-31 20:35:21] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-31 20:35:21] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2024-05-31 20:35:21] [INFO ] Flow matrix only has 278 transitions (discarded 128 similar events)
[2024-05-31 20:35:21] [INFO ] Invariant cache hit.
[2024-05-31 20:35:21] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 278/441 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 60/225 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 404 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/441 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 225 constraints, problems are : Problem set: 0 solved, 404 unsolved in 13919 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 278/441 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 60/225 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 404/629 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (OVERLAPS) 0/441 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 629 constraints, problems are : Problem set: 0 solved, 404 unsolved in 16484 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
After SMT, in 31040ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 31059ms
Starting structural reductions in LTL mode, iteration 1 : 163/222 places, 406/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31783 ms. Remains : 163/222 places, 406/648 transitions.
Support contains 23 out of 163 places after structural reductions.
[2024-05-31 20:35:52] [INFO ] Flatten gal took : 50 ms
[2024-05-31 20:35:52] [INFO ] Flatten gal took : 23 ms
[2024-05-31 20:35:52] [INFO ] Input system was already deterministic with 406 transitions.
Support contains 22 out of 163 places (down from 23) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (87 resets) in 1780 ms. (22 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40002 steps (8 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (23 resets) in 120 ms. (330 steps per ms) remains 1/2 properties
[2024-05-31 20:35:53] [INFO ] Flow matrix only has 278 transitions (discarded 128 similar events)
[2024-05-31 20:35:53] [INFO ] Invariant cache hit.
[2024-05-31 20:35:53] [INFO ] State equation strengthened by 60 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) 20/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/131 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 230/361 variables, 88/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 41/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/367 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 441/441 variables, and 217 constraints, problems are : Problem set: 1 solved, 0 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 52/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
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' '!(F(p0))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 154 transition count 380
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 146 transition count 362
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 146 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 139 transition count 338
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 139 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 133 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 133 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 127 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 121 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 121 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 115 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 115 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 109 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 109 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 104 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 104 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 101 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 101 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 98 transition count 238
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 97 transition count 234
Applied a total of 136 rules in 76 ms. Remains 97 /163 variables (removed 66) and now considering 234/406 (removed 172) transitions.
[2024-05-31 20:35:53] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-31 20:35:53] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:35:54] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 20:35:54] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:35:54] [INFO ] Invariant cache hit.
[2024-05-31 20:35:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:35:54] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-31 20:35:54] [INFO ] Redundant transitions in 10 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 20:35:54] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:35:54] [INFO ] Invariant cache hit.
[2024-05-31 20:35:54] [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 4985 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 6204 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 11405ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 11408ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/163 places, 234/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11728 ms. Remains : 97/163 places, 234/406 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-01
Stuttering criterion allowed to conclude after 145 steps with 1 reset in 7 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-01 finished in 11954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 386
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 148 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 142 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 142 transition count 346
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 137 transition count 332
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 137 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 132 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 132 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 127 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 122 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 117 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 117 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 113 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 113 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 110 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 110 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 107 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 106 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 106 transition count 254
Applied a total of 122 rules in 57 ms. Remains 106 /163 variables (removed 57) and now considering 254/406 (removed 152) transitions.
[2024-05-31 20:36:05] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2024-05-31 20:36:05] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:36:05] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 20:36:05] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 20:36:05] [INFO ] Invariant cache hit.
[2024-05-31 20:36:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:36:06] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-31 20:36:06] [INFO ] Redundant transitions in 12 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-31 20:36:06] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 20:36:06] [INFO ] Invariant cache hit.
[2024-05-31 20:36:06] [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, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 148 constraints, problems are : Problem set: 0 solved, 252 unsolved in 5718 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: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 252/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/278 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 400 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6752 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: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 12683ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 12687ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/163 places, 254/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13012 ms. Remains : 106/163 places, 254/406 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-02
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-02 finished in 13116 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((X(p1)||p0))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 154 transition count 380
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 146 transition count 362
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 146 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 139 transition count 338
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 139 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 133 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 133 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 127 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 121 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 121 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 116 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 116 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 111 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 111 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 107 transition count 258
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 107 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 105 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 105 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 103 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 103 transition count 250
Applied a total of 122 rules in 28 ms. Remains 103 /163 variables (removed 60) and now considering 250/406 (removed 156) transitions.
[2024-05-31 20:36:18] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 103 cols
[2024-05-31 20:36:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:36:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 20:36:19] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
[2024-05-31 20:36:19] [INFO ] Invariant cache hit.
[2024-05-31 20:36:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:36:19] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-05-31 20:36:19] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
[2024-05-31 20:36:19] [INFO ] Invariant cache hit.
[2024-05-31 20:36:19] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 170/273 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 248 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/273 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 145 constraints, problems are : Problem set: 0 solved, 248 unsolved in 5764 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 170/273 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 248/393 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/273 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 393 constraints, problems are : Problem set: 0 solved, 248 unsolved in 6368 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
After SMT, in 12348ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 12351ms
Starting structural reductions in LTL mode, iteration 1 : 103/163 places, 250/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12631 ms. Remains : 103/163 places, 250/406 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 161 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 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 37 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b002-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b002-LTLFireability-03 finished in 13213 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 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 148 transition count 368
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 148 transition count 368
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 142 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 142 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 137 transition count 332
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 137 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 132 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 132 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 127 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 122 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 117 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 117 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 112 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 109 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 109 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 106 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 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 1 with 4 rules applied. Total rules applied 122 place count 105 transition count 252
Applied a total of 122 rules in 35 ms. Remains 105 /163 variables (removed 58) and now considering 252/406 (removed 154) transitions.
[2024-05-31 20:36:32] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2024-05-31 20:36:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:36:32] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-31 20:36:32] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 20:36:32] [INFO ] Invariant cache hit.
[2024-05-31 20:36:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:36:32] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-31 20:36:32] [INFO ] Redundant transitions in 4 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 20:36:32] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 20:36:32] [INFO ] Invariant cache hit.
[2024-05-31 20:36:32] [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 5924 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 6574 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 12708ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 12710ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/163 places, 252/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13090 ms. Remains : 105/163 places, 252/406 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-05
Product exploration explored 100000 steps with 556 reset in 258 ms.
Stack based approach found an accepted trace after 16061 steps with 75 reset with depth 57 and stack size 56 in 50 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-05 finished in 13467 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 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 154 transition count 380
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 146 transition count 362
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 146 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 139 transition count 338
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 139 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 133 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 133 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 127 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 121 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 121 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 115 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 115 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 109 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 109 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 104 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 104 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 101 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 101 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 98 transition count 238
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 97 transition count 234
Applied a total of 136 rules in 69 ms. Remains 97 /163 variables (removed 66) and now considering 234/406 (removed 172) transitions.
[2024-05-31 20:36:45] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-31 20:36:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:36:45] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-31 20:36:45] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:36:45] [INFO ] Invariant cache hit.
[2024-05-31 20:36:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:36:46] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-31 20:36:46] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 20:36:46] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:36:46] [INFO ] Invariant cache hit.
[2024-05-31 20:36:46] [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 5033 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 6029 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 11254ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 11257ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/163 places, 234/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11702 ms. Remains : 97/163 places, 234/406 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-07
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-07 finished in 11756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((G(p2)&&p1)))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 386
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 148 transition count 366
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 143 transition count 350
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 143 transition count 350
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 139 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 139 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 135 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 135 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 131 transition count 316
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 131 transition count 316
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 127 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 127 transition count 306
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 123 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 123 transition count 298
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 120 transition count 292
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 120 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 118 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 118 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 116 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 116 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 115 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 115 transition count 282
Applied a total of 100 rules in 17 ms. Remains 115 /163 variables (removed 48) and now considering 282/406 (removed 124) transitions.
[2024-05-31 20:36:57] [INFO ] Flow matrix only has 191 transitions (discarded 91 similar events)
// Phase 1: matrix 191 rows 115 cols
[2024-05-31 20:36:57] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:36:57] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 20:36:57] [INFO ] Flow matrix only has 191 transitions (discarded 91 similar events)
[2024-05-31 20:36:57] [INFO ] Invariant cache hit.
[2024-05-31 20:36:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 20:36:57] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2024-05-31 20:36:57] [INFO ] Flow matrix only has 191 transitions (discarded 91 similar events)
[2024-05-31 20:36:57] [INFO ] Invariant cache hit.
[2024-05-31 20:36:57] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 191/306 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 160 constraints, problems are : Problem set: 0 solved, 280 unsolved in 7230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 191/306 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 280/440 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 440 constraints, problems are : Problem set: 0 solved, 280 unsolved in 7905 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
After SMT, in 15379ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 15382ms
Starting structural reductions in LTL mode, iteration 1 : 115/163 places, 282/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15625 ms. Remains : 115/163 places, 282/406 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-08
Stuttering criterion allowed to conclude after 311 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-08 finished in 15946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0&&X((X(p2)||p1)))))))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 148 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 142 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 142 transition count 346
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 137 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 137 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 132 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 132 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 127 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 127 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 122 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 122 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 117 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 117 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 113 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 113 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 111 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 109 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 108 transition count 264
Applied a total of 112 rules in 18 ms. Remains 108 /163 variables (removed 55) and now considering 264/406 (removed 142) transitions.
[2024-05-31 20:37:13] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
// Phase 1: matrix 179 rows 108 cols
[2024-05-31 20:37:13] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:37:13] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 20:37:13] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2024-05-31 20:37:13] [INFO ] Invariant cache hit.
[2024-05-31 20:37:13] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 20:37:13] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-31 20:37:13] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2024-05-31 20:37:13] [INFO ] Invariant cache hit.
[2024-05-31 20:37:13] [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 6289 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 7133 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 13628ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 13632ms
Starting structural reductions in LTL mode, iteration 1 : 108/163 places, 264/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13876 ms. Remains : 108/163 places, 264/406 transitions.
Stuttering acceptance computed with spot in 371 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-11
Entered a terminal (fully accepting) state of product in 429 steps with 1 reset in 6 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-11 finished in 14281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 388
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 156 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 150 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 150 transition count 370
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 145 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 145 transition count 352
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 140 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 140 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 135 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 135 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 130 transition count 308
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 130 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 125 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 125 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 120 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 120 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 116 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 116 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 113 transition count 272
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 113 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 110 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 110 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 109 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 109 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 109 transition count 260
Applied a total of 116 rules in 33 ms. Remains 109 /163 variables (removed 54) and now considering 260/406 (removed 146) transitions.
[2024-05-31 20:37:27] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
// Phase 1: matrix 178 rows 109 cols
[2024-05-31 20:37:27] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:37:27] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 20:37:27] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 20:37:27] [INFO ] Invariant cache hit.
[2024-05-31 20:37:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 20:37:27] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-31 20:37:27] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-31 20:37:27] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 20:37:27] [INFO ] Invariant cache hit.
[2024-05-31 20:37:27] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6358 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 258/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 411 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6964 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 13552ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 13554ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/163 places, 260/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13795 ms. Remains : 109/163 places, 260/406 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-13
Product exploration explored 100000 steps with 641 reset in 163 ms.
Stack based approach found an accepted trace after 72287 steps with 461 reset with depth 153 and stack size 153 in 177 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-13 finished in 14233 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 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 384
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 147 transition count 366
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 147 transition count 366
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 140 transition count 342
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 140 transition count 342
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 134 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 134 transition count 324
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 128 transition count 308
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 128 transition count 308
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 122 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 122 transition count 290
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 116 transition count 276
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 116 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 110 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 110 transition count 264
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 105 transition count 254
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 105 transition count 254
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 119 place count 102 transition count 248
Iterating global reduction 0 with 3 rules applied. Total rules applied 122 place count 102 transition count 248
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 125 place count 99 transition count 242
Iterating global reduction 0 with 3 rules applied. Total rules applied 128 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 98 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 98 transition count 240
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 132 place count 98 transition count 238
Applied a total of 132 rules in 30 ms. Remains 98 /163 variables (removed 65) and now considering 238/406 (removed 168) transitions.
[2024-05-31 20:37:41] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
// Phase 1: matrix 160 rows 98 cols
[2024-05-31 20:37:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:37:41] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 20:37:41] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-31 20:37:41] [INFO ] Invariant cache hit.
[2024-05-31 20:37:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:37:42] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-31 20:37:42] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-31 20:37:42] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-31 20:37:42] [INFO ] Invariant cache hit.
[2024-05-31 20:37:42] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 373 constraints, problems are : Problem set: 0 solved, 236 unsolved in 6026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 11249ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 11252ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/163 places, 238/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11507 ms. Remains : 98/163 places, 238/406 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-14
Product exploration explored 100000 steps with 559 reset in 147 ms.
Product exploration explored 100000 steps with 553 reset in 165 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 based reduction with 3 factoid took 70 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)]
RANDOM walk for 2898 steps (2 resets) in 20 ms. (138 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 75 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 238/238 transitions.
Applied a total of 0 rules in 17 ms. Remains 98 /98 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2024-05-31 20:37:53] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-31 20:37:53] [INFO ] Invariant cache hit.
[2024-05-31 20:37:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 20:37:54] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-31 20:37:54] [INFO ] Invariant cache hit.
[2024-05-31 20:37:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:37:54] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-31 20:37:54] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-31 20:37:54] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-31 20:37:54] [INFO ] Invariant cache hit.
[2024-05-31 20:37:54] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 373 constraints, problems are : Problem set: 0 solved, 236 unsolved in 6227 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 11413ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 11416ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11640 ms. Remains : 98/98 places, 238/238 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 83 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 33 ms :[(NOT p0)]
RANDOM walk for 7316 steps (20 resets) in 22 ms. (318 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 100 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 558 reset in 141 ms.
Product exploration explored 100000 steps with 551 reset in 158 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 238/238 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2024-05-31 20:38:06] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-31 20:38:06] [INFO ] Invariant cache hit.
[2024-05-31 20:38:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 20:38:06] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-31 20:38:06] [INFO ] Invariant cache hit.
[2024-05-31 20:38:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:38:06] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-31 20:38:06] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-31 20:38:06] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-31 20:38:06] [INFO ] Invariant cache hit.
[2024-05-31 20:38:06] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 373 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5935 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 11117ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 11120ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11323 ms. Remains : 98/98 places, 238/238 transitions.
Treatment of property FunctionPointer-PT-b002-LTLFireability-14 finished in 35880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 148 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 142 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 142 transition count 346
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 138 transition count 334
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 138 transition count 334
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 134 transition count 324
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 134 transition count 324
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 130 transition count 312
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 130 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 126 transition count 302
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 126 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 122 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 122 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 119 transition count 288
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 119 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 117 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 117 transition count 284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 115 transition count 280
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 115 transition count 280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 114 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 114 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 114 transition count 272
Applied a total of 106 rules in 40 ms. Remains 114 /163 variables (removed 49) and now considering 272/406 (removed 134) transitions.
[2024-05-31 20:38:17] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
// Phase 1: matrix 187 rows 114 cols
[2024-05-31 20:38:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:38:18] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-31 20:38:18] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
[2024-05-31 20:38:18] [INFO ] Invariant cache hit.
[2024-05-31 20:38:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 20:38:18] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-31 20:38:18] [INFO ] Redundant transitions in 1 ms returned []
Running 270 sub problems to find dead transitions.
[2024-05-31 20:38:18] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
[2024-05-31 20:38:18] [INFO ] Invariant cache hit.
[2024-05-31 20:38:18] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 187/301 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 160 constraints, problems are : Problem set: 0 solved, 270 unsolved in 6508 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 187/301 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 270/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 430 constraints, problems are : Problem set: 0 solved, 270 unsolved in 7783 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 14514ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 14518ms
Starting structural reductions in SI_LTL mode, iteration 1 : 114/163 places, 272/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15058 ms. Remains : 114/163 places, 272/406 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-15
Stuttering criterion allowed to conclude after 520 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-15 finished in 15198 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)))'
[2024-05-31 20:38:33] [INFO ] Flatten gal took : 23 ms
[2024-05-31 20:38:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-31 20:38:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 406 transitions and 1636 arcs took 5 ms.
Total runtime 192828 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-b002-LTLFireability-14

BK_STOP 1717187924339

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-b002-LTLFireability-14
ltl formula formula --ltl=/tmp/939/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 163 places, 406 transitions and 1636 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/939/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/939/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/939/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/939/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 164 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 164, there are 412 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): ~2496 levels ~10000 states ~64840 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~129864 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~259864 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~519864 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~1039864 transitions
pnml2lts-mc( 3/ 4): ~80000 levels ~320000 states ~2079864 transitions
pnml2lts-mc( 3/ 4): ~160000 levels ~640000 states ~4159864 transitions
pnml2lts-mc( 3/ 4): ~320000 levels ~1280000 states ~8319864 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4
pnml2lts-mc( 0/ 4): unique states count: 1831102
pnml2lts-mc( 0/ 4): unique transitions count: 13481044
pnml2lts-mc( 0/ 4): - self-loop count: 8
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 313704
pnml2lts-mc( 0/ 4): - claim success count: 1831107
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1831103
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1831107 states 13481062 transitions, fanout: 7.362
pnml2lts-mc( 0/ 4): Total exploration time 10.450 sec (10.390 sec minimum, 10.423 sec on average)
pnml2lts-mc( 0/ 4): States per second: 175226, Transitions per second: 1290054
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 112.5MB, 18.6 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 18.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 409 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 112.5MB (~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-b002"
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-b002, 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-171640602900220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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