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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 15:58 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-b064-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717189659146

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-b064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:07:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:07:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:07:40] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-31 21:07:40] [INFO ] Transformed 306 places.
[2024-05-31 21:07:40] [INFO ] Transformed 840 transitions.
[2024-05-31 21:07:40] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 210 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 1 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b064-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b064-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 33 place count 189 transition count 514
Iterating global reduction 1 with 23 rules applied. Total rules applied 56 place count 189 transition count 514
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 86 place count 189 transition count 484
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 100 place count 175 transition count 456
Iterating global reduction 2 with 14 rules applied. Total rules applied 114 place count 175 transition count 456
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 122 place count 175 transition count 448
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 127 place count 170 transition count 438
Iterating global reduction 3 with 5 rules applied. Total rules applied 132 place count 170 transition count 438
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 136 place count 166 transition count 422
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 166 transition count 422
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 143 place count 163 transition count 416
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 163 transition count 416
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 148 place count 161 transition count 408
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 161 transition count 408
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 159 transition count 400
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 159 transition count 400
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 156 place count 157 transition count 396
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 157 transition count 396
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 160 place count 155 transition count 392
Iterating global reduction 3 with 2 rules applied. Total rules applied 162 place count 155 transition count 392
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 153 transition count 388
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 153 transition count 388
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 151 transition count 384
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 151 transition count 384
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 149 transition count 380
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 149 transition count 380
Applied a total of 174 rules in 109 ms. Remains 149 /222 variables (removed 73) and now considering 380/648 (removed 268) transitions.
[2024-05-31 21:07:40] [INFO ] Flow matrix only has 256 transitions (discarded 124 similar events)
// Phase 1: matrix 256 rows 149 cols
[2024-05-31 21:07:40] [INFO ] Computed 2 invariants in 26 ms
[2024-05-31 21:07:41] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-31 21:07:41] [INFO ] Flow matrix only has 256 transitions (discarded 124 similar events)
[2024-05-31 21:07:41] [INFO ] Invariant cache hit.
[2024-05-31 21:07:41] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-31 21:07:41] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2024-05-31 21:07:41] [INFO ] Flow matrix only has 256 transitions (discarded 124 similar events)
[2024-05-31 21:07:41] [INFO ] Invariant cache hit.
[2024-05-31 21:07:41] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (OVERLAPS) 256/405 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 53/204 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 378 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 378 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 204 constraints, problems are : Problem set: 0 solved, 378 unsolved in 13058 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (OVERLAPS) 256/405 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 53/204 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 378/582 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 378 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 582 constraints, problems are : Problem set: 0 solved, 378 unsolved in 14908 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints]
After SMT, in 28511ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 28535ms
Starting structural reductions in LTL mode, iteration 1 : 149/222 places, 380/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29235 ms. Remains : 149/222 places, 380/648 transitions.
Support contains 19 out of 149 places after structural reductions.
[2024-05-31 21:08:10] [INFO ] Flatten gal took : 49 ms
[2024-05-31 21:08:10] [INFO ] Flatten gal took : 25 ms
[2024-05-31 21:08:10] [INFO ] Input system was already deterministic with 380 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40048 steps (22 resets) in 1019 ms. (39 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
[2024-05-31 21:08:10] [INFO ] Flow matrix only has 256 transitions (discarded 124 similar events)
[2024-05-31 21:08:10] [INFO ] Invariant cache hit.
[2024-05-31 21:08:10] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 256/333 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 53/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/339 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 50/390 variables, 37/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/402 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/405 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/405 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 256/333 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 53/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/339 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 50/390 variables, 37/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/402 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/405 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/405 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 345ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7660 steps, including 110 resets, run visited all 1 properties in 25 ms. (steps per millisecond=306 )
Parikh walk visited 1 properties in 29 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(G(!p1)) U p2)&&p0)))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 380/380 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 140 transition count 360
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 140 transition count 360
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 32 place count 140 transition count 346
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 136 transition count 334
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 136 transition count 334
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 132 transition count 320
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 132 transition count 320
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 128 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 128 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 124 transition count 296
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 124 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 120 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 120 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 116 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 116 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 112 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 91 place count 109 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 94 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 107 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 106 transition count 258
Applied a total of 100 rules in 37 ms. Remains 106 /149 variables (removed 43) and now considering 258/380 (removed 122) transitions.
[2024-05-31 21:08:11] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2024-05-31 21:08:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:08:11] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 21:08:11] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2024-05-31 21:08:11] [INFO ] Invariant cache hit.
[2024-05-31 21:08:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:08:11] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-31 21:08:11] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2024-05-31 21:08:11] [INFO ] Invariant cache hit.
[2024-05-31 21:08:11] [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, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 256 unsolved in 6375 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: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 256/404 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 404 constraints, problems are : Problem set: 0 solved, 256 unsolved in 7636 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: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 14211ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 14215ms
Starting structural reductions in LTL mode, iteration 1 : 106/149 places, 258/380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14457 ms. Remains : 106/149 places, 258/380 transitions.
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, p1, (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-00 finished in 14858 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(p0)&&(G(p0)||p1)))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 380/380 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 139 transition count 354
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 139 transition count 354
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 30 place count 139 transition count 344
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 134 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 134 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 129 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 129 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 119 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 119 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 114 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 114 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 109 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 109 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 104 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 104 place count 100 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 100 transition count 242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 98 transition count 238
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 98 transition count 238
Applied a total of 112 rules in 30 ms. Remains 98 /149 variables (removed 51) and now considering 238/380 (removed 142) transitions.
[2024-05-31 21:08:26] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
// Phase 1: matrix 162 rows 98 cols
[2024-05-31 21:08:26] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:08:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 21:08:26] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-31 21:08:26] [INFO ] Invariant cache hit.
[2024-05-31 21:08:26] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 21:08:26] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-31 21:08:26] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-31 21:08:26] [INFO ] Invariant cache hit.
[2024-05-31 21:08:26] [INFO ] State equation strengthened by 39 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) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 139 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5468 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 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) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 236/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 375 constraints, problems are : Problem set: 0 solved, 236 unsolved in 7450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 13107ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 13110ms
Starting structural reductions in LTL mode, iteration 1 : 98/149 places, 238/380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13337 ms. Remains : 98/149 places, 238/380 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 264 ms.
Product exploration explored 100000 steps with 25000 reset in 184 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 30095 steps (15 resets) in 109 ms. (273 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in 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 21:08:40] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-31 21:08:40] [INFO ] Invariant cache hit.
[2024-05-31 21:08:40] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 21:08:40] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-31 21:08:40] [INFO ] Invariant cache hit.
[2024-05-31 21:08:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 21:08:41] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-31 21:08:41] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-31 21:08:41] [INFO ] Invariant cache hit.
[2024-05-31 21:08:41] [INFO ] State equation strengthened by 39 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) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 139 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5569 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 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) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 236/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 375 constraints, problems are : Problem set: 0 solved, 236 unsolved in 7316 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 13068ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 13071ms
Finished structural reductions in LTL mode , in 1 iterations and 13319 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 29445 steps (17 resets) in 69 ms. (420 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 201 ms.
Product exploration explored 100000 steps with 25000 reset in 152 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
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.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 97 transition count 234
Applied a total of 4 rules in 42 ms. Remains 97 /98 variables (removed 1) and now considering 234/238 (removed 4) transitions.
[2024-05-31 21:08:55] [INFO ] Redundant transitions in 8 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 21:08:55] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-31 21:08:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:08:55] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
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 5648 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 6345 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 12158ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 12160ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/98 places, 234/238 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12216 ms. Remains : 97/98 places, 234/238 transitions.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 238/238 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 236
Applied a total of 2 rules in 5 ms. Remains 97 /98 variables (removed 1) and now considering 236/238 (removed 2) transitions.
[2024-05-31 21:09:07] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-31 21:09:07] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:09:07] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 21:09:07] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 21:09:07] [INFO ] Invariant cache hit.
[2024-05-31 21:09:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:09:08] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-31 21:09:08] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 21:09:08] [INFO ] Invariant cache hit.
[2024-05-31 21:09:08] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5595 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 370 constraints, problems are : Problem set: 0 solved, 234 unsolved in 7274 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 13038ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 13040ms
Starting structural reductions in LTL mode, iteration 1 : 97/98 places, 236/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13250 ms. Remains : 97/98 places, 236/238 transitions.
Treatment of property FunctionPointer-PT-b064-LTLFireability-01 finished in 55255 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((G(p1)||p0))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 380/380 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 141 transition count 358
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 141 transition count 358
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 141 transition count 350
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 137 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 137 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 133 transition count 324
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 133 transition count 324
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 129 transition count 310
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 129 transition count 310
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 125 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 125 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 121 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 121 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 117 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 117 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 113 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 113 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 110 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 110 transition count 270
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 90 place count 110 transition count 266
Applied a total of 90 rules in 53 ms. Remains 110 /149 variables (removed 39) and now considering 266/380 (removed 114) transitions.
[2024-05-31 21:09:21] [INFO ] Flow matrix only has 182 transitions (discarded 84 similar events)
// Phase 1: matrix 182 rows 110 cols
[2024-05-31 21:09:21] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:09:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 21:09:21] [INFO ] Flow matrix only has 182 transitions (discarded 84 similar events)
[2024-05-31 21:09:21] [INFO ] Invariant cache hit.
[2024-05-31 21:09:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:09:21] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-31 21:09:21] [INFO ] Redundant transitions in 13 ms returned []
Running 264 sub problems to find dead transitions.
[2024-05-31 21:09:21] [INFO ] Flow matrix only has 182 transitions (discarded 84 similar events)
[2024-05-31 21:09:21] [INFO ] Invariant cache hit.
[2024-05-31 21:09:21] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 182/292 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/155 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 155 constraints, problems are : Problem set: 0 solved, 264 unsolved in 6779 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 182/292 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/155 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 264/419 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 419 constraints, problems are : Problem set: 0 solved, 264 unsolved in 8147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
After SMT, in 15152ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 15155ms
Starting structural reductions in SI_LTL mode, iteration 1 : 110/149 places, 266/380 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15452 ms. Remains : 110/149 places, 266/380 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-03
Product exploration explored 100000 steps with 993 reset in 360 ms.
Product exploration explored 100000 steps with 966 reset in 379 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 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40038 steps (34 resets) in 91 ms. (435 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
[2024-05-31 21:09:37] [INFO ] Flow matrix only has 182 transitions (discarded 84 similar events)
[2024-05-31 21:09:37] [INFO ] Invariant cache hit.
[2024-05-31 21:09:37] [INFO ] State equation strengthened by 43 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) 7/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/73 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 165/238 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 31/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/244 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 285/292 variables, and 143 constraints, problems are : Problem set: 1 solved, 0 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/110 constraints, ReadFeed: 35/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 11 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b064-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b064-LTLFireability-03 finished in 16660 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 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 380/380 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 140 transition count 356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 140 transition count 356
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 28 place count 140 transition count 346
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 136 transition count 336
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 136 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 132 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 132 transition count 322
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 128 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 128 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 124 transition count 296
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 124 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 120 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 120 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 116 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 116 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 112 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 112 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 108 transition count 262
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 108 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 106 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 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 102 place count 105 transition count 252
Applied a total of 102 rules in 43 ms. Remains 105 /149 variables (removed 44) and now considering 252/380 (removed 128) transitions.
[2024-05-31 21:09:37] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2024-05-31 21:09:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:09:37] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 21:09:37] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 21:09:37] [INFO ] Invariant cache hit.
[2024-05-31 21:09:38] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:09:38] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-31 21:09:38] [INFO ] Redundant transitions in 2 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 21:09:38] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 21:09:38] [INFO ] Invariant cache hit.
[2024-05-31 21:09:38] [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
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 6251 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 7158 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 13584ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 13587ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/149 places, 252/380 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13841 ms. Remains : 105/149 places, 252/380 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-04
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-04 finished in 13909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 380/380 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 140 transition count 356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 140 transition count 356
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 28 place count 140 transition count 346
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 136 transition count 336
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 136 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 132 transition count 320
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 132 transition count 320
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 128 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 128 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 124 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 124 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 120 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 116 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 112 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 112 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 109 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 107 transition count 262
Applied a total of 94 rules in 14 ms. Remains 107 /149 variables (removed 42) and now considering 262/380 (removed 118) transitions.
[2024-05-31 21:09:51] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
// Phase 1: matrix 178 rows 107 cols
[2024-05-31 21:09:51] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:09:51] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 21:09:51] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2024-05-31 21:09:51] [INFO ] Invariant cache hit.
[2024-05-31 21:09:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:09:52] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-31 21:09:52] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2024-05-31 21:09:52] [INFO ] Invariant cache hit.
[2024-05-31 21:09:52] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 149 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 260/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 409 constraints, problems are : Problem set: 0 solved, 260 unsolved in 7655 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 14344ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 14346ms
Starting structural reductions in LTL mode, iteration 1 : 107/149 places, 262/380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14603 ms. Remains : 107/149 places, 262/380 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-05
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-05 finished in 14764 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 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 380/380 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 139 transition count 354
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 139 transition count 354
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 30 place count 139 transition count 344
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 134 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 134 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 129 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 129 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 119 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 119 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 114 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 114 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 109 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 109 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 104 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 104 place count 100 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 100 transition count 242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 98 transition count 238
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 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 116 place count 97 transition count 234
Applied a total of 116 rules in 34 ms. Remains 97 /149 variables (removed 52) and now considering 234/380 (removed 146) transitions.
[2024-05-31 21:10:06] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-31 21:10:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:10:06] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 21:10:06] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 21:10:06] [INFO ] Invariant cache hit.
[2024-05-31 21:10:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:10:06] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-31 21:10:06] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 21:10:06] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 21:10:06] [INFO ] Invariant cache hit.
[2024-05-31 21:10:06] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 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
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 5657 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 6408 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 12223ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 12225ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/149 places, 234/380 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12462 ms. Remains : 97/149 places, 234/380 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-09
Product exploration explored 100000 steps with 1163 reset in 319 ms.
Product exploration explored 100000 steps with 1136 reset in 288 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 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33612 steps (32 resets) in 58 ms. (569 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 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 234/234 transitions.
Applied a total of 0 rules in 10 ms. Remains 97 /97 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-05-31 21:10:20] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 21:10:20] [INFO ] Invariant cache hit.
[2024-05-31 21:10:20] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 21:10:20] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 21:10:20] [INFO ] Invariant cache hit.
[2024-05-31 21:10:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:10:20] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-31 21:10:20] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 21:10:20] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 21:10:20] [INFO ] Invariant cache hit.
[2024-05-31 21:10:20] [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
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 5828 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 6046 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 12031ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 12033ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12232 ms. Remains : 97/97 places, 234/234 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 59 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 35010 steps (29 resets) in 51 ms. (673 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 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1178 reset in 226 ms.
Product exploration explored 100000 steps with 1124 reset in 248 ms.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 234/234 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-05-31 21:10:33] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 21:10:33] [INFO ] Invariant cache hit.
[2024-05-31 21:10:33] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 21:10:33] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 21:10:33] [INFO ] Invariant cache hit.
[2024-05-31 21:10:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:10:33] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-31 21:10:33] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 21:10:33] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 21:10:33] [INFO ] Invariant cache hit.
[2024-05-31 21:10:33] [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
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 5607 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 6284 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 12051ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 12054ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12258 ms. Remains : 97/97 places, 234/234 transitions.
Treatment of property FunctionPointer-PT-b064-LTLFireability-09 finished in 39146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 380/380 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 140 transition count 356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 140 transition count 356
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 140 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 135 transition count 334
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 135 transition count 334
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 130 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 130 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 125 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 125 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 120 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 115 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 115 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 110 transition count 264
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 110 transition count 264
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 105 transition count 254
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 105 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 101 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 101 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 99 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 98 transition count 240
Applied a total of 110 rules in 13 ms. Remains 98 /149 variables (removed 51) and now considering 240/380 (removed 140) transitions.
[2024-05-31 21:10:45] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2024-05-31 21:10:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:10:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 21:10:45] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 21:10:45] [INFO ] Invariant cache hit.
[2024-05-31 21:10:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:10:45] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-31 21:10:45] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 21:10:45] [INFO ] Invariant cache hit.
[2024-05-31 21:10:45] [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, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5579 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: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 375 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6612 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: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 12348ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 12351ms
Starting structural reductions in LTL mode, iteration 1 : 98/149 places, 240/380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12561 ms. Remains : 98/149 places, 240/380 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-10 finished in 12700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 380/380 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 140 transition count 356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 140 transition count 356
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 140 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 135 transition count 334
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 135 transition count 334
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 130 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 130 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 125 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 125 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 120 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 115 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 115 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 110 transition count 264
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 110 transition count 264
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 105 transition count 254
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 105 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 101 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 101 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 99 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 98 transition count 240
Applied a total of 110 rules in 18 ms. Remains 98 /149 variables (removed 51) and now considering 240/380 (removed 140) transitions.
[2024-05-31 21:10:58] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2024-05-31 21:10:58] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:10:58] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 21:10:58] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 21:10:58] [INFO ] Invariant cache hit.
[2024-05-31 21:10:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:10:58] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-31 21:10:58] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 21:10:58] [INFO ] Invariant cache hit.
[2024-05-31 21:10:58] [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, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5865 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: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 375 constraints, problems are : Problem set: 0 solved, 238 unsolved in 7009 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: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 13042ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 13045ms
Starting structural reductions in LTL mode, iteration 1 : 98/149 places, 240/380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13272 ms. Remains : 98/149 places, 240/380 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-14 finished in 13379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 380/380 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 140 transition count 358
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 140 transition count 358
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 28 place count 140 transition count 348
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 136 transition count 336
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 136 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 132 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 132 transition count 322
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 128 transition count 310
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 128 transition count 310
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 124 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 124 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 120 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 116 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 112 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 112 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 109 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 109 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 107 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 106 transition count 260
Applied a total of 96 rules in 16 ms. Remains 106 /149 variables (removed 43) and now considering 260/380 (removed 120) transitions.
[2024-05-31 21:11:11] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2024-05-31 21:11:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:11:11] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 21:11:11] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 21:11:11] [INFO ] Invariant cache hit.
[2024-05-31 21:11:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:11:12] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-31 21:11:12] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 21:11:12] [INFO ] Invariant cache hit.
[2024-05-31 21:11:12] [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, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/282 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 148 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6406 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: 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/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/282 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 258/406 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 406 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7972 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: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 14564ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 14567ms
Starting structural reductions in LTL mode, iteration 1 : 106/149 places, 260/380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14816 ms. Remains : 106/149 places, 260/380 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-15 finished in 14957 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(p0)&&(G(p0)||p1)))))'
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)))'
[2024-05-31 21:11:26] [INFO ] Flatten gal took : 17 ms
[2024-05-31 21:11:26] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 21:11:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 149 places, 380 transitions and 1534 arcs took 7 ms.
Total runtime 226747 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FunctionPointer-PT-b064-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : FunctionPointer-PT-b064-LTLFireability-09

