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-171640602900219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FunctionPointer-PT-b002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602900219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717187660089

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-b002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:34:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:34:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:34:21] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-31 20:34:21] [INFO ] Transformed 306 places.
[2024-05-31 20:34:21] [INFO ] Transformed 840 transitions.
[2024-05-31 20:34:21] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b002-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 35 place count 187 transition count 510
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 187 transition count 510
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 96 place count 187 transition count 474
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 175 transition count 450
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 175 transition count 450
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 175 transition count 442
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 133 place count 170 transition count 432
Iterating global reduction 3 with 5 rules applied. Total rules applied 138 place count 170 transition count 432
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 143 place count 165 transition count 412
Iterating global reduction 3 with 5 rules applied. Total rules applied 148 place count 165 transition count 412
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 153 place count 160 transition count 402
Iterating global reduction 3 with 5 rules applied. Total rules applied 158 place count 160 transition count 402
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 159 transition count 398
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 159 transition count 398
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 158 transition count 394
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 158 transition count 394
Applied a total of 162 rules in 88 ms. Remains 158 /222 variables (removed 64) and now considering 394/648 (removed 254) transitions.
[2024-05-31 20:34:21] [INFO ] Flow matrix only has 271 transitions (discarded 123 similar events)
// Phase 1: matrix 271 rows 158 cols
[2024-05-31 20:34:21] [INFO ] Computed 2 invariants in 19 ms
[2024-05-31 20:34:22] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-31 20:34:22] [INFO ] Flow matrix only has 271 transitions (discarded 123 similar events)
[2024-05-31 20:34:22] [INFO ] Invariant cache hit.
[2024-05-31 20:34:22] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-31 20:34:22] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-05-31 20:34:22] [INFO ] Flow matrix only has 271 transitions (discarded 123 similar events)
[2024-05-31 20:34:22] [INFO ] Invariant cache hit.
[2024-05-31 20:34:22] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 271/429 variables, 158/160 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 60/220 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 392 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 220 constraints, problems are : Problem set: 0 solved, 392 unsolved in 13354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 271/429 variables, 158/160 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 60/220 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 392/612 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 0/429 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 612 constraints, problems are : Problem set: 0 solved, 392 unsolved in 16430 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints]
After SMT, in 30413ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 30438ms
Starting structural reductions in LTL mode, iteration 1 : 158/222 places, 394/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31117 ms. Remains : 158/222 places, 394/648 transitions.
Support contains 26 out of 158 places after structural reductions.
[2024-05-31 20:34:52] [INFO ] Flatten gal took : 50 ms
[2024-05-31 20:34:53] [INFO ] Flatten gal took : 24 ms
[2024-05-31 20:34:53] [INFO ] Input system was already deterministic with 394 transitions.
RANDOM walk for 37818 steps (55 resets) in 1853 ms. (20 steps per ms) remains 0/18 properties
FORMULA FunctionPointer-PT-b002-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(G(p0))&&G(p1)))||G(p2))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 149 transition count 368
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 149 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 149 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 142 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 142 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 136 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 136 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 130 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 130 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 124 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 124 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 119 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 114 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 114 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 109 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 107 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 107 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 105 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 104 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 104 transition count 254
Applied a total of 112 rules in 29 ms. Remains 104 /158 variables (removed 54) and now considering 254/394 (removed 140) transitions.
[2024-05-31 20:34:53] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2024-05-31 20:34:53] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:34:53] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 20:34:53] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 20:34:53] [INFO ] Invariant cache hit.
[2024-05-31 20:34:54] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:34:54] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-31 20:34:54] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 20:34:54] [INFO ] Invariant cache hit.
[2024-05-31 20:34:54] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 146 constraints, problems are : Problem set: 0 solved, 252 unsolved in 5711 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 252/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 398 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6496 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 12454ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 12458ms
Starting structural reductions in LTL mode, iteration 1 : 104/158 places, 254/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12737 ms. Remains : 104/158 places, 254/394 transitions.
Stuttering acceptance computed with spot in 397 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-01
Product exploration explored 100000 steps with 313 reset in 294 ms.
Product exploration explored 100000 steps with 314 reset in 229 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 370 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
RANDOM walk for 40000 steps (83 resets) in 143 ms. (277 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (16 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
[2024-05-31 20:35:08] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 20:35:08] [INFO ] Invariant cache hit.
[2024-05-31 20:35:08] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 48/276 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/104 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 15 factoid took 410 ms. Reduced automaton from 6 states, 19 edges and 2 AP (stutter insensitive) to 8 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 254/254 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 252
Applied a total of 2 rules in 38 ms. Remains 104 /104 variables (removed 0) and now considering 252/254 (removed 2) transitions.
[2024-05-31 20:35:09] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2024-05-31 20:35:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:35:09] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-31 20:35:09] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 20:35:09] [INFO ] Invariant cache hit.
[2024-05-31 20:35:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:35:09] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-31 20:35:09] [INFO ] Redundant transitions in 11 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 20:35:09] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 20:35:09] [INFO ] Invariant cache hit.
[2024-05-31 20:35:09] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/275 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 146 constraints, problems are : Problem set: 0 solved, 250 unsolved in 5792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/275 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 250/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 396 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6596 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 12583ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 12586ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 252/254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12887 ms. Remains : 104/104 places, 252/254 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/252 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 301 ms. Reduced automaton from 8 states, 26 edges and 2 AP (stutter insensitive) to 8 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
RANDOM walk for 40004 steps (90 resets) in 108 ms. (367 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (36 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
[2024-05-31 20:35:22] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 20:35:22] [INFO ] Invariant cache hit.
[2024-05-31 20:35:22] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 48/275 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/104 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 32ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 448 ms. Reduced automaton from 8 states, 26 edges and 2 AP (stutter insensitive) to 8 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Product exploration explored 100000 steps with 526 reset in 175 ms.
Product exploration explored 100000 steps with 542 reset in 166 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 252/252 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 102 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 102 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 100 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 100 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 99 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 99 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 234
Applied a total of 16 rules in 34 ms. Remains 97 /104 variables (removed 7) and now considering 234/252 (removed 18) transitions.
[2024-05-31 20:35:24] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-31 20:35:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:35:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 20:35:24] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:35:24] [INFO ] Invariant cache hit.
[2024-05-31 20:35:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:35:25] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-31 20:35:25] [INFO ] Redundant transitions in 3 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 20:35:25] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:35:25] [INFO ] Invariant cache hit.
[2024-05-31 20:35:25] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 232 unsolved in 4795 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 232/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 368 constraints, problems are : Problem set: 0 solved, 232 unsolved in 5967 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
After SMT, in 10929ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 10931ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/104 places, 234/252 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11189 ms. Remains : 97/104 places, 234/252 transitions.
Treatment of property FunctionPointer-PT-b002-LTLCardinality-01 finished in 42205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 149 transition count 368
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 149 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 149 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 142 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 142 transition count 344
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 135 transition count 324
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 135 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 129 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 129 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 123 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 123 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 118 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 118 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 113 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 113 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 97 place count 110 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 108 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 106 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 106 transition count 256
Applied a total of 112 rules in 63 ms. Remains 106 /158 variables (removed 52) and now considering 256/394 (removed 138) transitions.
[2024-05-31 20:35:36] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2024-05-31 20:35:36] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:35:36] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 20:35:36] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 20:35:36] [INFO ] Invariant cache hit.
[2024-05-31 20:35:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:35:36] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-31 20:35:36] [INFO ] Redundant transitions in 3 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-31 20:35:36] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 20:35:36] [INFO ] Invariant cache hit.
[2024-05-31 20:35:36] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 5947 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 402 constraints, problems are : Problem set: 0 solved, 254 unsolved in 7065 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 13206ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 13209ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/158 places, 256/394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13515 ms. Remains : 106/158 places, 256/394 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-02
Product exploration explored 100000 steps with 586 reset in 158 ms.
Stack based approach found an accepted trace after 8987 steps with 53 reset with depth 18 and stack size 18 in 16 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-02 finished in 13755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 370
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 150 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 144 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 139 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 139 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 134 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 134 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 129 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 129 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 125 transition count 302
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 125 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 121 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 121 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 119 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 119 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 117 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 117 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 116 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 115 transition count 280
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 115 transition count 280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 114 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 114 transition count 278
Applied a total of 92 rules in 22 ms. Remains 114 /158 variables (removed 44) and now considering 278/394 (removed 116) transitions.
[2024-05-31 20:35:49] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
// Phase 1: matrix 190 rows 114 cols
[2024-05-31 20:35:49] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:35:49] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-31 20:35:49] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2024-05-31 20:35:49] [INFO ] Invariant cache hit.
[2024-05-31 20:35:50] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 20:35:50] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 20:35:50] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2024-05-31 20:35:50] [INFO ] Invariant cache hit.
[2024-05-31 20:35:50] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 190/304 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 276 unsolved in 6872 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 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/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 190/304 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 276/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 436 constraints, problems are : Problem set: 0 solved, 276 unsolved in 8219 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 15319ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 15323ms
Starting structural reductions in LTL mode, iteration 1 : 114/158 places, 278/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15761 ms. Remains : 114/158 places, 278/394 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-03
Product exploration explored 100000 steps with 305 reset in 211 ms.
Product exploration explored 100000 steps with 359 reset in 240 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 (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 89 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40002 steps (81 resets) in 167 ms. (238 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (19 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
[2024-05-31 20:36:06] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2024-05-31 20:36:06] [INFO ] Invariant cache hit.
[2024-05-31 20:36:06] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/166 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/228 variables, 13/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 30/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/290 variables, 29/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 9/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/290 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/303 variables, 11/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/304 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/166 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/228 variables, 13/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 30/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/290 variables, 29/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/290 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/290 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/303 variables, 11/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/304 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/304 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/304 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 210ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 278/278 transitions.
Graph (complete) has 464 edges and 114 vertex of which 90 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 90 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 90 transition count 224
Applied a total of 55 rules in 15 ms. Remains 90 /114 variables (removed 24) and now considering 224/278 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 90/114 places, 224/278 transitions.
RANDOM walk for 40000 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31292 steps (7 resets) in 26 ms. (1158 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 208 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 278/278 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2024-05-31 20:36:07] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2024-05-31 20:36:07] [INFO ] Invariant cache hit.
[2024-05-31 20:36:07] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 20:36:07] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2024-05-31 20:36:07] [INFO ] Invariant cache hit.
[2024-05-31 20:36:07] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 20:36:07] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 20:36:07] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2024-05-31 20:36:07] [INFO ] Invariant cache hit.
[2024-05-31 20:36:07] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 190/304 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 276 unsolved in 6865 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 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/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 190/304 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 276/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 436 constraints, problems are : Problem set: 0 solved, 276 unsolved in 8366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 15458ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 15462ms
Finished structural reductions in LTL mode , in 1 iterations and 15731 ms. Remains : 114/114 places, 278/278 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 (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (72 resets) in 81 ms. (487 steps per ms) remains 1/3 properties
BEST_FIRST walk for 38253 steps (17 resets) in 88 ms. (429 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p0))), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 369 reset in 185 ms.
Stuttering criterion allowed to conclude after 67949 steps with 229 reset in 144 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-03 finished in 34741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0||G(p1)))||G(p2)))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 151 transition count 376
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 151 transition count 376
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 22 place count 151 transition count 368
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 146 transition count 354
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 146 transition count 354
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 141 transition count 342
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 141 transition count 342
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 136 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 136 transition count 330
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 132 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 132 transition count 322
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 129 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 129 transition count 314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 126 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 126 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 125 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 125 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 124 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 124 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 123 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 123 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 122 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 122 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 121 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 121 transition count 296
Applied a total of 82 rules in 16 ms. Remains 121 /158 variables (removed 37) and now considering 296/394 (removed 98) transitions.
[2024-05-31 20:36:24] [INFO ] Flow matrix only has 201 transitions (discarded 95 similar events)
// Phase 1: matrix 201 rows 121 cols
[2024-05-31 20:36:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:36:24] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 20:36:24] [INFO ] Flow matrix only has 201 transitions (discarded 95 similar events)
[2024-05-31 20:36:24] [INFO ] Invariant cache hit.
[2024-05-31 20:36:24] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-31 20:36:24] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-31 20:36:24] [INFO ] Flow matrix only has 201 transitions (discarded 95 similar events)
[2024-05-31 20:36:24] [INFO ] Invariant cache hit.
[2024-05-31 20:36:24] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 201/322 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 46/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 169 constraints, problems are : Problem set: 0 solved, 294 unsolved in 7638 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 201/322 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 46/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 294/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 463 constraints, problems are : Problem set: 0 solved, 294 unsolved in 9483 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
After SMT, in 17355ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 17360ms
Starting structural reductions in LTL mode, iteration 1 : 121/158 places, 296/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17645 ms. Remains : 121/158 places, 296/394 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 153 ms.
Product exploration explored 100000 steps with 33333 reset in 143 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 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b002-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b002-LTLCardinality-05 finished in 18104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 370
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 150 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 138 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 138 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 133 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 133 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 128 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 128 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 123 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 118 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 118 transition count 284
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 115 transition count 278
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 115 transition count 278
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 113 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 113 transition count 274
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 112 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 111 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 111 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 111 transition count 266
Applied a total of 102 rules in 39 ms. Remains 111 /158 variables (removed 47) and now considering 266/394 (removed 128) transitions.
[2024-05-31 20:36:42] [INFO ] Flow matrix only has 183 transitions (discarded 83 similar events)
// Phase 1: matrix 183 rows 111 cols
[2024-05-31 20:36:42] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:36:42] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 20:36:42] [INFO ] Flow matrix only has 183 transitions (discarded 83 similar events)
[2024-05-31 20:36:42] [INFO ] Invariant cache hit.
[2024-05-31 20:36:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 20:36:42] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-31 20:36:42] [INFO ] Redundant transitions in 2 ms returned []
Running 264 sub problems to find dead transitions.
[2024-05-31 20:36:42] [INFO ] Flow matrix only has 183 transitions (discarded 83 similar events)
[2024-05-31 20:36:42] [INFO ] Invariant cache hit.
[2024-05-31 20:36:42] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 183/294 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 264 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 156 constraints, problems are : Problem set: 0 solved, 264 unsolved in 6642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 183/294 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 264/420 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 420 constraints, problems are : Problem set: 0 solved, 264 unsolved in 7772 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
After SMT, in 14640ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 14644ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/158 places, 266/394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14955 ms. Remains : 111/158 places, 266/394 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-06
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-06 finished in 15005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 370
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 150 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 138 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 132 transition count 316
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 132 transition count 316
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 126 transition count 302
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 126 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 116 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 116 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 91 place count 113 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 94 place count 113 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 111 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 111 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 110 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 110 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 109 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 109 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 109 transition count 262
Applied a total of 106 rules in 66 ms. Remains 109 /158 variables (removed 49) and now considering 262/394 (removed 132) transitions.
[2024-05-31 20:36:57] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 109 cols
[2024-05-31 20:36:57] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:36:57] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-31 20:36:57] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-31 20:36:57] [INFO ] Invariant cache hit.
[2024-05-31 20:36:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 20:36:58] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-31 20:36:58] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-31 20:36:58] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-31 20:36:58] [INFO ] Invariant cache hit.
[2024-05-31 20:36:58] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 152 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6210 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 260/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 412 constraints, problems are : Problem set: 0 solved, 260 unsolved in 7077 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 13505ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 13508ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/158 places, 262/394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13928 ms. Remains : 109/158 places, 262/394 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-11
Product exploration explored 100000 steps with 614 reset in 143 ms.
Product exploration explored 100000 steps with 587 reset in 161 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 11203 steps (30 resets) in 23 ms. (466 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-31 20:37:12] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-31 20:37:12] [INFO ] Invariant cache hit.
[2024-05-31 20:37:12] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-31 20:37:12] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-31 20:37:12] [INFO ] Invariant cache hit.
[2024-05-31 20:37:12] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 20:37:12] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-31 20:37:12] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-31 20:37:12] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-31 20:37:12] [INFO ] Invariant cache hit.
[2024-05-31 20:37:12] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 152 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 260/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 412 constraints, problems are : Problem set: 0 solved, 260 unsolved in 7452 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 13866ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 13871ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14133 ms. Remains : 109/109 places, 262/262 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16797 steps (54 resets) in 34 ms. (479 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 579 reset in 147 ms.
Product exploration explored 100000 steps with 543 reset in 158 ms.
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 262/262 transitions.
Applied a total of 0 rules in 11 ms. Remains 109 /109 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-31 20:37:27] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-31 20:37:27] [INFO ] Invariant cache hit.
[2024-05-31 20:37:27] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 20:37:27] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-31 20:37:27] [INFO ] Invariant cache hit.
[2024-05-31 20:37:27] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 20:37:27] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-05-31 20:37:27] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-31 20:37:27] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2024-05-31 20:37:27] [INFO ] Invariant cache hit.
[2024-05-31 20:37:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 152 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 260/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 412 constraints, problems are : Problem set: 0 solved, 260 unsolved in 7469 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 13841ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 13845ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14108 ms. Remains : 109/109 places, 262/262 transitions.
Treatment of property FunctionPointer-PT-b002-LTLCardinality-11 finished in 43862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0 U (p1||G(p0)))))))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 150 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 143 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 143 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 136 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 136 transition count 328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 129 transition count 310
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 129 transition count 310
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 67 place count 122 transition count 294
Iterating global reduction 1 with 7 rules applied. Total rules applied 74 place count 122 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 116 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 116 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 110 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 110 transition count 264
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 106 transition count 256
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 106 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 103 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 103 transition count 250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 101 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 101 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 99 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 98 transition count 240
Applied a total of 122 rules in 16 ms. Remains 98 /158 variables (removed 60) and now considering 240/394 (removed 154) transitions.
[2024-05-31 20:37:41] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2024-05-31 20:37:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:37:41] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 20:37:41] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:37:41] [INFO ] Invariant cache hit.
[2024-05-31 20:37:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:37:41] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-31 20:37:41] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:37:41] [INFO ] Invariant cache hit.
[2024-05-31 20:37:41] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 375 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6515 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 11689ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 11692ms
Starting structural reductions in LTL mode, iteration 1 : 98/158 places, 240/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11952 ms. Remains : 98/158 places, 240/394 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-12
Product exploration explored 100000 steps with 20000 reset in 106 ms.
Product exploration explored 100000 steps with 20000 reset in 111 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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (80 resets) in 105 ms. (377 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
[2024-05-31 20:37:54] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:37:54] [INFO ] Invariant cache hit.
[2024-05-31 20:37:54] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 49/259 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/98 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 23ms 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), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-31 20:37:54] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:37:54] [INFO ] Invariant cache hit.
[2024-05-31 20:37:54] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 20:37:54] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:37:54] [INFO ] Invariant cache hit.
[2024-05-31 20:37:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:37:55] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-31 20:37:55] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:37:55] [INFO ] Invariant cache hit.
[2024-05-31 20:37:55] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 4993 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 375 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6486 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 11649ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 11653ms
Finished structural reductions in LTL mode , in 1 iterations and 11874 ms. Remains : 98/98 places, 240/240 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 : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 504 steps (0 resets) in 7 ms. (63 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 134 ms.
Product exploration explored 100000 steps with 20000 reset in 141 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 240/240 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 238
Applied a total of 2 rules in 13 ms. Remains 98 /98 variables (removed 0) and now considering 238/240 (removed 2) transitions.
[2024-05-31 20:38:08] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-31 20:38:08] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
// Phase 1: matrix 160 rows 98 cols
[2024-05-31 20:38:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:38:08] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 373 constraints, problems are : Problem set: 0 solved, 236 unsolved in 6285 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 11482ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 11487ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/98 places, 238/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11512 ms. Remains : 98/98 places, 238/240 transitions.
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-31 20:38:19] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2024-05-31 20:38:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:38:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 20:38:19] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:38:19] [INFO ] Invariant cache hit.
[2024-05-31 20:38:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:38:20] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-31 20:38:20] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:38:20] [INFO ] Invariant cache hit.
[2024-05-31 20:38:20] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 375 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 11720ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 11723ms
Finished structural reductions in LTL mode , in 1 iterations and 11965 ms. Remains : 98/98 places, 240/240 transitions.
Treatment of property FunctionPointer-PT-b002-LTLCardinality-12 finished in 50305 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 U G(!p0))))'
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 372
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 150 transition count 368
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 144 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 138 transition count 334
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 138 transition count 334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 132 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 132 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 126 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 126 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 116 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 116 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 112 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 109 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 107 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 107 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 105 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 104 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 104 transition count 254
Applied a total of 112 rules in 29 ms. Remains 104 /158 variables (removed 54) and now considering 254/394 (removed 140) transitions.
[2024-05-31 20:38:31] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2024-05-31 20:38:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:38:31] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 20:38:31] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 20:38:31] [INFO ] Invariant cache hit.
[2024-05-31 20:38:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:38:32] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-31 20:38:32] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 20:38:32] [INFO ] Invariant cache hit.
[2024-05-31 20:38:32] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 146 constraints, problems are : Problem set: 0 solved, 252 unsolved in 5852 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 252/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 398 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6612 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 12656ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 12659ms
Starting structural reductions in LTL mode, iteration 1 : 104/158 places, 254/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12931 ms. Remains : 104/158 places, 254/394 transitions.
Stuttering acceptance computed with spot in 219 ms :[p0, p0, p0, true]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 35856 steps with 122 reset in 91 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-13 finished in 13265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 372
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 150 transition count 368
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 144 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 144 transition count 352
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 139 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 139 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 134 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 134 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 129 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 129 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 119 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 115 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 115 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 112 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 112 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 110 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 108 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 107 transition count 260
Applied a total of 106 rules in 29 ms. Remains 107 /158 variables (removed 51) and now considering 260/394 (removed 134) transitions.
[2024-05-31 20:38:45] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
// Phase 1: matrix 178 rows 107 cols
[2024-05-31 20:38:45] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:38:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 20:38:45] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 20:38:45] [INFO ] Invariant cache hit.
[2024-05-31 20:38:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 20:38:45] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-31 20:38:45] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 20:38:45] [INFO ] Invariant cache hit.
[2024-05-31 20:38:45] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 151 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 258/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 409 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7329 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 13651ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 13655ms
Starting structural reductions in LTL mode, iteration 1 : 107/158 places, 260/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13912 ms. Remains : 107/158 places, 260/394 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 154 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-14 finished in 14119 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(p1)))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 150 transition count 368
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 144 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 138 transition count 334
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 138 transition count 334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 132 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 132 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 126 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 126 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 116 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 116 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 113 transition count 272
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 113 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 110 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 108 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 108 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 106 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 105 transition count 256
Applied a total of 108 rules in 22 ms. Remains 105 /158 variables (removed 53) and now considering 256/394 (removed 138) transitions.
[2024-05-31 20:38:59] [INFO ] Flow matrix only has 175 transitions (discarded 81 similar events)
// Phase 1: matrix 175 rows 105 cols
[2024-05-31 20:38:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:38:59] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 20:38:59] [INFO ] Flow matrix only has 175 transitions (discarded 81 similar events)
[2024-05-31 20:38:59] [INFO ] Invariant cache hit.
[2024-05-31 20:38:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 20:38:59] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-05-31 20:38:59] [INFO ] Flow matrix only has 175 transitions (discarded 81 similar events)
[2024-05-31 20:38:59] [INFO ] Invariant cache hit.
[2024-05-31 20:38:59] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 175/280 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 42/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 149 constraints, problems are : Problem set: 0 solved, 254 unsolved in 5823 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 175/280 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 42/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/403 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 403 constraints, problems are : Problem set: 0 solved, 254 unsolved in 7127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 13117ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 13120ms
Starting structural reductions in LTL mode, iteration 1 : 105/158 places, 256/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13359 ms. Remains : 105/158 places, 256/394 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b002-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b002-LTLCardinality-15 finished in 13746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(G(p0))&&G(p1)))||G(p2))))'
Found a Lengthening insensitive property : FunctionPointer-PT-b002-LTLCardinality-01
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 149 transition count 368
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 149 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 149 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 142 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 142 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 136 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 136 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 130 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 130 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 124 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 124 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 119 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 114 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 114 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 109 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 107 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 107 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 105 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 104 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 104 transition count 254
Applied a total of 112 rules in 21 ms. Remains 104 /158 variables (removed 54) and now considering 254/394 (removed 140) transitions.
[2024-05-31 20:39:13] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2024-05-31 20:39:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:39:13] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 20:39:13] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 20:39:13] [INFO ] Invariant cache hit.
[2024-05-31 20:39:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:39:13] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-31 20:39:13] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 20:39:13] [INFO ] Invariant cache hit.
[2024-05-31 20:39:13] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 146 constraints, problems are : Problem set: 0 solved, 252 unsolved in 5546 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/276 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 252/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 398 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6339 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 12053ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 12056ms
Starting structural reductions in LI_LTL mode, iteration 1 : 104/158 places, 254/394 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12301 ms. Remains : 104/158 places, 254/394 transitions.
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-01
Product exploration explored 100000 steps with 326 reset in 159 ms.
Product exploration explored 100000 steps with 319 reset in 173 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 406 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
RANDOM walk for 40002 steps (65 resets) in 110 ms. (360 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (21 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2024-05-31 20:39:26] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 20:39:26] [INFO ] Invariant cache hit.
[2024-05-31 20:39:26] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 48/276 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/104 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 33ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 15 factoid took 464 ms. Reduced automaton from 6 states, 19 edges and 2 AP (stutter insensitive) to 8 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 254/254 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 252
Applied a total of 2 rules in 11 ms. Remains 104 /104 variables (removed 0) and now considering 252/254 (removed 2) transitions.
[2024-05-31 20:39:27] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2024-05-31 20:39:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:39:27] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-31 20:39:27] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 20:39:27] [INFO ] Invariant cache hit.
[2024-05-31 20:39:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:39:28] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-31 20:39:28] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 20:39:28] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 20:39:28] [INFO ] Invariant cache hit.
[2024-05-31 20:39:28] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/275 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 146 constraints, problems are : Problem set: 0 solved, 250 unsolved in 5714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/275 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 250/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 396 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6637 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 12544ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 12548ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 252/254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12864 ms. Remains : 104/104 places, 252/254 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/252 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 310 ms. Reduced automaton from 8 states, 26 edges and 2 AP (stutter insensitive) to 8 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
RANDOM walk for 40002 steps (118 resets) in 87 ms. (454 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
[2024-05-31 20:39:41] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 20:39:41] [INFO ] Invariant cache hit.
[2024-05-31 20:39:41] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 48/275 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/104 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 429 ms. Reduced automaton from 8 states, 26 edges and 2 AP (stutter insensitive) to 8 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), false, (AND p1 (NOT p0)), false, false]
Product exploration explored 100000 steps with 537 reset in 158 ms.
Product exploration explored 100000 steps with 520 reset in 166 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 252/252 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 102 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 102 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 100 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 100 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 99 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 99 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 234
Applied a total of 16 rules in 16 ms. Remains 97 /104 variables (removed 7) and now considering 234/252 (removed 18) transitions.
[2024-05-31 20:39:43] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-31 20:39:43] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:39:43] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 20:39:43] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:39:43] [INFO ] Invariant cache hit.
[2024-05-31 20:39:43] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:39:43] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-31 20:39:43] [INFO ] Redundant transitions in 0 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 20:39:43] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:39:43] [INFO ] Invariant cache hit.
[2024-05-31 20:39:43] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 232 unsolved in 4878 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 232/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 368 constraints, problems are : Problem set: 0 solved, 232 unsolved in 5888 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
After SMT, in 10908ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 10911ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/104 places, 234/252 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11148 ms. Remains : 97/104 places, 234/252 transitions.
Treatment of property FunctionPointer-PT-b002-LTLCardinality-01 finished in 41343 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0 U (p1||G(p0)))))))))'
Found a Shortening insensitive property : FunctionPointer-PT-b002-LTLCardinality-12
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 158/158 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 150 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 150 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 150 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 143 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 143 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 136 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 136 transition count 328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 129 transition count 310
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 129 transition count 310
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 67 place count 122 transition count 294
Iterating global reduction 1 with 7 rules applied. Total rules applied 74 place count 122 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 116 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 116 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 110 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 110 transition count 264
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 106 transition count 256
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 106 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 103 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 103 transition count 250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 101 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 101 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 99 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 98 transition count 240
Applied a total of 122 rules in 39 ms. Remains 98 /158 variables (removed 60) and now considering 240/394 (removed 154) transitions.
[2024-05-31 20:39:54] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2024-05-31 20:39:54] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 20:39:54] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 20:39:54] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:39:54] [INFO ] Invariant cache hit.
[2024-05-31 20:39:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:39:55] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-31 20:39:55] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:39:55] [INFO ] Invariant cache hit.
[2024-05-31 20:39:55] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 4999 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 375 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6295 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 11472ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 11473ms
Starting structural reductions in LI_LTL mode, iteration 1 : 98/158 places, 240/394 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11891 ms. Remains : 98/158 places, 240/394 transitions.
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-12
Product exploration explored 100000 steps with 20000 reset in 107 ms.
Product exploration explored 100000 steps with 20000 reset in 114 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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40001 steps (90 resets) in 78 ms. (506 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (22 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-05-31 20:40:07] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:40:07] [INFO ] Invariant cache hit.
[2024-05-31 20:40:07] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 49/259 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/98 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 30ms 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), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 240/240 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-31 20:40:07] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:40:07] [INFO ] Invariant cache hit.
[2024-05-31 20:40:07] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 20:40:07] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:40:07] [INFO ] Invariant cache hit.
[2024-05-31 20:40:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:40:07] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-31 20:40:07] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:40:07] [INFO ] Invariant cache hit.
[2024-05-31 20:40:07] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 375 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6373 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 11590ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 11593ms
Finished structural reductions in LTL mode , in 1 iterations and 11858 ms. Remains : 98/98 places, 240/240 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 : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 436 steps (0 resets) in 8 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 120 ms.
Product exploration explored 100000 steps with 20000 reset in 115 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 240/240 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 238
Applied a total of 2 rules in 11 ms. Remains 98 /98 variables (removed 0) and now considering 238/240 (removed 2) transitions.
[2024-05-31 20:40:21] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-31 20:40:21] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
// Phase 1: matrix 160 rows 98 cols
[2024-05-31 20:40:21] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:40:21] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5279 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 373 constraints, problems are : Problem set: 0 solved, 236 unsolved in 6105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 11526ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 11531ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/98 places, 238/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11564 ms. Remains : 98/98 places, 238/240 transitions.
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-31 20:40:32] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2024-05-31 20:40:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:40:32] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 20:40:32] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:40:32] [INFO ] Invariant cache hit.
[2024-05-31 20:40:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:40:33] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-31 20:40:33] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 20:40:33] [INFO ] Invariant cache hit.
[2024-05-31 20:40:33] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5098 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 375 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 11617ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 11621ms
Finished structural reductions in LTL mode , in 1 iterations and 11866 ms. Remains : 98/98 places, 240/240 transitions.
Treatment of property FunctionPointer-PT-b002-LTLCardinality-12 finished in 50290 ms.
[2024-05-31 20:40:44] [INFO ] Flatten gal took : 19 ms
[2024-05-31 20:40:44] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 20:40:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 394 transitions and 1588 arcs took 7 ms.
Total runtime 383425 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-b002-LTLCardinality-01
Could not compute solution for formula : FunctionPointer-PT-b002-LTLCardinality-11
FORMULA FunctionPointer-PT-b002-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717188065483

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-b002-LTLCardinality-01
ltl formula formula --ltl=/tmp/2358/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 158 places, 394 transitions and 1588 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2358/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2358/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2358/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2358/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 159 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 159, there are 415 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( 2/ 4): ~2500 levels ~10000 states ~33296 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~66628 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~133296 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~266628 transitions
pnml2lts-mc( 2/ 4): ~40000 levels ~160000 states ~533296 transitions
pnml2lts-mc( 2/ 4): ~80000 levels ~320000 states ~1066628 transitions
pnml2lts-mc( 2/ 4): ~160000 levels ~640000 states ~2133296 transitions
pnml2lts-mc( 2/ 4): ~320000 levels ~1280000 states ~4266628 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: 2142142
pnml2lts-mc( 0/ 4): unique transitions count: 9897981
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 298100
pnml2lts-mc( 0/ 4): - claim success count: 2142148
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2142148
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2142148 states 9898008 transitions, fanout: 4.621
pnml2lts-mc( 0/ 4): Total exploration time 10.870 sec (10.810 sec minimum, 10.830 sec on average)
pnml2lts-mc( 0/ 4): States per second: 197070, Transitions per second: 910580
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 133.5MB, 15.4 B/state, compr.: 2.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 27.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 397 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 133.5MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-b002-LTLCardinality-11
ltl formula formula --ltl=/tmp/2358/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 158 places, 394 transitions and 1588 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.050 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2358/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2358/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2358/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2358/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 160 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 159, there are 397 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( 3/ 4): ~2500 levels ~10000 states ~38108 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~76292 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~127948 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~255948 transitions
pnml2lts-mc( 1/ 4): ~40000 levels ~160000 states ~511948 transitions
pnml2lts-mc( 1/ 4): ~80000 levels ~320000 states ~1023948 transitions
pnml2lts-mc( 1/ 4): ~160000 levels ~640000 states ~2047948 transitions
pnml2lts-mc( 1/ 4): ~320000 levels ~1280000 states ~4095948 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1695849
pnml2lts-mc( 0/ 4): unique transitions count: 6788266
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 117359
pnml2lts-mc( 0/ 4): - claim success count: 1695854
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1695854
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1695854 states 6788281 transitions, fanout: 4.003
pnml2lts-mc( 0/ 4): Total exploration time 8.600 sec (8.580 sec minimum, 8.590 sec on average)
pnml2lts-mc( 0/ 4): States per second: 197192, Transitions per second: 789335
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 113.7MB, 18.3 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 19.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 397 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 113.7MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-b002-LTLCardinality-12
ltl formula formula --ltl=/tmp/2358/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 158 places, 394 transitions and 1588 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2358/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2358/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2358/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2358/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 159 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 159, there are 402 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 51
pnml2lts-mc( 0/ 4): unique states count: 51
pnml2lts-mc( 0/ 4): unique transitions count: 78
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 56
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 92
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 92 states 184 transitions, fanout: 2.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9200, Transitions per second: 18400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 39.4 B/state, compr.: 6.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 397 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b002"
export BK_EXAMINATION="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-b002, 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-171640602900219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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