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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 25K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 16:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Apr 11 16:05 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-b008-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b008-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717188386102

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:46:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:46:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:46:27] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-31 20:46:27] [INFO ] Transformed 306 places.
[2024-05-31 20:46:27] [INFO ] Transformed 840 transitions.
[2024-05-31 20:46:27] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b008-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 33 place count 189 transition count 496
Iterating global reduction 1 with 24 rules applied. Total rules applied 57 place count 189 transition count 496
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 81 place count 189 transition count 472
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 179 transition count 452
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 179 transition count 452
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 179 transition count 448
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 176 transition count 442
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 176 transition count 442
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 174 transition count 434
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 174 transition count 434
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 172 transition count 430
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 172 transition count 430
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 170 transition count 422
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 170 transition count 422
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 169 transition count 418
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 169 transition count 418
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 168 transition count 416
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 168 transition count 416
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 167 transition count 414
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 167 transition count 414
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 166 transition count 412
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 166 transition count 412
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 165 transition count 410
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 165 transition count 410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 164 transition count 408
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 164 transition count 408
Applied a total of 135 rules in 110 ms. Remains 164 /222 variables (removed 58) and now considering 408/648 (removed 240) transitions.
[2024-05-31 20:46:27] [INFO ] Flow matrix only has 279 transitions (discarded 129 similar events)
// Phase 1: matrix 279 rows 164 cols
[2024-05-31 20:46:27] [INFO ] Computed 2 invariants in 19 ms
[2024-05-31 20:46:27] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-31 20:46:28] [INFO ] Flow matrix only has 279 transitions (discarded 129 similar events)
[2024-05-31 20:46:28] [INFO ] Invariant cache hit.
[2024-05-31 20:46:28] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-31 20:46:28] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 406 sub problems to find dead transitions.
[2024-05-31 20:46:28] [INFO ] Flow matrix only has 279 transitions (discarded 129 similar events)
[2024-05-31 20:46:28] [INFO ] Invariant cache hit.
[2024-05-31 20:46:28] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 279/442 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 59/224 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 406 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/443 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 225 constraints, problems are : Problem set: 0 solved, 406 unsolved in 15087 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 279/442 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 59/224 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 32/256 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (OVERLAPS) 1/443 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 374/631 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 10 (OVERLAPS) 0/443 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 631 constraints, problems are : Problem set: 0 solved, 406 unsolved in 21016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints]
After SMT, in 36770ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 36793ms
Starting structural reductions in LTL mode, iteration 1 : 164/222 places, 408/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37543 ms. Remains : 164/222 places, 408/648 transitions.
Support contains 20 out of 164 places after structural reductions.
[2024-05-31 20:47:05] [INFO ] Flatten gal took : 52 ms
[2024-05-31 20:47:05] [INFO ] Flatten gal took : 25 ms
[2024-05-31 20:47:05] [INFO ] Input system was already deterministic with 408 transitions.
Support contains 19 out of 164 places (down from 20) after GAL structural reductions.
RANDOM walk for 40000 steps (44 resets) in 1521 ms. (26 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40004 steps (12 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (14 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
[2024-05-31 20:47:06] [INFO ] Flow matrix only has 279 transitions (discarded 129 similar events)
[2024-05-31 20:47:06] [INFO ] Invariant cache hit.
[2024-05-31 20:47:06] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 54/77 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 145/222 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 406/443 variables, and 151 constraints, problems are : Problem set: 3 solved, 0 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/164 constraints, ReadFeed: 12/59 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA FunctionPointer-PT-b008-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
FORMULA FunctionPointer-PT-b008-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 877 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 408/408 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 408
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 152 transition count 382
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 152 transition count 382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 31 place count 152 transition count 374
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 36 place count 147 transition count 364
Iterating global reduction 2 with 5 rules applied. Total rules applied 41 place count 147 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 142 transition count 348
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 142 transition count 348
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 137 transition count 334
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 137 transition count 334
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 132 transition count 320
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 132 transition count 320
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 127 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 127 transition count 304
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 85 place count 123 transition count 294
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 123 transition count 294
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 119 transition count 286
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 119 transition count 286
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 115 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 115 transition count 278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 112 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 112 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 109 transition count 266
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 108 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 108 transition count 264
Applied a total of 119 rules in 28 ms. Remains 108 /164 variables (removed 56) and now considering 264/408 (removed 144) transitions.
[2024-05-31 20:47:06] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
// Phase 1: matrix 179 rows 108 cols
[2024-05-31 20:47:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:47:06] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 20:47:06] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2024-05-31 20:47:06] [INFO ] Invariant cache hit.
[2024-05-31 20:47:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 20:47:06] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-31 20:47:06] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2024-05-31 20:47:06] [INFO ] Invariant cache hit.
[2024-05-31 20:47:06] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 179/287 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 151 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6290 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 179/287 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 262/413 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 413 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7939 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 14487ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 14492ms
Starting structural reductions in LTL mode, iteration 1 : 108/164 places, 264/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14757 ms. Remains : 108/164 places, 264/408 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-00
Product exploration explored 100000 steps with 33333 reset in 289 ms.
Product exploration explored 100000 steps with 33333 reset in 180 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b008-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b008-LTLCardinality-00 finished in 15560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(p0)||(X(p1)&&F(p2)))))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 408/408 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 392
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 392
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 156 transition count 384
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 153 transition count 378
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 153 transition count 378
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 150 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 150 transition count 366
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 147 transition count 360
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 147 transition count 360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 145 transition count 352
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 145 transition count 352
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 143 transition count 344
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 143 transition count 344
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 141 transition count 340
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 141 transition count 340
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 139 transition count 336
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 139 transition count 336
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 137 transition count 332
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 137 transition count 332
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 135 transition count 328
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 135 transition count 328
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 133 transition count 324
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 133 transition count 324
Applied a total of 70 rules in 33 ms. Remains 133 /164 variables (removed 31) and now considering 324/408 (removed 84) transitions.
[2024-05-31 20:47:21] [INFO ] Flow matrix only has 223 transitions (discarded 101 similar events)
// Phase 1: matrix 223 rows 133 cols
[2024-05-31 20:47:21] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 20:47:21] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 20:47:21] [INFO ] Flow matrix only has 223 transitions (discarded 101 similar events)
[2024-05-31 20:47:21] [INFO ] Invariant cache hit.
[2024-05-31 20:47:22] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-31 20:47:22] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-05-31 20:47:22] [INFO ] Flow matrix only has 223 transitions (discarded 101 similar events)
[2024-05-31 20:47:22] [INFO ] Invariant cache hit.
[2024-05-31 20:47:22] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 223/355 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 50/184 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 322 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/356 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 0/356 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 185 constraints, problems are : Problem set: 0 solved, 322 unsolved in 10174 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 223/355 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 50/184 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 32/216 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/356 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 290/507 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 10 (OVERLAPS) 0/356 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 507 constraints, problems are : Problem set: 0 solved, 322 unsolved in 14378 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints]
After SMT, in 24846ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 24855ms
Starting structural reductions in LTL mode, iteration 1 : 133/164 places, 324/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25156 ms. Remains : 133/164 places, 324/408 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 714 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 12 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b008-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b008-LTLCardinality-03 finished in 25697 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&&(!p0 U p1)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 408/408 transitions.
Graph (complete) has 877 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 152 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 152 transition count 382
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 29 place count 152 transition count 376
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 146 transition count 364
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 146 transition count 364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 140 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 140 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 134 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 134 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 71 place count 128 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 128 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 122 transition count 290
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 94 place count 117 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 117 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 112 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 112 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 114 place count 107 transition count 258
Iterating global reduction 1 with 5 rules applied. Total rules applied 119 place count 107 transition count 258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 123 place count 103 transition count 250
Iterating global reduction 1 with 4 rules applied. Total rules applied 127 place count 103 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 100 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 99 transition count 242
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 137 place count 99 transition count 240
Applied a total of 137 rules in 98 ms. Remains 99 /164 variables (removed 65) and now considering 240/408 (removed 168) transitions.
[2024-05-31 20:47:47] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
// Phase 1: matrix 163 rows 99 cols
[2024-05-31 20:47:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:47:47] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-31 20:47:47] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2024-05-31 20:47:47] [INFO ] Invariant cache hit.
[2024-05-31 20:47:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 20:47:48] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-31 20:47:48] [INFO ] Redundant transitions in 11 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-31 20:47:48] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2024-05-31 20:47:48] [INFO ] Invariant cache hit.
[2024-05-31 20:47:48] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 163/262 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 140 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5615 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 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/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 163/262 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 238/378 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 378 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6441 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 12234ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 12237ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/164 places, 240/408 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12763 ms. Remains : 99/164 places, 240/408 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-09
Stuttering criterion allowed to conclude after 332 steps with 1 reset in 6 ms.
FORMULA FunctionPointer-PT-b008-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLCardinality-09 finished in 12892 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(F(p0)) U G(p1)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 408/408 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 408
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 152 transition count 382
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 152 transition count 382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 31 place count 152 transition count 374
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 36 place count 147 transition count 364
Iterating global reduction 2 with 5 rules applied. Total rules applied 41 place count 147 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 142 transition count 348
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 142 transition count 348
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 137 transition count 334
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 137 transition count 334
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 132 transition count 320
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 132 transition count 320
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 127 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 127 transition count 304
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 85 place count 123 transition count 294
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 123 transition count 294
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 119 transition count 286
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 119 transition count 286
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 116 transition count 280
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 116 transition count 280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 114 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 114 transition count 276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 112 transition count 272
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 112 transition count 272
Applied a total of 111 rules in 15 ms. Remains 112 /164 variables (removed 52) and now considering 272/408 (removed 136) transitions.
[2024-05-31 20:48:00] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
// Phase 1: matrix 186 rows 112 cols
[2024-05-31 20:48:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:48:00] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-31 20:48:00] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:48:00] [INFO ] Invariant cache hit.
[2024-05-31 20:48:00] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 20:48:00] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-31 20:48:00] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:48:00] [INFO ] Invariant cache hit.
[2024-05-31 20:48:00] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 158 constraints, problems are : Problem set: 0 solved, 270 unsolved in 7183 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 270/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 428 constraints, problems are : Problem set: 0 solved, 270 unsolved in 8052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 15493ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 15495ms
Starting structural reductions in LTL mode, iteration 1 : 112/164 places, 272/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15812 ms. Remains : 112/164 places, 272/408 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-10
Product exploration explored 100000 steps with 429 reset in 333 ms.
Product exploration explored 100000 steps with 385 reset in 401 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 (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40016 steps (53 resets) in 172 ms. (231 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (13 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
[2024-05-31 20:48:17] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:48:17] [INFO ] Invariant cache hit.
[2024-05-31 20:48:17] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
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) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/31 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 96/127 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 271/298 variables, and 98 constraints, problems are : Problem set: 1 solved, 0 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/112 constraints, ReadFeed: 5/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms 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 (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))))]
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-31 20:48:18] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:48:18] [INFO ] Invariant cache hit.
[2024-05-31 20:48:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 20:48:18] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:48:18] [INFO ] Invariant cache hit.
[2024-05-31 20:48:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 20:48:18] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-31 20:48:18] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:48:18] [INFO ] Invariant cache hit.
[2024-05-31 20:48:18] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 158 constraints, problems are : Problem set: 0 solved, 270 unsolved in 7047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 270/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 428 constraints, problems are : Problem set: 0 solved, 270 unsolved in 8363 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 15619ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 15623ms
Finished structural reductions in LTL mode , in 1 iterations and 15856 ms. Remains : 112/112 places, 272/272 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 : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 22060 steps (29 resets) in 113 ms. (193 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 437 reset in 221 ms.
Product exploration explored 100000 steps with 394 reset in 233 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 272/272 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 112 transition count 268
Applied a total of 4 rules in 29 ms. Remains 112 /112 variables (removed 0) and now considering 268/272 (removed 4) transitions.
[2024-05-31 20:48:36] [INFO ] Redundant transitions in 10 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-31 20:48:36] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 112 cols
[2024-05-31 20:48:36] [INFO ] Computed 2 invariants in 8 ms
[2024-05-31 20:48:36] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 184/296 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/296 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 158 constraints, problems are : Problem set: 0 solved, 266 unsolved in 6911 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 184/296 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 266/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/296 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 424 constraints, problems are : Problem set: 0 solved, 266 unsolved in 8311 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
After SMT, in 15426ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 15428ms
Starting structural reductions in SI_LTL mode, iteration 1 : 112/112 places, 268/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15475 ms. Remains : 112/112 places, 268/272 transitions.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-31 20:48:51] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
// Phase 1: matrix 186 rows 112 cols
[2024-05-31 20:48:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:48:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 20:48:51] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:48:51] [INFO ] Invariant cache hit.
[2024-05-31 20:48:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 20:48:51] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-31 20:48:51] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:48:51] [INFO ] Invariant cache hit.
[2024-05-31 20:48:51] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 158 constraints, problems are : Problem set: 0 solved, 270 unsolved in 6980 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 270/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 428 constraints, problems are : Problem set: 0 solved, 270 unsolved in 8215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 15404ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 15408ms
Finished structural reductions in LTL mode , in 1 iterations and 15673 ms. Remains : 112/112 places, 272/272 transitions.
Treatment of property FunctionPointer-PT-b008-LTLCardinality-10 finished in 66908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 408/408 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 408
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 153 transition count 384
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 153 transition count 384
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 153 transition count 378
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 33 place count 147 transition count 366
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 147 transition count 366
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 44 place count 142 transition count 350
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 142 transition count 350
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 137 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 137 transition count 338
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 132 transition count 322
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 132 transition count 322
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 128 transition count 308
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 128 transition count 308
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 125 transition count 302
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 125 transition count 302
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 122 transition count 296
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 122 transition count 296
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 119 transition count 290
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 119 transition count 290
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 116 transition count 284
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 116 transition count 284
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 113 transition count 278
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 113 transition count 278
Applied a total of 107 rules in 30 ms. Remains 113 /164 variables (removed 51) and now considering 278/408 (removed 130) transitions.
[2024-05-31 20:49:07] [INFO ] Flow matrix only has 188 transitions (discarded 90 similar events)
// Phase 1: matrix 188 rows 113 cols
[2024-05-31 20:49:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:49:07] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-05-31 20:49:07] [INFO ] Flow matrix only has 188 transitions (discarded 90 similar events)
[2024-05-31 20:49:07] [INFO ] Invariant cache hit.
[2024-05-31 20:49:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 20:49:08] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 20:49:08] [INFO ] Flow matrix only has 188 transitions (discarded 90 similar events)
[2024-05-31 20:49:08] [INFO ] Invariant cache hit.
[2024-05-31 20:49:08] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 188/301 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 43/158 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 276 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 158 constraints, problems are : Problem set: 0 solved, 276 unsolved in 7084 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 188/301 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 43/158 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 276/434 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 434 constraints, problems are : Problem set: 0 solved, 276 unsolved in 8689 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 16055ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 16062ms
Starting structural reductions in LTL mode, iteration 1 : 113/164 places, 278/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16775 ms. Remains : 113/164 places, 278/408 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-14
Stuttering criterion allowed to conclude after 161 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b008-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLCardinality-14 finished in 16883 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(F(p0)) U G(p1)))))'
Found a Lengthening insensitive property : FunctionPointer-PT-b008-LTLCardinality-10
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 164/164 places, 408/408 transitions.
Graph (complete) has 877 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 152 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 152 transition count 382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 31 place count 152 transition count 374
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 147 transition count 364
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 147 transition count 364
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 142 transition count 348
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 142 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 137 transition count 334
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 137 transition count 334
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 132 transition count 320
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 132 transition count 320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 127 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 127 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 123 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 123 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 119 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 119 transition count 286
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 116 transition count 280
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 116 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 114 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 114 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 112 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 112 transition count 272
Applied a total of 111 rules in 60 ms. Remains 112 /164 variables (removed 52) and now considering 272/408 (removed 136) transitions.
[2024-05-31 20:49:24] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
// Phase 1: matrix 186 rows 112 cols
[2024-05-31 20:49:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:49:24] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-31 20:49:24] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:49:24] [INFO ] Invariant cache hit.
[2024-05-31 20:49:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 20:49:24] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-31 20:49:25] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:49:25] [INFO ] Invariant cache hit.
[2024-05-31 20:49:25] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 158 constraints, problems are : Problem set: 0 solved, 270 unsolved in 7008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 270/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 428 constraints, problems are : Problem set: 0 solved, 270 unsolved in 8386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 15665ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 15667ms
Starting structural reductions in LI_LTL mode, iteration 1 : 112/164 places, 272/408 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 16167 ms. Remains : 112/164 places, 272/408 transitions.
Running random walk in product with property : FunctionPointer-PT-b008-LTLCardinality-10
Product exploration explored 100000 steps with 401 reset in 250 ms.
Product exploration explored 100000 steps with 422 reset in 255 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 (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40005 steps (56 resets) in 73 ms. (540 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2024-05-31 20:49:41] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:49:41] [INFO ] Invariant cache hit.
[2024-05-31 20:49:41] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
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) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/31 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 96/127 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 271/298 variables, and 98 constraints, problems are : Problem set: 1 solved, 0 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/112 constraints, ReadFeed: 5/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 199ms 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 (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))))]
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 272/272 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-31 20:49:42] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:49:42] [INFO ] Invariant cache hit.
[2024-05-31 20:49:42] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 20:49:42] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:49:42] [INFO ] Invariant cache hit.
[2024-05-31 20:49:42] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 20:49:42] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-31 20:49:42] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:49:42] [INFO ] Invariant cache hit.
[2024-05-31 20:49:42] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 158 constraints, problems are : Problem set: 0 solved, 270 unsolved in 7280 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 270/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 428 constraints, problems are : Problem set: 0 solved, 270 unsolved in 8326 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 15852ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 15855ms
Finished structural reductions in LTL mode , in 1 iterations and 16147 ms. Remains : 112/112 places, 272/272 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 : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 28365 steps (39 resets) in 99 ms. (283 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 428 reset in 229 ms.
Product exploration explored 100000 steps with 427 reset in 238 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 272/272 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 112 transition count 268
Applied a total of 4 rules in 18 ms. Remains 112 /112 variables (removed 0) and now considering 268/272 (removed 4) transitions.
[2024-05-31 20:50:00] [INFO ] Redundant transitions in 7 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-31 20:50:00] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 112 cols
[2024-05-31 20:50:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:50:00] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 184/296 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/296 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 158 constraints, problems are : Problem set: 0 solved, 266 unsolved in 7071 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 184/296 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 266/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/296 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 424 constraints, problems are : Problem set: 0 solved, 266 unsolved in 8322 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
After SMT, in 15615ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 15617ms
Starting structural reductions in SI_LTL mode, iteration 1 : 112/112 places, 268/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15664 ms. Remains : 112/112 places, 268/272 transitions.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 272/272 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-31 20:50:15] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
// Phase 1: matrix 186 rows 112 cols
[2024-05-31 20:50:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:50:16] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 20:50:16] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:50:16] [INFO ] Invariant cache hit.
[2024-05-31 20:50:16] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 20:50:16] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-31 20:50:16] [INFO ] Flow matrix only has 186 transitions (discarded 86 similar events)
[2024-05-31 20:50:16] [INFO ] Invariant cache hit.
[2024-05-31 20:50:16] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 158 constraints, problems are : Problem set: 0 solved, 270 unsolved in 7011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 44/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 270/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 428 constraints, problems are : Problem set: 0 solved, 270 unsolved in 8621 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 15853ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 15856ms
Finished structural reductions in LTL mode , in 1 iterations and 16132 ms. Remains : 112/112 places, 272/272 transitions.
Treatment of property FunctionPointer-PT-b008-LTLCardinality-10 finished in 67874 ms.
[2024-05-31 20:50:32] [INFO ] Flatten gal took : 29 ms
[2024-05-31 20:50:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 20:50:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 164 places, 408 transitions and 1646 arcs took 6 ms.
Total runtime 244989 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-b008-LTLCardinality-10

BK_STOP 1717188647129

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-b008-LTLCardinality-10
ltl formula formula --ltl=/tmp/1257/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 164 places, 408 transitions and 1646 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.060 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1257/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1257/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1257/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1257/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 164 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 421 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~31936 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~63052 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~125272 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~249728 transitions
pnml2lts-mc( 0/ 4): ~40000 levels ~160000 states ~498592 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~996380 transitions
pnml2lts-mc( 0/ 4): ~160000 levels ~640000 states ~1991936 transitions
pnml2lts-mc( 0/ 4): ~320000 levels ~1280000 states ~3983052 transitions
pnml2lts-mc( 0/ 4): ~640000 levels ~2560000 states ~7965272 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2846739
pnml2lts-mc( 0/ 4): unique transitions count: 10873446
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 920288
pnml2lts-mc( 0/ 4): - claim success count: 2846751
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2846751
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2846751 states 10873485 transitions, fanout: 3.820
pnml2lts-mc( 0/ 4): Total exploration time 14.200 sec (14.160 sec minimum, 14.180 sec on average)
pnml2lts-mc( 0/ 4): States per second: 200475, Transitions per second: 765738
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 134.1MB, 15.3 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 27.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 411 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 134.1MB (~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-b008"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-b008, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640602900235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b008.tgz
mv FunctionPointer-PT-b008 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;