BK_STOP 1717189899087

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-b064-LTLFireability-01
ltl formula formula --ltl=/tmp/1149/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 149 places, 380 transitions and 1534 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1149/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1149/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1149/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1149/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 151 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 150, there are 392 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):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 23
pnml2lts-mc( 0/ 4): unique states count: 23
pnml2lts-mc( 0/ 4): unique transitions count: 46
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 29
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 34
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 34 states 92 transitions, fanout: 2.706
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3400, Transitions per second: 9200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 50.8 B/state, compr.: 8.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 383 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-b064-LTLFireability-09
ltl formula formula --ltl=/tmp/1149/ltl_1_
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 149 places, 380 transitions and 1534 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1149/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1149/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1149/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1149/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 151 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 150, there are 383 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( 1/ 4): ~2197 levels ~10000 states ~31900 transitions
pnml2lts-mc( 1/ 4): ~3770 levels ~20000 states ~58536 transitions
pnml2lts-mc( 1/ 4): ~6918 levels ~40000 states ~111896 transitions
pnml2lts-mc( 1/ 4): ~13214 levels ~80000 states ~218552 transitions
pnml2lts-mc( 1/ 4): ~25808 levels ~160000 states ~431908 transitions
pnml2lts-mc( 1/ 4): ~50992 levels ~320000 states ~858548 transitions
pnml2lts-mc( 1/ 4): ~101362 levels ~640000 states ~1711888 transitions
pnml2lts-mc( 1/ 4): ~202102 levels ~1280000 states ~3418544 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2060148
pnml2lts-mc( 0/ 4): unique transitions count: 10182964
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 634997
pnml2lts-mc( 0/ 4): - claim success count: 2060218
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1851036
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2060218 states 10183229 transitions, fanout: 4.943
pnml2lts-mc( 0/ 4): Total exploration time 11.190 sec (11.150 sec minimum, 11.172 sec on average)
pnml2lts-mc( 0/ 4): States per second: 184112, Transitions per second: 910029
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 133.2MB, 15.4 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 27.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 383 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 133.2MB (~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-b064"
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-b064, 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-171640603000260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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