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-171640602900218.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602900218
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1717187659193

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
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:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:34:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:34:20] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-31 20:34:20] [INFO ] Transformed 306 places.
[2024-05-31 20:34:20] [INFO ] Transformed 840 transitions.
[2024-05-31 20:34:20] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b002-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 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 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 26 place count 196 transition count 610
Iterating global reduction 1 with 16 rules applied. Total rules applied 42 place count 196 transition count 610
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 120 place count 196 transition count 532
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 125 place count 191 transition count 522
Iterating global reduction 2 with 5 rules applied. Total rules applied 130 place count 191 transition count 522
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 135 place count 186 transition count 512
Iterating global reduction 2 with 5 rules applied. Total rules applied 140 place count 186 transition count 512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 185 transition count 508
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 185 transition count 508
Applied a total of 142 rules in 77 ms. Remains 185 /222 variables (removed 37) and now considering 508/648 (removed 140) transitions.
[2024-05-31 20:34:20] [INFO ] Flow matrix only has 333 transitions (discarded 175 similar events)
// Phase 1: matrix 333 rows 185 cols
[2024-05-31 20:34:20] [INFO ] Computed 2 invariants in 19 ms
[2024-05-31 20:34:21] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-31 20:34:21] [INFO ] Flow matrix only has 333 transitions (discarded 175 similar events)
[2024-05-31 20:34:21] [INFO ] Invariant cache hit.
[2024-05-31 20:34:21] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-31 20:34:21] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 506 sub problems to find dead transitions.
[2024-05-31 20:34:21] [INFO ] Flow matrix only has 333 transitions (discarded 175 similar events)
[2024-05-31 20:34:21] [INFO ] Invariant cache hit.
[2024-05-31 20:34:21] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 3 (OVERLAPS) 333/518 variables, 185/187 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 60/247 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 506 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/518 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 506 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 247 constraints, problems are : Problem set: 0 solved, 506 unsolved in 19169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 506/506 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 506 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 3 (OVERLAPS) 333/518 variables, 185/187 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 60/247 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 506/753 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 7 (OVERLAPS) 0/518 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 506 unsolved
No progress, stopping.
After SMT solving in domain Int declared 518/518 variables, and 753 constraints, problems are : Problem set: 0 solved, 506 unsolved in 24079 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 506/506 constraints, Known Traps: 0/0 constraints]
After SMT, in 43956ms problems are : Problem set: 0 solved, 506 unsolved
Search for dead transitions found 0 dead transitions in 43979ms
Starting structural reductions in LTL mode, iteration 1 : 185/222 places, 508/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44708 ms. Remains : 185/222 places, 508/648 transitions.
Support contains 51 out of 185 places after structural reductions.
[2024-05-31 20:35:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-31 20:35:05] [INFO ] Flatten gal took : 64 ms
[2024-05-31 20:35:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA FunctionPointer-PT-b002-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:35:05] [INFO ] Flatten gal took : 31 ms
[2024-05-31 20:35:05] [INFO ] Input system was already deterministic with 508 transitions.
Support contains 42 out of 185 places (down from 51) after GAL structural reductions.
RANDOM walk for 40001 steps (65 resets) in 1912 ms. (20 steps per ms) remains 2/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
[2024-05-31 20:35:06] [INFO ] Flow matrix only has 333 transitions (discarded 175 similar events)
[2024-05-31 20:35:06] [INFO ] Invariant cache hit.
[2024-05-31 20:35:06] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 122/151 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 248/399 variables, 94/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/405 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 11 (OVERLAPS) 107/512 variables, 56/233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/512 variables, 8/241 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 0/241 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/518 variables, 6/247 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 0/247 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/518 variables, 0/247 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 247 constraints, problems are : Problem set: 1 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 296/384 variables, 115/118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 52/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/390 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/510 variables, 59/232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 8/240 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/518 variables, 8/248 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/518 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 518/518 variables, and 248 constraints, problems are : Problem set: 1 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 397ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 508/508 transitions.
Graph (complete) has 750 edges and 185 vertex of which 161 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 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 161 transition count 460
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 143 transition count 372
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 143 transition count 372
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 93 place count 143 transition count 364
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 107 place count 129 transition count 336
Iterating global reduction 2 with 14 rules applied. Total rules applied 121 place count 129 transition count 336
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 125 place count 129 transition count 332
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 131 place count 123 transition count 312
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 123 transition count 312
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 143 place count 117 transition count 288
Iterating global reduction 3 with 6 rules applied. Total rules applied 149 place count 117 transition count 288
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 155 place count 111 transition count 276
Iterating global reduction 3 with 6 rules applied. Total rules applied 161 place count 111 transition count 276
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 167 place count 105 transition count 260
Iterating global reduction 3 with 6 rules applied. Total rules applied 173 place count 105 transition count 260
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 178 place count 100 transition count 248
Iterating global reduction 3 with 5 rules applied. Total rules applied 183 place count 100 transition count 248
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 188 place count 95 transition count 238
Iterating global reduction 3 with 5 rules applied. Total rules applied 193 place count 95 transition count 238
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 198 place count 90 transition count 228
Iterating global reduction 3 with 5 rules applied. Total rules applied 203 place count 90 transition count 228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 204 place count 89 transition count 226
Iterating global reduction 3 with 1 rules applied. Total rules applied 205 place count 89 transition count 226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 88 transition count 224
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 88 transition count 224
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 208 place count 87 transition count 222
Iterating global reduction 3 with 1 rules applied. Total rules applied 209 place count 87 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 215 place count 87 transition count 216
Applied a total of 215 rules in 67 ms. Remains 87 /185 variables (removed 98) and now considering 216/508 (removed 292) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 87/185 places, 216/508 transitions.
RANDOM walk for 40002 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1770369 steps, run timeout after 3001 ms. (steps per millisecond=589 ) properties seen :0 out of 1
Probabilistic random walk after 1770369 steps, saw 1101944 distinct states, run finished after 3004 ms. (steps per millisecond=589 ) properties seen :0
[2024-05-31 20:35:10] [INFO ] Flow matrix only has 135 transitions (discarded 81 similar events)
// Phase 1: matrix 135 rows 87 cols
[2024-05-31 20:35:10] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 20:35:10] [INFO ] State equation strengthened by 21 read => feed constraints.
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) 13/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/92 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 110/202 variables, 57/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/208 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/221 variables, 13/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/222 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/222 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 21/21 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) 13/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/92 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 110/202 variables, 57/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/208 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/221 variables, 13/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/222 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/222 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 208ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 87/87 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 20:35:10] [INFO ] Flow matrix only has 135 transitions (discarded 81 similar events)
[2024-05-31 20:35:10] [INFO ] Invariant cache hit.
[2024-05-31 20:35:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 20:35:10] [INFO ] Flow matrix only has 135 transitions (discarded 81 similar events)
[2024-05-31 20:35:10] [INFO ] Invariant cache hit.
[2024-05-31 20:35:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-31 20:35:10] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-31 20:35:10] [INFO ] Redundant transitions in 7 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-31 20:35:10] [INFO ] Flow matrix only has 135 transitions (discarded 81 similar events)
[2024-05-31 20:35:10] [INFO ] Invariant cache hit.
[2024-05-31 20:35:10] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 135/222 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 21/111 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 0/222 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 111 constraints, problems are : Problem set: 0 solved, 214 unsolved in 3705 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 135/222 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 21/111 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 214/325 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/222 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 325 constraints, problems are : Problem set: 0 solved, 214 unsolved in 5150 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 9019ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 9022ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9230 ms. Remains : 87/87 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 87 transition count 128
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 80 transition count 128
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 95 place count 80 transition count 110
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 131 place count 62 transition count 110
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 163 place count 46 transition count 94
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 170 place count 39 transition count 80
Iterating global reduction 2 with 7 rules applied. Total rules applied 177 place count 39 transition count 80
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 184 place count 32 transition count 66
Iterating global reduction 2 with 7 rules applied. Total rules applied 191 place count 32 transition count 66
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 198 place count 25 transition count 52
Iterating global reduction 2 with 7 rules applied. Total rules applied 205 place count 25 transition count 52
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 212 place count 25 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 212 place count 25 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 214 place count 24 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 23 transition count 45
Applied a total of 216 rules in 22 ms. Remains 23 /87 variables (removed 64) and now considering 45/216 (removed 171) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 23 cols
[2024-05-31 20:35:19] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 20:35:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:19] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 20:35:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:35:19] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:35:19] [INFO ] After 10ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-31 20:35:19] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 87 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2024-05-31 20:35:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 20:35:19] [INFO ] Flatten gal took : 24 ms
FORMULA FunctionPointer-PT-b002-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:35:19] [INFO ] Flatten gal took : 27 ms
[2024-05-31 20:35:19] [INFO ] Input system was already deterministic with 508 transitions.
Support contains 36 out of 185 places (down from 38) after GAL structural reductions.
Computed a total of 24 stabilizing places and 64 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 508/508 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 168 transition count 428
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 168 transition count 428
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 44 place count 168 transition count 418
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 155 transition count 392
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 155 transition count 392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 78 place count 155 transition count 384
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 149 transition count 364
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 149 transition count 364
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 143 transition count 340
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 143 transition count 340
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 137 transition count 328
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 137 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 132 transition count 316
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 132 transition count 316
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 129 place count 127 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 127 transition count 304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 139 place count 122 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 144 place count 122 transition count 294
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 149 place count 117 transition count 284
Iterating global reduction 2 with 5 rules applied. Total rules applied 154 place count 117 transition count 284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 116 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 115 transition count 280
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 115 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 164 place count 115 transition count 274
Applied a total of 164 rules in 62 ms. Remains 115 /185 variables (removed 70) and now considering 274/508 (removed 234) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 115/185 places, 274/508 transitions.
[2024-05-31 20:35:19] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:35:19] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:35:19] [INFO ] Input system was already deterministic with 274 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 508/508 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 171 transition count 444
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 171 transition count 444
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 171 transition count 432
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 160 transition count 410
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 160 transition count 410
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 74 place count 160 transition count 398
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 156 transition count 386
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 156 transition count 386
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 152 transition count 370
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 152 transition count 370
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 148 transition count 362
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 148 transition count 362
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 145 transition count 354
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 145 transition count 354
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 142 transition count 346
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 142 transition count 346
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 139 transition count 340
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 139 transition count 340
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 119 place count 136 transition count 334
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 136 transition count 334
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 135 transition count 332
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 135 transition count 332
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 134 transition count 330
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 134 transition count 330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 133 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 133 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 133 transition count 318
Applied a total of 138 rules in 66 ms. Remains 133 /185 variables (removed 52) and now considering 318/508 (removed 190) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 133/185 places, 318/508 transitions.
[2024-05-31 20:35:19] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:35:19] [INFO ] Flatten gal took : 14 ms
[2024-05-31 20:35:19] [INFO ] Input system was already deterministic with 318 transitions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 508/508 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 170 transition count 428
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 170 transition count 428
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 170 transition count 422
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 156 transition count 394
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 156 transition count 394
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 156 transition count 390
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 151 transition count 374
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 151 transition count 374
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 146 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 146 transition count 354
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 141 transition count 344
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 141 transition count 344
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 136 transition count 330
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 136 transition count 330
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 131 transition count 316
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 131 transition count 316
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 123 place count 126 transition count 306
Iterating global reduction 2 with 5 rules applied. Total rules applied 128 place count 126 transition count 306
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 133 place count 121 transition count 296
Iterating global reduction 2 with 5 rules applied. Total rules applied 138 place count 121 transition count 296
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 119 transition count 292
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 119 transition count 292
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 117 transition count 288
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 117 transition count 288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 116 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 116 transition count 286
Applied a total of 148 rules in 28 ms. Remains 116 /185 variables (removed 69) and now considering 286/508 (removed 222) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 116/185 places, 286/508 transitions.
[2024-05-31 20:35:19] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:35:19] [INFO ] Flatten gal took : 10 ms
[2024-05-31 20:35:20] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 508/508 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 167 transition count 420
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 167 transition count 420
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 44 place count 167 transition count 412
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 152 transition count 382
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 152 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 152 transition count 378
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 85 place count 145 transition count 354
Iterating global reduction 2 with 7 rules applied. Total rules applied 92 place count 145 transition count 354
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 99 place count 138 transition count 326
Iterating global reduction 2 with 7 rules applied. Total rules applied 106 place count 138 transition count 326
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 132 transition count 314
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 132 transition count 314
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 126 transition count 298
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 136 place count 120 transition count 282
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 120 transition count 282
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 148 place count 114 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 154 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 160 place count 108 transition count 258
Iterating global reduction 2 with 6 rules applied. Total rules applied 166 place count 108 transition count 258
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 106 transition count 254
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 106 transition count 254
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 172 place count 104 transition count 250
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 104 transition count 250
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 176 place count 102 transition count 246
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 102 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 102 transition count 244
Applied a total of 180 rules in 56 ms. Remains 102 /185 variables (removed 83) and now considering 244/508 (removed 264) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 102/185 places, 244/508 transitions.
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 9 ms
[2024-05-31 20:35:20] [INFO ] Input system was already deterministic with 244 transitions.
RANDOM walk for 16123 steps (51 resets) in 98 ms. (162 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-b002-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 508/508 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 167 transition count 420
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 167 transition count 420
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 44 place count 167 transition count 412
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 152 transition count 382
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 152 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 152 transition count 378
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 146 transition count 358
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 146 transition count 358
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 140 transition count 334
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 140 transition count 334
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 134 transition count 322
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 134 transition count 322
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 120 place count 128 transition count 306
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 128 transition count 306
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 132 place count 122 transition count 290
Iterating global reduction 2 with 6 rules applied. Total rules applied 138 place count 122 transition count 290
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 116 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 116 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 110 transition count 266
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 108 transition count 262
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 108 transition count 262
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 106 transition count 258
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 106 transition count 258
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 172 place count 104 transition count 254
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 104 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 176 place count 104 transition count 252
Applied a total of 176 rules in 50 ms. Remains 104 /185 variables (removed 81) and now considering 252/508 (removed 256) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 104/185 places, 252/508 transitions.
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:35:20] [INFO ] Input system was already deterministic with 252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 508/508 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 169 transition count 436
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 169 transition count 436
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 44 place count 169 transition count 424
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 156 transition count 398
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 156 transition count 398
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 82 place count 156 transition count 386
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 152 transition count 374
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 152 transition count 374
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 149 transition count 362
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 149 transition count 362
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 146 transition count 356
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 146 transition count 356
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 143 transition count 346
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 143 transition count 346
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 140 transition count 336
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 140 transition count 336
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 117 place count 137 transition count 330
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 137 transition count 330
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 135 transition count 326
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 135 transition count 326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 134 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 134 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 133 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 133 transition count 322
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 132 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 132 transition count 320
Applied a total of 130 rules in 26 ms. Remains 132 /185 variables (removed 53) and now considering 320/508 (removed 188) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 132/185 places, 320/508 transitions.
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 10 ms
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:35:20] [INFO ] Input system was already deterministic with 320 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 508/508 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 168 transition count 424
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 168 transition count 424
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 42 place count 168 transition count 416
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 154 transition count 388
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 154 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 154 transition count 384
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 148 transition count 364
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 148 transition count 364
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 142 transition count 340
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 142 transition count 340
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 136 transition count 328
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 136 transition count 328
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 130 transition count 312
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 130 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 128 place count 124 transition count 296
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 124 transition count 296
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 140 place count 118 transition count 284
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 118 transition count 284
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 152 place count 112 transition count 272
Iterating global reduction 2 with 6 rules applied. Total rules applied 158 place count 112 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 110 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 108 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 108 transition count 264
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 106 transition count 260
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 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 2 with 4 rules applied. Total rules applied 174 place count 106 transition count 256
Applied a total of 174 rules in 60 ms. Remains 106 /185 variables (removed 79) and now considering 256/508 (removed 252) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 106/185 places, 256/508 transitions.
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 9 ms
[2024-05-31 20:35:20] [INFO ] Input system was already deterministic with 256 transitions.
RANDOM walk for 16736 steps (47 resets) in 65 ms. (253 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-b002-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 508/508 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 167 transition count 420
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 167 transition count 420
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 44 place count 167 transition count 412
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 152 transition count 382
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 152 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 152 transition count 378
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 85 place count 145 transition count 354
Iterating global reduction 2 with 7 rules applied. Total rules applied 92 place count 145 transition count 354
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 98 place count 139 transition count 330
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 139 transition count 330
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 110 place count 133 transition count 318
Iterating global reduction 2 with 6 rules applied. Total rules applied 116 place count 133 transition count 318
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 122 place count 127 transition count 304
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 134 place count 121 transition count 290
Iterating global reduction 2 with 6 rules applied. Total rules applied 140 place count 121 transition count 290
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 146 place count 115 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 115 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 158 place count 109 transition count 266
Iterating global reduction 2 with 6 rules applied. Total rules applied 164 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 108 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 107 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 106 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 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 2 with 4 rules applied. Total rules applied 174 place count 106 transition count 256
Applied a total of 174 rules in 40 ms. Remains 106 /185 variables (removed 79) and now considering 256/508 (removed 252) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 106/185 places, 256/508 transitions.
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 9 ms
[2024-05-31 20:35:20] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 508/508 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 172 transition count 444
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 172 transition count 444
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 34 place count 172 transition count 436
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 44 place count 162 transition count 416
Iterating global reduction 1 with 10 rules applied. Total rules applied 54 place count 162 transition count 416
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 158 transition count 402
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 158 transition count 402
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 154 transition count 386
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 154 transition count 386
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 150 transition count 378
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 150 transition count 378
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 146 transition count 368
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 146 transition count 368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 143 transition count 360
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 143 transition count 360
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 140 transition count 354
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 140 transition count 354
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 137 transition count 348
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 137 transition count 348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 136 transition count 346
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 136 transition count 346
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 135 transition count 344
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 135 transition count 344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 134 transition count 342
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 134 transition count 342
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 116 place count 134 transition count 336
Applied a total of 116 rules in 51 ms. Remains 134 /185 variables (removed 51) and now considering 336/508 (removed 172) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 134/185 places, 336/508 transitions.
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 10 ms
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:35:20] [INFO ] Input system was already deterministic with 336 transitions.
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:35:20] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:35:20] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-31 20:35:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 185 places, 508 transitions and 2042 arcs took 4 ms.
Total runtime 60352 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FunctionPointer-PT-b002-CTLFireability-2024-00
Could not compute solution for formula : FunctionPointer-PT-b002-CTLFireability-2024-02
Could not compute solution for formula : FunctionPointer-PT-b002-CTLFireability-2024-06
Could not compute solution for formula : FunctionPointer-PT-b002-CTLFireability-2024-09
Could not compute solution for formula : FunctionPointer-PT-b002-CTLFireability-2024-10
Could not compute solution for formula : FunctionPointer-PT-b002-CTLFireability-2023-13
Could not compute solution for formula : FunctionPointer-PT-b002-CTLFireability-2023-14

BK_STOP 1717187720954

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name FunctionPointer-PT-b002-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/552/ctl_0_
ctl formula name FunctionPointer-PT-b002-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/552/ctl_1_
ctl formula name FunctionPointer-PT-b002-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/552/ctl_2_
ctl formula name FunctionPointer-PT-b002-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/552/ctl_3_
ctl formula name FunctionPointer-PT-b002-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/552/ctl_4_
ctl formula name FunctionPointer-PT-b002-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/552/ctl_5_
ctl formula name FunctionPointer-PT-b002-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/552/ctl_6_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CTLFireability"
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 CTLFireability"
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-171640602900218"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;